• Physical Therapy Korea
• /
• v.28 no.4
• /
• pp.235-244
• /
• 2021

Background: The body schema, which is constantly updated using somatosensory information, enables accurate movement. Since pain is reported as a possible source to alter the body schema, the left right judgement test (LRJT) has been widely used in the pain rehabilitation. However, there was a lack of consistency in the effect of the pain on the LRJT results, and for the effect of the LRJT as a part of intervention programs for pain patients. The deeper understand of the LRJT is necessary for better reproducibility, and to expand the therapeutic applications of the LRJT in the pain and musculoskeletal rehabilitation. Objects: This literature review aimed to understand the LRJT and to study the potential of the LRJT for therapeutic applications. Methods: The PubMed database was searched for studies relevant to LRJT. To establish the query set, the term was regarded from various perspectives. Results: The selected studies were classified into three categories: LRJT development, factors influencing LRJT, and therapeutic applications. Conclusion: Left right judgement test is the evaluation tool for the integrity of body schema as well as a tool for implicit motor imagery. Pain, proprioception, and other factors influence the performance of the LRJT.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.72-75
• /
• 2020

조립 부품 이미지에 해당하는 3D CAD 모델 매칭 기술은 최근 로봇 조립 기술의 발전으로 필요성이 대두되고 있다. 이미지 기반 3 차원 모델 매칭 연구는 진행되어 왔지만 가구 부품 이미지와는 특성이 다른 RGB[5] 이미지나 스케치 이미지를 다루는[1] 접근들이었다. 딥러닝을 사용하는 스케치 이미지 기반 3 차원 물제 검색 연구에서는 대부분 3 차원 이미지를 다각도에서 렌더링한 view 이미지들에서 feature를 추출하고 pooling 하여 하나의 feature를 출력한다. 그러나 기존의 view pooling 방식은 단순한 평균 방식으로, 부품 이미지에 따른 view를 반영하기에는 한계가 있었다. 따라서 본 논문에서는 조립 부품 이미지 기반 3 차원 물체 검색을 위해 query 부품 이미지에 따라 다른 view 이미지에 집중할 수 있는 방식의 attentional view pooling을 제안한다. 또한 조립 부품 데이터의 특성 상 class 당 CAD 모델이 하나인 상황이므로 학습 데이터가 터무니없이 부족하여 이를 해결하기 위한 학습 데이터 증강 방법을 제안한다. 실험은 의자 부품 11가지에 대해 진행하였고 이를 통해 제안하는 방식의 성능을 입증하였다.

• The KIPS Transactions:PartD
• /
• v.18D no.1
• /
• pp.9-22
• /
• 2011

In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.183-189
• /
• 2009

Recently, PCS, PDA and mobile devices, such as the proliferation of spread, GPS (Global Positioning System) the use of, the rapid development of wireless network and a regular user even images, audio, video, multimedia data, such as increased use is for. In particular, video data among multimedia data, unlike the moving object, text or image data that contains information about the movements and changes in the space of time, depending on the kinds of changes that have sigongganjeok attributes. Spatial location of objects on the flow of time, changing according to the moving object (Moving Object) of the continuous movement trajectory of the meeting is called, from the user from the database that contains a given query trajectory and data trajectory similar to the finding of similar trajectory Search (Similar Sub-trajectory Retrieval) is called. To search for the trajectory, and these variations, and given the similar trajectory of the user query (Tolerance) in the search for a similar trajectory to approximate data matching (Approximate Matching) should be available. In addition, a large multimedia data from the database that you only want to be able to find a faster time-effective ways to search different from the existing research is required. To this end, in this paper effectively divided into a grid to search for the trajectory to the trajectory of moving objects, similar to the effective support of the search trajectory offers a new grid-based search techniques.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.19 no.3
• /
• pp.16-28
• /
• 2016

