Abstract
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchically decomposed into disjoint subsets by applying an adaptation of the k-means clustering algorithm. Since Euclidean measure may not effectively reproduce human perception of a visual content, the adaptive algorithm uses a non- Euclidean similarity metric and clustroids as cluster prototypes. Second, the derived hierarchy is searched by a branch and bound method to facilitate rapid calculation of the k-nearest neighbors for retrieval in a ranked order. The proposed procedure has the advantage of handling high dimensional data, and dealing with non-Euclidean similarity metrics in order to explore the nature of the image feature vectors.The hierarchy also provides users with a tool for quick browsing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Enser PGB. Pictorial information retrieval. Journal of Documentation, 51(2), pp. 126–170, 1995
Lew MS, Huijsmans DP, Denteneer D.Content based image retrieval: Optimal keys, Texture, Projections or Templates. Image Databases and Multi-Media Search, 1997; 8; 39–47
Faloutsos C, Equitz W, Flickner M.Efficient and Effective Querying by Image Content. Journal of Intelligent Information Systems 3, 1994; 231–262
Niblack W, Barber R, Equitz W. et al. The QBIC project: querying images by content using color, texture, shape. Proc. SPIE: Storage and Retrieval for Images and Video Databases 1993; 1908; 173–187
Corridoni J, Delbimbo A, Pala P. Image retrieval by color semantics. ACM Multimedia System Journal, 1998
Sethi IK, Coman I. Image retrieval using hierarchical self-organizing feature maps. Pattern Recognition Letters 20, 1999; 1337–1345
Rui Y, Huang TS, Chang SF. Image Retrieval: Past, Present, and Future. Journal of Visual Communication and Image Representation, 1999; 10; 1–23.
Sethi IK, Coman I, Day B et al. Color-WISE: A system for image similarity retrieval using color. Proc. SPIE: Storage and Retrieval for Image and Video Databases, 1998; 3312; 140–149
Smith JR and Chang SF. Tools and Techniques for Color Image Retrieval. Proceedings of the SPIE: Storage and Retrieval for Image and Video Databases IV, 1996; 2670; 381–392
Jain AK, Dubes RC. Algorithms for Clustering Data. Prentices Hall Advanced Reference Series, 1998
Swain MJ, Ballard DH. Color Indexing. International Journal of Computer Vision, 1991; 7(1); 11–32
Rice JA. Mathematical Statistics and Data Analysis. Duxbury Press, 1995.
Duda RO, Hart PE. Pattern classification and scene analysis. John Wiley & Sons, Inc., 1973.
Fukanaga K, Narendra PM. A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers, 1975; C-24; 750–753
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stan, D., Sethi, I.K. (2001). Image Retrieval Using a Hierarchy of Clusters. In: Singh, S., Murshed, N., Kropatsch, W. (eds) Advances in Pattern Recognition — ICAPR 2001. ICAPR 2001. Lecture Notes in Computer Science, vol 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44732-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-44732-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41767-5
Online ISBN: 978-3-540-44732-0
eBook Packages: Springer Book Archive