Hierarchical clustering algorithm for fast image retrieval

Santhana Krishnamachari, Mohamed Abdel-Mottaleb

Research output: Chapter in Book/Report/Conference proceedingChapter

32 Citations (Scopus)

Abstract

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)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
PublisherSociety of Photo-Optical Instrumentation Engineers
Pages427-435
Number of pages9
Volume3656
StatePublished - 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

Other

OtherProceedings of the 1999 7th Conference of the Storage and Retrieval for Image and Video Databases VII
CitySan Jose, Ca, USA
Period1/26/991/29/99

Fingerprint

Image retrieval
Clustering algorithms
retrieval
set theory
Experiments
Color
color

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Krishnamachari, S., & Abdel-Mottaleb, M. (1999). Hierarchical clustering algorithm for fast image retrieval. In Proceedings of SPIE - The International Society for Optical Engineering (Vol. 3656, pp. 427-435). Society of Photo-Optical Instrumentation Engineers.

Hierarchical clustering algorithm for fast image retrieval. / Krishnamachari, Santhana; Abdel-Mottaleb, Mohamed.

Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3656 Society of Photo-Optical Instrumentation Engineers, 1999. p. 427-435.

Research output: Chapter in Book/Report/Conference proceedingChapter

Krishnamachari, S & Abdel-Mottaleb, M 1999, Hierarchical clustering algorithm for fast image retrieval. in Proceedings of SPIE - The International Society for Optical Engineering. vol. 3656, Society of Photo-Optical Instrumentation Engineers, pp. 427-435, Proceedings of the 1999 7th Conference of the Storage and Retrieval for Image and Video Databases VII, San Jose, Ca, USA, 1/26/99.
Krishnamachari S, Abdel-Mottaleb M. Hierarchical clustering algorithm for fast image retrieval. In Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3656. Society of Photo-Optical Instrumentation Engineers. 1999. p. 427-435
Krishnamachari, Santhana ; Abdel-Mottaleb, Mohamed. / Hierarchical clustering algorithm for fast image retrieval. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3656 Society of Photo-Optical Instrumentation Engineers, 1999. pp. 427-435
@inbook{1a595d1bade342c38fe1aca43d98cefa,
title = "Hierarchical clustering algorithm for fast image retrieval",
abstract = "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.",
author = "Santhana Krishnamachari and Mohamed Abdel-Mottaleb",
year = "1999",
language = "English (US)",
volume = "3656",
pages = "427--435",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",
publisher = "Society of Photo-Optical Instrumentation Engineers",

}

TY - CHAP

T1 - Hierarchical clustering algorithm for fast image retrieval

AU - Krishnamachari, Santhana

AU - Abdel-Mottaleb, Mohamed

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032625877&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032625877&partnerID=8YFLogxK

M3 - Chapter

VL - 3656

SP - 427

EP - 435

BT - Proceedings of SPIE - The International Society for Optical Engineering

PB - Society of Photo-Optical Instrumentation Engineers

ER -