• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.50-56
• /
• 2011

This paper proposes 3D visualization method of compound knowledge which will be able to identify and search easily compound knowledge objects based the multidimensional relationship. For this, we structurized a compound knowledge with link and node which become the semantic network. and we suggested 3D visualization method using SOM. Also, to arrange compound knowledge from 3D space and to provide the chance of realistic and intuitional information retrieval to the user, we proposed compound knowledge 3D clustering methods using object similarity. Compound knowledge 3D visualization and clustering using SOM will be the optimum method to appear context of compound knowledge and connectivity in space-time.

• 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.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.1-10
• /
• 2019

Object-based image matching algorithms have been widely used in the image processing and computer vision fields. A variety of applications based on image matching algorithms have been recently developed for object recognition, 3D modeling, video tracking, and biomedical informatics. One prominent example of image matching features is the Scale Invariant Feature Transform (SIFT) scheme. However many applications using the SIFT algorithm have implemented based on stand-alone basis, not client-server architecture. In this paper, We initially implemented based on client-server structure by using SIFT algorithms to identify and match objects in biomedical images to provide useful information to the user based on the recently released Mobile platform. The major methodological contribution of this work is leveraging the convenient user interface and ubiquitous Internet connection on Mobile device for interactive delineation, segmentation, representation, matching and retrieval of biomedical images. With these technologies, our paper showcased examples of performing reliable image matching from different views of an object in the applications of semantic image search for biomedical informatics.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.33-42
• /
• 2001

Recently, the interests in the 3D image, generated from the range data and CAD, have exceedingly increased, accordingly a various 3D image database is being constructed. The efficient and fast scheme to access the desired image data is the important issue in the application area of the Internet and digital library. However, it is difficult to manage the 3D image database because of its huge size. Therefore, a proper descriptor is necessary to manage the data efficiently, including the content-based search. In this paper, the proposed shape descriptor is based on the voxelization of the 3D image. The medial axis transform, stemming from the mathematical morphology, is performed on the voxelized 3D image and the graph, which is composed of node and edge, is generated from skeletons. The generated graph is adequate to the novel shape descriptor due to no loss of geometric information and the similarity of the insight of the human. Therefore the proposed shape descriptor would be useful for the recognition of 3D object, compression, and content-based search.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.395-398
• /
• 2009

3 차원 객체 검색 및 자세 추정 기법은 의료, 보안 등의 다양한 산업 영역에서 매우 중요한 이슈 중 하나로써 연구되고 있다. 정확한 객체 검색 및 자세 추정을 위해서는 객체의 가능한 모든 영상 정보를 사용하여야 하기 때문에 많은 연산시간이 걸리게 되고, 특히 객체의 정확한 자세를 추정하기 위해서는 높은 CPU 의 성능과 큰 메모리 공간을 필요로 한다. 이러한 제약으로 인해, 3 차원 객체 검색 및 자세 추정은 상대적으로 하드웨어의 성능이 낮은 모바일 장치에서 실행되기 어려웠다. 따라서, 본 논문에서는 모바일 장치에서도 효과적으로 객체 검색 및 자세 추정이 가능하도록 하기 위한 클라이언트-서버 환경에서의 객체의 외형 기반 인덱스 구축 및 검색 기법을 제안한다. 제안된 기법의 주요 특징은 i) 모바일 장치의 하드웨어 환경을 고려하여 비교적 적은 수의 객체의 영상을 바탕으로 한 객체 검색 및 후보 자세 예측과 ii) 모바일 장치에서의 검색 결과와 많은 수의 객체 영상을 기반으로 한 서버에서의 정확한 자세 추정이다. 실험 결과에서는 제안된 기법들을 통해, 빠른 시간 내에 정확한 객체 검색 및 자세 추정이 가능함을 보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1923-1932
• /
• 1998

This paper deals with a 2-D objects recognition algorithm. And in this paper, we present an algorithm which can reduce the computation time in model retrieval by means of hashing technique instead of using the binary~tree method. In this paper, we treat an object boundary as a string of structural units and use an attributed string matching algorithm to compute similarity measure between two strings. We select from the privileged strings a privileged string wIth mmimal eccentricity. This privileged string is treated as the reference string. And thell we wllstructed hash table using the distance between privileged string and the reference string as a key value. Once the database of all model strings is built, the recognition proceeds by segmenting the scene into a polygonal approximation. The distance between privileged string extracted from the scene and the reference string is used for model hypothesis rerieval from the table. As a result of the computer simulation, the proposed method can recognize objects only computing, the distance 2-3tiems, while previous method should compute the distance 8-10 times for model retrieval.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.345-355
• /
• 2008

SIFT is popularly used in computer vision application such as object recognition, motion tracking, and 3D reconstruction among various shape descriptors. However, it is not easy to apply SIFT into the image similarity search as it is since it uses many high dimensional keypoint vectors. In this paper, we present a SIFT based image similarity search method using an edge image pyramid and an interesting region detection. The proposed method extracts keypoints, which is invariant to contrast, scale, and rotation of image, by using the edge image pyramid and removes many unnecessary keypoints from the image by using the hough transform. The proposed hough transform can detect objects of ellipse type so that it can be used to find interesting regions. Experimental results demonstrate that the retrieval performance of the proposed method is about 20% better than that of traditional SIFT in average recall.