Advancing geo-spatial web technologies and their applications require compatible and interoperable heterogeneous browsers and platforms. Reduction of common or supporting components for web-based system development is also necessary. If properly understood and applied, OGC-based standards can be utilized as effective solutions for these problems. Thus, OGC standards are central to the design and development of web-based geo-spatial systems, and are particularly applicable to web services, which contain data processing modules. However, the application for OGC WPS 2.0 is at an early stage as compared with other OGC standards; thus, this study describes a test implementation of a web-based geo-spatial processing system with OGC WPS 2.0 focused on asynchronous processing functionality. While a binary thresholding algorithm was tested in this system, further experiments with other processing modules can be performed on requests for many types of processing from multiple users. The client system of the implemented product was based on open sources such as jQuery and OpenLayers, and server-side running on Spring framework also used various types of open sources such as ZOO project, and GeoServer. The results of geo-spatial image processing by this system implies further applicability and extensibility of OGC WPS 2.0 on user interfaces for practical applications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• The KIPS Transactions:PartD
• /
• v.15D no.3
• /
• pp.399-410
• /
• 2008

This paper suggests a new retrieval method using weighted vector sum to resolve a problem of traditional location-based retrieval method, nearest neighbor (NN) query, and NN query using direction. The proposed method filters out data with the radius, and then the remained retrieval area is filtered by a direction information compounded of a user's moving direction, a pre-fixed interesting direction, and a pre-fixed retrieval angle. The moving direction is computed from a vector or a weighted vector sum of several vectors using a weight to adopt several cases. The retrieval angle can be set from traditional $360^{\circ}$ to any degree you want. The retrieval data for this method can be a still and moving image recorded shooting location, and also several type of media like text, web, picture offering to customer with location of company or resort. The suggested method guarantees more accurate retrieval than traditional location-based retrieval methods because that the method selects data within the radius and then removes data of useless areas like passed areas or an area of different direction. Moreover, this method is more flexible and includes the direction based NN.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.251-258
• /
• 1998

The purpose of this study is to develop the District-level Planning Support System (DPSS) by using GIS. The district-level planning which is related for district-level control of city, needs the various parcel-level information which is composing the urban physical environment. The information has to be stored and analyzed for recognizing the study area, then the district-level planning will be efficiently managed. The use of GIS in the process of district-level planning is restricted for the creation of thematic map. GIS is not used for the analysis of spatial patterns and planning process. This study evaluates the characteristics of current district-level planning and the basic components of urban physical environment. And the database model is built. The topology among components is defined by using the spatial relationship. Then the spatial query machine for district-level planing is developed by using ArcView 3.1, Avenue and Dialog Extension. This spatial query machine is applied for case study. This study shows 1) the possibility of the district-level planning support system for analyzing spatial relationship, 2) the needs of the up-to-date topographic map showing current building's footlines and the complete integration with cadastral maps, it will reduce the uncertainty in the spatial decision making process, 3) the methodology for the construction of spatial decision making rules, 4) the further study for the using of raster, network, image and three dimension data.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.1
• /
• pp.1-7
• /
• 2010

With the widespread use of vision-based surveillance systems, the capability for person identification is now an essential component. However, the CCTV cameras used in surveillance systems tend to produce relatively low-resolution images, making it difficult to use face recognition techniques for person identification. Therefore, an algorithm is proposed for person identification in CCTV camera images based on the clothing. Whenever a person is authenticated at the main entrance of a building, the clothing feature of that person is extracted and added to the database. Using a given image, the clothing area is detected using background subtraction and skin color detection techniques. The clothing feature vector is then composed of textural and color features of the clothing region, where the textural feature is extracted based on a local edge histogram, while the color feature is extracted using octree-based quantization of a color map. When given a query image, the person can then be identified by finding the most similar clothing feature from the database, where the Euclidean distance is used as the similarity measure. Experimental results show an 80% success rate for person identification with the proposed algorithm, and only a 43% success rate when using face recognition.