Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

SOMk-NN Search Algorithm for Content-Based Retrieval

내용기반 검색을 위한 SOMk-NN탐색 알고리즘

  • 오군석 (광주보건대학 디지털미디어과) ;
  • 김판구 (조선대학교 컴퓨터공학부)
  • Published : 2002.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

특징정보를 기반으로 한 유사 이미지 검색은 이미지 데이타베이스에 있어서 중요한 과제의 하나이다. 이미지 데이타의 특징정보는 각 이미지를 식별하는데 유용한 정보이다. 본 논문에서는 자기 조직화 맵 기반의 고속 k-NN 탐색 알고리즘을 제안한다. 자기 조직화 맵은 고차원 특징벡터를 2차원 공간에 맵핑하여 위상특징 맵을 생성한다. 위상특징 맵은 입력 데이타의 특징공간과 상호관계(유사성)를 가지고 있으며, 인접노드에 서로 유사한 특징벡터가 클러스터링된다. 그러므로 위상특징 맵상의 각 노드에는 노드 벡터와 각 노드벡터에 가장 가까운 유사 이미지가 분류된다. 이러한 자기 조직화 맵에 의한 유사 이미지 분류결과에 대하여 k-NV 탐색을 구현하기 위하여, (1) 위상특징 맵에 대한 접근방법, (2) 고속탐색을 위한 pruning strategy의 적용을 실현하였다. 본 연구에서는 실험을 통하여 실제 이미지로부터 추출한 색상 특징을 사용하여 제안한 알고리즘의 성능을 평가함으로써 유사 이미지 검색에 유효한 견과를 얻을 수 있었다.

Keywords

References

  1. Kohonen, T., 'Self-Organizing Maps,' Series in Information Sciences, vol.30, Springer-Verlag, Third edition, Berlin (2001)
  2. Kohonen, T., Hynninen, J., and Laaksonen, J., 'SOM_PAKThe Self-Organizing Map Program Package,' In Technical Report A31, Helsinki University of Technology, Laboratory of Computer and Information science (1996)
  3. Gudivada, V. N.and Raghavan, V. V. eds., 'Content-based Image Retrieval System,' IEEE Computer, Vol.28, No.9, pp. 18-22 (1995) https://doi.org/10.1109/2.410145
  4. Flickner, M. et al., 'Query by Image and Video Content: The QBIC System,' IEEE Computer, Vol.28, No.9, pp. 23-32 (1995) https://doi.org/10.1109/2.410146
  5. Faloutsos, C. et al., 'Efficient and Effective Query by Image Content,' J. Intell. Inform. Syst., Vol.3, pp.231-262 (1994) https://doi.org/10.1007/BF00962238
  6. Faloutsos, C., Ranganathan, M., and Manolopoulos, Y., 'Fast Subsequence Matching in Time-Series Databases,' ACM SIGMOD, 1994 https://doi.org/10.1145/191843.191925
  7. Rui, Y., Huang, T. and Chang S-F., 'Image Retrieval: Current Techniques, Promising Directions, and Open Issues,' J. Visual Communication and Image Representation(JVCIR), Vol.10, No.1, pp, 39-62 (1999) https://doi.org/10.1006/jvci.1999.0413
  8. Roussopoulos, N., Kelley, S. and Vincent, F., 'Nearest neighbor queries,' In Proceedings of the ACM SIGMOD Conference, pp.71-79, San Jose, CA, May (1995) https://doi.org/10.1145/223784.223794
  9. Mallat,S. G., 'Multifrequency channel decompositions of images and wavelet models,' IEEE. Trans., Acoust.,Speech and Signal Proc., Vol.37, No.12, pp. 2091-2110 (1989) https://doi.org/10.1109/29.45554
  10. Smith, J. R. and Chang, S-F., 'VisuaISEEk:A Fully Automated Content-Based Image Query System,' Proc. ACM Intl. Conf. on Multimedia, Boston, pp.87-98 (1996) https://doi.org/10.1145/244130.244151
  11. Pentland, A., Picard, R. W. and Schlaroff, S., 'Photo book: Tools for Content-Based Manupulation of Image Databases,' SPIE Storage and Retrieval for Image and Video Databases II, San Joes, pp, 34-47 (1994) https://doi.org/10.1117/12.171786
  12. Jacobs, C. E., Finkelstein, A. and Salesin, D. H., 'Fast multiresolution Image Querying,' Proc. SIGGRAPH95, Los Angeles, California, pp.6-11 (1995)
  13. N. Beckmann, H. Kriegel, R Schneider, and B. Seeger, '$R^*$-tree: an efficient and robust access method for points and rectangles,' In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp.322-331, May 1990 https://doi.org/10.1145/93597.98741
  14. Chakrabarti, K, and Mehrotra, S., 'The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces,' In Proc. of IEEE ICDE99, Mar. 1999 https://doi.org/10.1109/ICDE.1999.754960
  15. Berchtold, S., Keim, D., and Kriegel, H. P., 'The X-Tree: An Index Structure for High-Dimensional Data,' VLDB, 1996
  16. Sakurai, A., Yoshikawa, M., and Uemura, S., 'The A-Tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation,' , 2000
  17. Chakrabarti, K., and Mehrotra, S., 'Local Dimensionality Reduction: a New Approach to Indexing High Dimensional Spaces,' VLDB2000, Egypt, 2000
  18. Bellman, R., 'Adaptive Control Process: A Guided Tour,' Princeton University Press, pp.94-95, 1961
  19. Russ, J. C., 'The Image Processing Handbook,' CRC Press, Boca Raton, 1995
  20. Int'l Conf. on Data Eng. (ICDE) Fast Nearest Neighbor Search in High Deimensional Space Berchtold,S.;Ertl,B.;Kriegel,H.P.;Seidl,T.
  21. Berchtold, S., Ertl, B., Kriegel, H. P., and Seidl, T., 'Fast Nearest Neighbor Search in High-Dimensional Space,' Int'l Conf. on Data Eng. (ICDE), 1998 https://doi.org/10.1109/ICDE.1998.655779
  22. Smeulders, A., Warring, M., Santini, S., Gupta, A., and Jain, R., 'Image Databases at the end of the Early Years' IEEE Transactions on Pattern Analysis and Machine Intelligence Vol.23, No.1, January 2001