Progressive graph matching: Making a move of graphs via probabilistic voting

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

Volumn , Issue , 2012, Pages 398-405

  Cho, Minsu ^a   Lee, Kyoung Mu ^a  

^a South Korea   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL FACTORS; CURRENT MATCHING; EXPERIMENTAL EVALUATION; GRAPH MATCHINGS; INPUT GRAPHS; MATCHING PERFORMANCE; MATCHING PROBLEMS; REAL-WORLD APPLICATION; SCIENTIFIC FIELDS;

COMPUTER VISION; IMAGE MATCHING; PATTERN MATCHING;

GRAPHIC METHODS;

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

References (24)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. ACM, 1994. 5
2. J. C. Avinash Sharma, Radu Horaud and E. Boyer. Topologically-robust 3d shape matching based on diffusion geometry and seed growing. CVPR, 2011. 1
3. O. Barinova, V. Lempitsky, and P. Kohli. On detection of multiple object instances using hough transforms. CVPR, 2010. 3
4. A. C. Berg, T. L. Berg, and J. Malik. Shape matching and object recognition using low distortion correspondences. CVPR, 2005. 1, 2, 3, 4
5. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. TPAMI, 2001. 2
6. M. Cho, J. Lee, and K. M. Lee. Feature correspondence and deformable object matching via agglomerative correspondence clustering. ICCV, 2009. 4
7. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. ECCV, 2010. 1, 2, 3, 4, 5, 6, 7
8. M. Cho, Y. M. Shin, and K. M. Lee. Unsupervised detection and segmentation of identical objects. CVPR, 2010. 2, 6
9. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. NIPS, 2007. 1, 2, 3, 5, 7
10. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensor-based algorithm for high-order graph matching. CVPR, 2009. 1, 2, 3
11. O. Duchenne, A. Joulin, and J. Ponce. A graph-matching kernel for object categorization. ICCV, 2011. 1
12. V. Ferrari, T. Tuytelaars, and L. Gool. Simultaneous object recognition and segmentation from single or multiple model views. IJCV, 2006. 2, 4, 6
13. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. TPAMI, 1996. 3, 5
14. J. Kannala, E. Rahtu, S. Brandt, and J. Heikkila. Object recognition and segmentation by non-rigid quasi-dense matching. CVPR, 2008. 2, 6
15. J. Lee, M. Cho, and K. M. Lee. Hyper-graph matching via reweighted random walks. CVPR, 2011. 2, 3
16. V. Lempitsky, C. Rother, S. Roth, and A. Blake. Fusion moves for markov random field optimization. TPAMI, 2009. 2
17. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. ICCV, 2005. 1, 2, 3, 4, 5, 7
18. M. Leordeanu, M. Hebert, and R. Sukthankar. Beyond local appearance: Category recognition from pairwise interactions of simple features. CVPR, 2007. 1, 2, 3
19. M. Leordeanu and M. Herbert. An integer projected fixed point method for graph matching and map inference. NIPS, 2009. 2, 5, 7
20. D. G. Lowe. Object recognition from local scale-invariant features. ICCV, 1999. 4, 5
21. J. Matas, O. Chum, M. Urban, and T. Pajdla. Robust wide baseline stereo from maximally stable extremal regions. BMVC, 2002. 4, 6
22. K. Mikolajczyk and C. Schmid. Scale and affine invariant interest point detectors. IJCV, 2004. 4, 6
23. L. Torresani, V. Kolmogorov, and C. Rother. Feature correspondence via graph matching: Models and global optimization. ECCV, 2008. 1, 2, 3, 4
24. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. CVPR, 2008. 1, 2, 3, 5, 7