Hyper-graph matching via reweighted random walks

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

Volumn , Issue , 2011, Pages 1633-1640

  Lee, Jungmin ^a   Cho, Minsu ^a   Lee, Kyoung Mu ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; LEARNING SYSTEMS; RANDOM PROCESSES;

ARBITRARY ORDER; COMPARATIVE EXPERIMENTS; HIGHER-ORDER; MATCHING CONSTRAINTS; RANDOM WALK PROCESS; RE-WEIGHTING; STATE-OF-THE-ART ALGORITHMS; SYNTHETIC DATA;

PATTERN MATCHING;

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

References (21)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. ACM, 1994. 1637
2. M. Chertok and Y. Keller. Efficient high order matching. PAMI, 2010. 1633, 1634
3. M. Cho, J. Lee, and K. M. Lee. Feature correspondence and deformable object matching via agglomerative correspondence clustering. 2009. 1633
4. M. Cho, J. Lee, and K. M. Lee. Reweighted random walks for graph matching. ECCV, 2010. 1633, 1634, 1635, 1636, 1637, 1638, 1639
5. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. NIPS, 2007. 1633, 1634
6. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. Tensor-based algorithm for high-order graph matching. CVPR, 2009. 1633, 1634, 1637, 1639
7. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. PAMI, 1996. 1633, 1634
8. L. Grady. Random walks for image segmentation. PAMI, 2006.
9. T. Haveliwala. Topic-sensitive pagerank. WWW, 2002. 1636
10. J. Lee, M. Cho, and K. M. Lee. A graph matching algorithm using data-driven markov chain monte carlo sampling. ICPR, 2010. 1633, 1634
11. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. ICCV, 2005. 1633, 1634
12. M. Leordeanu, M. Hebert, and R. Sukthankar. An integer projected fixed point method for graph matching and map inference. NIPS, 2009. 1633, 1634
13. D. Lowe. Object recognition from local scale-invariant features. 1999. 1633, 1638
14. J. Matas, O. Chum, M. Urban, and T. Pajdla. Robust wide baseline stereo from maximally stable extremal regions. 2002. 1633, 1638
15. J. Munkres. Algorithms for the assignment and transportation problems. SIAM, 1957. 1637
16. P. A. Regalia and E. Kofidis. The higher-order power method revisitiedl: Convergence proofs and effenctive initialization. ICASSP, 2000. 1635
17. E. Seneta. Non-negative Matrices and Markov Chains. Springer, 1981. 1635
18. R. Sinkhorn. A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices. Annals of Mathematical Statistics, 1964. 1637
19. B. J. van Wyk and M. A. van Wyk. A pocs-based graph matching algorithm. PAMI, 2004. 1633, 1634
20. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. CVPR, 2008. 1633, 1634, 1637, 1639
21. D. Zhou, J. Huang, and B. Schlkopf. Learning with hypergraphs: Clustering, classification, and embedding. In NIPS, 2006. 1635