Hierarchical clustering algorithm for fast image retrieval

Santhana Krishnamachari, Mohamed Abdel-Mottaleb

Research output: Contribution to journalConference articlepeer-review

32 Scopus citations


Image retrieval systems that 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 a 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.

Original languageEnglish (US)
Pages (from-to)427-435
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 7th Conference of the Storage and Retrieval for Image and Video Databases VII - San Jose, Ca, USA
Duration: Jan 26 1999Jan 29 1999

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Hierarchical clustering algorithm for fast image retrieval'. Together they form a unique fingerprint.

Cite this