Improving graph matching via density maximization

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2013, Pages 3424-3431

  Wang, Chao ^a   Wang, Lei ^a   Liu, Lingqiao ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; STATISTICS;

EXPERIMENTAL EVALUATION; GRAPH DENSITY; GRAPH MATCHINGS; GRAPH-MATCHING ALGORITHMS; MANY-TO-MANY; OBJECTIVE FUNCTIONS; QUALITY OF MATCHES; SPARSE FEATURES;

IMAGE MATCHING;

EID: 84898817782     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2013.425     Document Type: Conference Paper

References (25)

1. M. Cho, J. Lee, and K. M. Lee. Feature correspondence and deformable object matching via agglomerative correspondence clustering. ICCV, 2009.
2. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. ECCV, 2010.
3. M. Cho and K. M. Lee. Authority-shift clustering: Hierarchical clustering by authority seeking on graphs. CVPR, 2010.
4. M. Cho and K. M. Lee. Mode-seeking on graphs via randomwalks. CVPR, 2012.
5. M. Cho and K. M. Lee. Progressive graph matching: Making a move of graphs via probabilistic voting. CVPR, 2012.
6. M. Cho, Y. M. Shin, and K. M. Lee. Co-recognition of image pairs by data-driven monte carlo image exploration. ECCV, 2008.
7. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, pages 265-298, 2004.
8. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. NIPS, 2007.
9. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensorbased algorithm for high-order graph matching. CVPR, 2009.
10. V. Ferrari, T. Tuytelaars, and L. V. Gool. Simultaneous object recognition and segmentation from single or multiple model views. IJCV, 67(2):159-188, 2006.
11. M. Gori, M. Maggini, and L. Sarti. Exact and approximate graph matching using random walks. TPAMI, 27(7):1100-1111, 2005.
12. S. Jouili, S. Tabbone, and V. Lacroix. Median graph shift: A new clustering algorithm for graph domain. ICPR, 2010.
13. J. Lee, M. Cho, and K. M. Lee. Hyper-graph matching via reweighted random walks. CVPR, 2011.
14. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. ICCV, 2005.
15. M. Leordeanu and M. Herbert. An integer projected fixed point method for graph matching and map inference. NIPS, 2009.
16. W. Lin, S. Liu, Y. Matsushita, and T. Ng. Smoothly varying affine stitching. CVPR, 2011.
17. H. Liu, L. J. Latecki, and S. Yan. Fast detection of dense subgraph with iterative shrinking and expansion. TPAMI, 2013.
18. D. G. Lowe. Object recognition from local scale-invariant features. ICCV, 1999.
19. J. Maciel and J. Costeira. A global solution to sparse correspondence problems. TPAMI, 25(2):187-199, 2003.
20. J. Matas, O. Chum, M. Urban, and T. Pajdla. Robust wide baseline stereo from maximally stable extremal regions. BMVC, 2002.
21. K. Mikolajczyk and C. Schmid. Scale and affine invariant interest point detectors. IJCV, 2004.
22. Y. A. Sheikh, E. A. Khan, and T. Kanade. Mode-seeking by medoid shifts. ICCV, 2007.
23. L. Torresani, V. Kolmogorov, and C. Rother. Feature correspondence via graph matching: Models and global optimization. ECCV, 2008.
24. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. CVPR, 2008.
25. W. Zhang, X. Wang, D. Zhao, and X. Tang. Graph degree linkage: agglomerative clustering on a directed graph. ECCV, 2012.