Total Bregman divergence and its applications to shape retrieval

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 3463-3468

  Liu, Meizhu ^a   Vemuri, Baba C ^a   Amari, Shun Ichi ^b   Nielsen, Frank ^c  

^a UNIVERSITY OF FLORIDA   (United States)

^b RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

^c SONY COMPUTER SCIENCE LABORATORY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BEST MATCH; BIOMETRIC SYSTEMS; BREGMAN DIVERGENCES; CAD SYSTEM; CLUSTER CENTERS; CONVEX FUNCTIONS; DIVERGENCE MEASURES; EXPLOSIVE GROWTH; MPEG-7 DATABASE; NEW THEORY; SHAPE DATA; SHAPE DATABASE; SHAPE RETRIEVAL; STATE-OF-THE-ART METHODS; WEIGHTED MEAN;

BIOMETRICS; COMPUTER VISION; DATABASE SYSTEMS; MOTION PICTURE EXPERTS GROUP STANDARDS; ORTHOGONAL FUNCTIONS; SEARCH ENGINES;

DISTRIBUTION FUNCTIONS;

EID: 77955988833     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539979     Document Type: Conference Paper

References (22)

1. S. Amari. Differential-Geometrical Methods in Statistics. Springer Berlin Heidelberg, 1985. 1
2. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh. Clustering with Bregman divergences. J. Mach. Learn. Res., 6:1705-1749, 2005. 1, 2
3. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell., 24:509-522, 2002. 6
4. L. M. Bregman. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. and Math. Phys., 7:200-217, 1967. 1
5. H. Chui and A. Rangarajan. A feature registration framework using mixture models. IEEE Workshop on Math. Methods in Biomedical Image Anal., pages 190-197, 2000. 3
6. P. Felzenszwalb and J. Schwartz. Hierarchical matching of deformable shapes. IEEE CVPR, pages 1-8, 2007. 6
7. B. A. Frigyik, S. Srivastava, and M. R. Gupta. Functional Bregman divergence. Int. Symp. Inf. Theory, 54, 2008. 1
8. J. Ho, M. Yang, A. Rangarajan, and B. Vemuri. A new affine registration algorithm for matching 2D point sets. IEEE Workshop on Appl. of Comput. Vis., 89:25-30, 2007. 3
9. B. Jian and B. C. Vemuri. A robust algorithm for point set registration using mixture of gaussians. IEEE ICCV, 2:1246-1251, 2005. 3
10. L. J.Latecki, R. Lakamper, and U. Eckhardt. Shape descriptors for non-rigid shapes with a single closed contour. IEEE CVPR, 1:424-429, 2000. 5, 6
11. S. Kullback. Information Theory and Statistics. Wiley New York, 1959. 1
12. J. Lancaster and et al. k-Tree method for high-speed spatial normalization. Human Brain Mapping, 6:358-363, 1998. 4
13. H. Ling and D. Jacobs. Using the inner-distance for classification of articulated shapes. IEEE CVPR, 2, 2005. 6
14. H. Ling and K. Okada. An efficient earth movers distance algorithm for robust histogram comparison. IEEE Trans. Pattern Anal. Mach. Intell., 29:840-853, 2007. 6
15. G. McNeill and S. Vijayakumar. Hierarchical procrustes matching for shape retrieval. IEEE CVPR, 1, 2006. 6
16. F. Mokhtarian, S. Abbasi, and J. Kittler. Efficient and robust retrieval by shape content through curvature scale space. Int. Workshop on Image Databases and Multi-Media Search, pages 51-58, 1997. 6
17. F. Nielsen and R. Nock. On the smallest enclosing information disk. Inf. Process. Lett., 105:93-97, 2008. 1
18. A. Peter, A. Rangarajan, and J. Ho. Shape L'Ane rouge: Sliding wavelets for indexing and retrieval. IEEE CVPR, 2008. 1, 6
19. T. Sebastian, P. Klein, and B. Kimia. On aligning curves. IEEE PAMI, pages 116-125, 2003. 6
20. A. Srivastava, I. Jermyn, and S. Joshi. Riemannian analysis of probability density functions with applications in vision. IEEE CVPR, pages 1-8, 2007. 1
21. Z. Tu and A. Yuille. Shape matching and recognition: Using generative models and informative features. ECCV, 3:195-209, 2004. 6
22. J. Zhang. Divergence function, duality, and convex analysis. Neural Computation, 16:159-195, 2004. 1