Using the KL-center for efficient and accurate retrieval of distributions arising from texture images

Proceedings - 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

Volumn I, Issue , 2005, Pages 111-116

  Spellman, Eric ^a   Vemuri, Baba C ^a   Rao, Murali ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; DATA STRUCTURES; IMAGE RETRIEVAL; INFORMATION THEORY; PROBABILITY DISTRIBUTIONS; TEXTURES;

IDENTICAL ACCURACY; KL-CENTER; KULLBACK-LIEBLER (KL) DIVERGENCE; TEXTURE IMAGES;

IMAGE PROCESSING;

EID: 24644503190     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2005.363     Document Type: Conference Paper

References (24)

1. R. Osada, T. Funkhouser, B. Chazelle, and D. Dobkin, "Shape distributions," ACM Trans. Graph., vol. 21, no. 4, pp. 807-832, 2002.
2. S. Gordon, J. Goldberger, and H. Greenspan, "Applying the information bottleneck principle to unsupervised clustering of discrete and continuous image representations," in Proc. ICCV, 2003, pp. 370-396.
3. C. Carson, S. Belongie, H. Greenspan, and J. Malik, "Blobworld: image segmentation using expectation-maximization and its application to image querying," IEEE PAMI, vol. 24, no. 8, pp. 1026-1038, 2002.
4. Y. Rubner, C. Tomasi, and L. Guibas, "A metric for distributions with applications to image databases," in Proc. ICCV. 1998, pp. 59-66.
5. J. Puzicha, J. M. Buhmann, Y. Rubner, and C. Tomasi, "Empirical evaluation of dissimilarity measures for color and texture," in Proc. ICCV, 1999, p. 1165.
6. M. N. Do and M. Vetterli, "Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler dis tance," IEEE Trans. Image Process., vol. 11, no. 2, pp. 146-158, 2002.
7. M. Varma and A. Zisserman, "Texture classification: Are filter banks necessary?" in Proc. CVPR, 2003, pp. 691-698.
8. S. M. Omohundro, "Bumptrees for efficient function, constraint, and classification learning," in Proc. NIPS, 1990, pp. 693-699.
9. P. N. Yianilos, "Data structures and algorithms for nearest neighbor search in general metric spaces," in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 311-321.
10. J. K. Uhlmann, "Satisfying general proximity/similarity queries with metric trees," Information Processing Letters, vol. 40, pp. 175-179, 1991.
11. A. Moore, "The anchors hierarchy: Using the triangle inequality to survive high-dimensional data," in Proc.on Uncertainty in Artif. Intel., 2000, pp. 397-405.
12. E. Klassen, A. Srivastava, W. Mio, and S. H. Joshi, "Analysis of planar shapes using geodesic paths on shape spaces," IEEE PAMI, vol. 26, no. 3, pp. 372-383, 2004.
13. P. T. Fletcher, C. Lu, and S. Joshi, "Statistics of shape via principal geodesic analysis on lie groups," IEEE Trans. Med. Imag., vol. 23, no. 8, pp. 995-1005, 2004.
14. S. Amari, Methods of Information Geometry. Providence, RI: American Mathematical Society, 2000.
15. M. Rao, E. Spellman, B. C. Vemuri, and S.-I. Amari, "Information theoretic centers of distributions and their properties," IEEE Trans. Inform. Theory, submitted, 2005.
16. J. Lin, "Divergence measures based on the shannon entropy," IEEE Trans. Inform. Theory, vol. 37, no. 1, pp. 145-151, 1991.
17. L. D. Davisson and A. Leon-Garcia, "A source matching approach to finding minimax codes," IEEE Trans. Inform. Theory, vol. 26, no. 2, pp. 166-174, 1980.
18. B. Y. Ryabko, "Comments on 'A source matching approach to finding minimax codes'," IEEE Trans. Inform. Theory, vol. 27, no. 6, pp. 780-781, 1981.
19. M. Varma and A. Zisserman, "Classifying images of materials: Achieving viewpoint and illumination independence," in Proc. CVPR, 2002, pp. 255-271.
20. T. Leung and J. Malik, "Recognizing surfaces using three-dimensional textons," in Proc. ICCV, 1999, pp. 1010-1017.
21. K. J. Dana, B. van Ginneken, S. K. Nayar, and J. J. Koenderink, "Reflectance and texture of real-world surfaces," ACM Trans. Graph., vol. 18, no. 1, pp. 1-34, 1999.
22. F. Topsøe, "Some inequalities for information divergence and related measures of discrimination," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1602-1609, 2000.
23. D. M. Endres and J. E. Schindelin, "A new metric for probability distributions," IEEE Trans. Inform. Theory, vol. 49, no. 7, pp. 1858-1860, 2003.
24. A. O. Hero, B. Ma, O. Michel, and J. German, "Applications of entropic spanning graphs," IEEE Signal Processing Mag., vol. 19, no. 5, pp. 85-95, 2002.