Abstract
Efficient retrieval often requires an indexing structure on the database in question. We present an indexing scheme for cases when the dissimilarity measure is the Kullback-Liebler (KL) divergence. Devising such a scheme is difficult because the KL-divergence is not a metric, failing to satisfy the triangle inequality or even .niteness in general. We de.ne an optimal represenative of a set of distributions to serve as the basis of such an indexing structure. This representative, dubbed the exponential information theoretic center, minimizes the worst case KLdivergence from it to the elements of its set. This, along with a lower bound on the KL-divergence from the query to the elements of a set, allows us to prune the search, increasing e.ciency while guarenteeing that we never discard the nearest neighbors. We present results of querying the Princeton Shape Database which show significant speed-ups over an exhaustive search and over an analogous approach using a more mundane representative.
This work was supported in part by the NIH award NS42075 and the UF Stephen C. O’Connell Presidential Fellowship. Images in Fig. 2 were taken from the “Yale Face Database.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Osada, R., Funkhouser, T., Chazelle, B., Dobkin, D.: Shape distributions. ACM Trans. Graph. 21, 807–832 (2002)
Rubner, Y., Tomasi, C., Guibas, L.: A metric for distributions with applications to image databases. In: Proc. ICCV, pp. 59–66 (1998)
Levina, E., Bickel, P.: The earth mover’s distance is the Mallows distance: some insights from statistics. In: Proc. ICCV, pp. 251–256 (2001)
Puzicha, J., Buhmann, J.M., Rubner, Y., Tomasi, C.: Empirical evaluation of dissimilarity measures for color and texture. In: Proc. ICCV, p. 1165 (1999)
Do, M.N., Vetterli, M.: Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance. IEEE Trans. Image Process. 11, 146–158 (2002)
Varma, M., Zisserman, A.: Texture classification: Are filter banks necessary? In: Proc. CVPR, pp. 691–698 (2003)
Gordon, S., Goldberger, J., Greenspan, H.: Applying the information bottleneck principle to unsupervised clustering of discrete and continuous image representations. In: Proc. ICCV, pp. 370–396 (2003)
Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: image segmentation using expectation-maximization and its application to image querying. IEEE PAMI 24, 1026–1038 (2002)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley & Sons, New York (1991)
Omohundro, S.M.: Bumptrees for efficient function, constraint, and classification learning. In: Proc. NIPS. (1990) 693–699
Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 311–321 (1993)
Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40, 175–179 (1991)
Rao, M., Spellman, E., Vemuri, B.C., Amari, S.I.: Information theoretic centers of distributions and their properties. IEEE Trans. Inform. Theory (2005) (submitted)
Csiszár, I., Kőrner, J.G.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, Inc., New York (1981)
Davisson, L.D., Leon-Garcia, A.: A source matching approach to finding minimax codes. IEEE Trans. Inform. Theory 26, 166–174 (1980)
Ryabko, B.Y.: Comments on A source matching approach to finding minimax codes. IEEE Trans. Inform. Theory 27, 780–781 (1981)
Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55, 119–139 (1997)
Kivinen, J., Warmuth, M.K.: Boosting as entropy projection. In: COLT 1999: Proceedings of the twelfth annual conference on Computational learning theory, pp. 134–144. ACM Press, New York (1999)
Pelletier, B.: Informative barycentres in statistics. Annals of Institute of Statistical Mathematics (to appear)
Shilane, P., Min, P., Kazhdan, M., Funkhouser, T.: The princeton shape benchmark. Shape Modeling International (2004)
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
Spellman, E., Vemuri, B.C. (2005). Efficient Shape Indexing Using an Information Theoretic Representation. 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. https://doi.org/10.1007/11526346_18
Download citation
DOI: https://doi.org/10.1007/11526346_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27858-0
Online ISBN: 978-3-540-31678-7
eBook Packages: Computer ScienceComputer Science (R0)