• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• Journal of information and communication convergence engineering
• /
• v.15 no.3
• /
• pp.175-181
• /
• 2017

This paper describes the upgrade of an existing wave information retrieval algorithm by employing noise reduction in the pixel domain. Several algorithms for collecting wave information parameters from X-band radar image sequences including the wind field and current velocity have been developed over the past three decades. Using these algorithms, a band-pass filter (BPF) is applied to remove the non-wave contribution from the image spectra after the sea surface current velocity has been computed. However, such BPF designs have been both complex and insufficient in removing undesired components in X-band radar images. For this study, to improve the performance of wave information retrieval, an efficient noise reduction algorithm is incorporated into a regular wave information retrieval process. That is, the proposed algorithm was designed for operation in a more proper manner by effectively removing the undesired components in the pixel domain. Experiment results demonstrate that the proposed algorithm produces very close estimates to the buoy data records under undesirable noise conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.469-478
• /
• 2010

This paper proposes the effective shape descriptor for 3D foot pose estimation. To reduce processing time, silhouette-based foot image database is built and meta information which involves the 3D pose of the foot is appended to the database. And we proposed a modified Centroid Contour Distance whose size of the feature space is small and performance of pose estimation is better than the others. In order to analyze performance of the descriptor, we evaluate time and spatial complexity with retrieval accuracy, and then compare with the previous methods. Experimental results show that the proposed descriptor is more effective than the previous methods on feature extraction time and pose estimation accuracy.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.3-6
• /
• 2001

본 논문에서는 Bipartite 매칭을 이용한 2D/3D 검색 시스템을 제안한다. 2D/3D 검색 시스템에서 3D 물체 사이의 유사도는 각각의 2D 실루엣 이미지들간의 매칭을 통해 얻어진다. 그러나 기존의 매칭 방법은 전체 매칭(Fuii MatchinE) 방법으로 연산량이 많기 때문에 Bipartite 매칭 방법을 사용하여 연산량을 줄이고 검색 속도의 성능을 향상시킨다. 기존의 방법과 제안된 방법의 검색 속도 비교를 통해 Bipartite 매칭을 이용한 2D/3D 검색 시스템의 효율성을 나타낸다.

• Journal of Digital Contents Society
• /
• v.10 no.3
• /
• pp.423-431
• /
• 2009

There are various image retrieval methods using shape, color and texture features. One of the most active area is using shape and color information. A number of shape representations have been suggested to recognize shapes even under affine transformation. There are many kinds of method for shape recognition, the well-known method is Fourier descriptors and moment invariant. The other method is CSS(Curvature Scale Space). The maxima of curvature scale space image have already been used to represent 2-D shapes in different applications. Because preexistence CSS exists several problems, in this paper we use improved CSS method for retrieval image. There are two kinds of method, One is using RGB color information feature and the other is using HSI color information feature. In this paper we used HSI color model to represent color histogram before, then use it as comparison measure. The similarity is measured by using Euclidean distance and for reduce search time and accuracy, We use DTW for measure similarity. Compare with the result of using Euclidean distance, we can find efficiency elevated.

• Journal of the Korean Society for information Management
• /
• v.32 no.3
• /
• pp.277-293
• /
• 2015

This study examined the relative retrieval effectiveness after relevance feedback between two systems (Title/Abstract and Full-text) using four different sets of relevance judgment. Four relevance levels (not relevant, marginally relevant, relevant, highly relevant) are also used, each of which is determined by referees giving a relevance score to documents. This study also investigated how much the average precision was improved after relevance feedback when "marginally relevant" documents are included in the relevant class with the Title/Abstract system, and with the Full-text retrieval system as well. It is found that the Title/Abstract system benefited from relevance feedback with the marginally relevant documents. In case of the Title/Abstract system, the higher percentage of improvement was consistently obtained when including the marginally relevant documents in the relevance class, however the result was vice versa in case of the Full-text retrieval system. It implied that the marginally relevant documents in the relevant class had caused noises in the Full-text retrieval system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.990-995
• /
• 2010

Harris corner detector is commonly used to detect feature points for recognizing 2-D or 3-D objects. However, the feature points calculated from both of query and target objects need to be same positions to guarantee accurate recognitions. In order to check the positions of calculated feature points, we generate a Huffman tree which is based on adjacent feature values as inputs. However, the structures of two Huffman trees will be same as long as both of a query and targets have same feature values no matter how different their positions are. In this paper, we sort feature values and calculate the Euclidean distances of coordinates between two adjacent feature values. The Huffman Tree is generated with these Euclidean distances. As a result, the information of point locations can be included in the generated Huffman tree. This is the main strategy for accurate recognitions. We call this system as the HRM(Hybrid Retrieval Machine). This system works very well even when artificial random noises are added to original data. HRM can be used to recognize biological data such as proteins, and it will curtail the costs which are required to biological experiments.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.332-338
• /
• 2003

Content-based image retrieval is the research of images from database, that are visually similar to given image examples. Gabor functions and Gabor filters are regarded as excellent methods for feature extraction and texture segmentation. However, they have a disadvantage not to perform well in case of a rotated image because of its direction-oriented filter. This paper proposes a method of extracting local texture features from blocks with central interest points detected in an image and a rotation invariant Gabor wavelet filter. We also propose a method of comparing pattern histograms of features classified by VQ (Vector Quantization) among images.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.3
• /
• pp.149-157
• /
• 2001

In the video retrieval system, visual clues of still images and motion information of video are employed as feature vectors. We generate the temporal textures to express the motion information whose properties are simple expression, easy to compute. We make those temporal textures of wavelet coefficients to express motion information, M components. Then, temporal texture feature vectors are extracted using spatial texture feature vectors, i.e. spatial gray-level dependence. Also, motion amount and motion centroid are computed from temporal textures. Motion trajectories provide the most important information for expressing the motion property. In our modeling system, we can extract the main motion trajectory from the temporal textures.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.