Distributional Distances in Color Image Retrieval with GMVQ-Generated Histograms

  • Sangoh Jeong
Conference paper

DOI: 10.1007/11526346_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3568)
Cite this paper as:
Jeong S. (2005) Distributional Distances in Color Image Retrieval with GMVQ-Generated Histograms. In: Leow WK., Lew M.S., Chua TS., Ma WY., Chaisorn L., Bakker E.M. (eds) Image and Video Retrieval. CIVR 2005. Lecture Notes in Computer Science, vol 3568. Springer, Berlin, Heidelberg

Abstract

We investigate and compare the performance of several distributional distances in generic color image retrieval with an emphasis on symmetry and boundedness of the distances. Two histogram generation methods based on Gauss mixture vector quantization (GMVQ) are compared using Kullback-Leibler divergence (KLD). The joint histogram method shows a better retrieval performance than the Bayesian retrieval with the label histograms of interleaved data. A variety of distance measures are tested and compared for the joint histogram features produced by GMVQ, including an important set of Ali-Silvey distances, the Bhattacharyya distance, and a few other divergence measures based on Shannon entropy. Experimental results show that the Bhattacharyya distance and the L divergence are better than the histogram intersection (HI), but the KLD is poorer than the HI. In all cases, the symmetric version of a distance performs better than the asymmetric one and usually the bounded version of a distance gives better retrieval performance than the corresponding non-bounded.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sangoh Jeong
    • 1
  1. 1.Dept. of Electrical EngineeringStanford UniversityStanfordUSA

Personalised recommendations