17 December 1998 Hierarchical clustering algorithm for fast image retrieval
Author Affiliations +
Abstract
Image retrieval systems, which compare the query image exhaustively with each individual image in the database, are not scalable to large databases. A scalable search system should ensure that the search time does not increase linearly with the number of images in the database. We present a clustering based indexing technique, where the images in the database are grouped into clusters of images, with similar color content using a hierarchical clustering algorithm. At search time, the query image is not compared with all the images in the database, but only with a small subset. Experiments show that this clustering-based approach offers a superior response time with high retrieval accuracy. Experiments with different database sizes indicate that for a given retrieval accuracy, the search time does not increase linearly with the database size.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Santhana Krishnamachari, Mohamed Abdel-Mottaleb, "Hierarchical clustering algorithm for fast image retrieval", Proc. SPIE 3656, Storage and Retrieval for Image and Video Databases VII, (17 December 1998); doi: 10.1117/12.333862; https://doi.org/10.1117/12.333862
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT


Back to Top