Abstract
In this paper we propose a new distance metric for probability density functions (PDF). The main advantage of this metric is that unlike the popular Kullback-Liebler (KL) divergence it can be computed in closed form when the PDFs are modeled as Gaussian Mixtures (GM). The application in mind for this metric is histogram based image retrieval. We experimentally show that in an image retrieval scenario the proposed metric provides as good results as the KL divergence at a fraction of the computational cost. This metric is also compared to a Bhattacharyya-based distance metric that can be computed in closed form for GMs and is found to produce better results.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11550907_163 .
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
McLachlan, G., Peel, D.: Finite Mixture Models. Wiley, Chichester (2000)
Han, J., Ma, K.: Fuzzy Color Histogram and its use in Color Image Retrieval. IEEE Trans. on Image Processing 11(8) (August 2003)
Del Bimbo, A.: Visual information Retrieval. Morgan Kaufmann publishers, San Francisco (1999)
Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1990)
Ray, S.: Distance-Based Model Selection with Application to the Analysis of Gene Expression Data. Ms Thesis, Dept. of Statistics, Pennsylvania State University (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sfikas, G., Constantinopoulos, C., Likas, A., Galatsanos, N.P. (2005). An Analytic Distance Metric for Gaussian Mixture Models with Application in Image Retrieval. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550907_132
Download citation
DOI: https://doi.org/10.1007/11550907_132
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28755-1
Online ISBN: 978-3-540-28756-8
eBook Packages: Computer ScienceComputer Science (R0)