A Method of Highs Similarity Retrieval based on Self - Organizing Maps 


Vol. 8,  No. 5, pp. 515-522, Oct.  2001
10.3745/KIPSTB.2001.8.5.515


PDF
  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 highspeed 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. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented about 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.

  Statistics
  Cite this article

[IEEE Style]

K. S. Oh, S. K. Yang, S. H. Bae, P. K. Kim, "A Method of Highs Similarity Retrieval based on Self - Organizing Maps," The KIPS Transactions:PartB , vol. 8, no. 5, pp. 515-522, 2001. DOI: 10.3745/KIPSTB.2001.8.5.515.

[ACM Style]

Kun Seok Oh, Sung Ki Yang, Sang Hyun Bae, and Pan Koo Kim. 2001. A Method of Highs Similarity Retrieval based on Self - Organizing Maps. The KIPS Transactions:PartB , 8, 5, (2001), 515-522. DOI: 10.3745/KIPSTB.2001.8.5.515.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals