Scalable algorithm for image retrieval by color

Santhana Krishnamachari, Mohamed Abdel-Mottaleb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

To deal with large databases, 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. Thus the retrieval is scalable to large databases. Experiments show that this clustering based approach offers a superior response time without sacrificing the retrieval accuracy, which is crucial for large databases.

Original languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE Comp Soc
Pages119-122
Number of pages4
Volume3
StatePublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) - Chicago, IL, USA
Duration: Oct 4 1998Oct 7 1998

Other

OtherProceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3)
CityChicago, IL, USA
Period10/4/9810/7/98

Fingerprint

Image retrieval
Color
Clustering algorithms
Experiments

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Krishnamachari, S., & Abdel-Mottaleb, M. (1998). Scalable algorithm for image retrieval by color. In IEEE International Conference on Image Processing (Vol. 3, pp. 119-122). Los Alamitos, CA, United States: IEEE Comp Soc.

Scalable algorithm for image retrieval by color. / Krishnamachari, Santhana; Abdel-Mottaleb, Mohamed.

IEEE International Conference on Image Processing. Vol. 3 Los Alamitos, CA, United States : IEEE Comp Soc, 1998. p. 119-122.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Krishnamachari, S & Abdel-Mottaleb, M 1998, Scalable algorithm for image retrieval by color. in IEEE International Conference on Image Processing. vol. 3, IEEE Comp Soc, Los Alamitos, CA, United States, pp. 119-122, Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3), Chicago, IL, USA, 10/4/98.
Krishnamachari S, Abdel-Mottaleb M. Scalable algorithm for image retrieval by color. In IEEE International Conference on Image Processing. Vol. 3. Los Alamitos, CA, United States: IEEE Comp Soc. 1998. p. 119-122
Krishnamachari, Santhana ; Abdel-Mottaleb, Mohamed. / Scalable algorithm for image retrieval by color. IEEE International Conference on Image Processing. Vol. 3 Los Alamitos, CA, United States : IEEE Comp Soc, 1998. pp. 119-122
@inproceedings{1a28293a968b49e39762854948b22424,
title = "Scalable algorithm for image retrieval by color",
abstract = "To deal with large databases, 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. Thus the retrieval is scalable to large databases. Experiments show that this clustering based approach offers a superior response time without sacrificing the retrieval accuracy, which is crucial for large databases.",
author = "Santhana Krishnamachari and Mohamed Abdel-Mottaleb",
year = "1998",
month = "12",
day = "1",
language = "English",
volume = "3",
pages = "119--122",
booktitle = "IEEE International Conference on Image Processing",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Scalable algorithm for image retrieval by color

AU - Krishnamachari, Santhana

AU - Abdel-Mottaleb, Mohamed

PY - 1998/12/1

Y1 - 1998/12/1

N2 - To deal with large databases, 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. Thus the retrieval is scalable to large databases. Experiments show that this clustering based approach offers a superior response time without sacrificing the retrieval accuracy, which is crucial for large databases.

AB - To deal with large databases, 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. Thus the retrieval is scalable to large databases. Experiments show that this clustering based approach offers a superior response time without sacrificing the retrieval accuracy, which is crucial for large databases.

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

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

M3 - Conference contribution

VL - 3

SP - 119

EP - 122

BT - IEEE International Conference on Image Processing

PB - IEEE Comp Soc

CY - Los Alamitos, CA, United States

ER -