Efficient shape indexing using an information theoretic representation

Lecture Notes in Computer Science

Volumn 3568, Issue , 2005, Pages 145-153

  Spellma, Eric ^a   Vemuri, Baba C ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; INDEXING (OF INFORMATION); OPTIMIZATION;

INDEXING STRUCTURE; KULLBACK-LIEBLER (KL) DIVERGENCE; PRICETONE SHAPE DATABASE; TRIANGLE INEQUALITY;

IMAGE RETRIEVAL;

EID: 26444559041     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Osada, R., Funkhouser, T., Chazelle, B., Dobkin, D.: Shape distributions. ACM Trans. Graph. 21 (2002) 807-832
2. Rubner, Y., Tomasi, C., Guibas, L.: A metric for distributions with applications to image databases. In: Proc. ICCV. (1998) 59-66
3. Levina, E., Bickel, P.: The earth mover's distance is the Mallows distance: some insights from statistics. In: Proc. ICCV. (2001) 251-256
4. Puzicha, J., Buhmann, J.M., Rubner, Y., Tomasi, C.: Empirical evaluation of dissimilarity measures for color and texture. In: Proc. ICCV. (1999) 1165
5. Do, M.N., Vetterli, M.: Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance. IEEE Trans. Image Process. 11 (2002) 146-158
6. Varma, M., Zisserman, A.: Texture classification: Are filter banks necessary? In: Proc. CVPR. (2003) 691-698
7. Gordon, S., Goldberger, J., Greenspan, H.: Applying the information bottleneck principle to unsupervised clustering of discrete and continuous image representations. In: Proc. ICCV. (2003) 370-396
8. Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: image segmentation using expectation-maximization and its application to image querying. IEEE PAMI 24 (2002) 1026-1038
9. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley & Sons, New York (1991)
10. Omohundro, S.M.: Bumptrees for efficient function, constraint, and classification learning. In: Proc. NIPS. (1990) 693-699
11. Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. ACM-SIAM Symp. on Discrete Algorithms. (1993) 311-321
12. Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40 (1991) 175-179
13. Rao, M., Spellman, E., Vemuri, B.C., Amari, S.I.: Information theoretic centers of distributions and their properties. IEEE Trans. Inform. Theory (2005) submitted
14. Csiszár, I., Korner, J.G.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, Inc., New York (1981)
15. Davisson, L.D., Leon-Garcia, A.: A source matching approach to finding minimax codes. IEEE Trans. Inform. Theory 26 (1980) 166-174
16. Ryabko, B.Y.: Comments on 'A source matching approach to finding minimax codes'. IEEE Trans. Inform. Theory 27 (1981) 780-781
17. Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55 (1997) 119-139
18. Kivinen, J., Warmuth, M.K.: Boosting as entropy projection. In: COLT '99: Proceedings of the twelfth annual conference on Computational learning theory, New York, NY, USA, ACM Press (1999) 134-144
19. Pelletier, B.: Informative barycentres in statistics. Annals of Institute of Statistical Mathematics (to appear)
20. Shilane, P., Min, P., Kazhdan, M., Funkhouser, T.: The princeton shape benchmark. In: Shape Modeling International. (2004)