Reweighted random walks for graph matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6315 LNCS, Issue PART 5, 2010, Pages 492-505

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

^a Seoul National University   (South Korea)

Author keywords

feature correspondence; graph matching; random walks

Indexed keywords

COMPUTER VISION; DEFORMATION; ITERATIVE METHODS; RANDOM PROCESSES; STATISTICS;

COMPARATIVE EXPERIMENTS; ESSENTIAL PROBLEMS; FEATURE CORRESPONDENCE; GRAPH MATCHINGS; GRAPH-MATCHING ALGORITHMS; MATCHING CONSTRAINTS; MATCHING PROBLEMS; RANDOM WALK;

PATTERN MATCHING;

EID: 78149349206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15555-0_36     Document Type: Conference Paper

References (24)

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. In: IJPRAI (2004)
2. Berg, A.C., Berg, T.L., Malik, J.: Shape matching and object recognition using low distortion correspondences. In: CVPR (2005)
3. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)
4. Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)
5. Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: Models and global optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol. 5303, pp. 596-609. Springer, Heidelberg (2008)
6. Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)
7. Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: CVPR (2009)
8. Leordeanu, M., Herbert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)
9. Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM (1999)
10. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report, Stanford University (1998)
11. Haveliwala, T.H.: Topic-sensitive pagerank. In: WWW (2002)
12. Maciel, J., Costeira, J.P.: A global solution to sparse correspondence problems. PAMI (2003)
13. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI (1996)
14. van Wyk, B.J., van Wyk, M.A.: A pocs-based graph matching algorithm. PAMI (2004)
15. Lee, J., Cho, M., Lee, K.M.: Graph matching algorithm using data-driven markov chain monte carlo sampling. In: ICPR (2010)
16. Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. PAMI (2005)
17. Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. In: IJPRAI (2004)
18. Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statistics (1964)
19. Langville, A.N., Meyer, C.D.: Deeper inside pagerank. InternetMathematics (2003)
20. Seneta, E.: Non negative matrices and markov chains. Springer, Heidelberg (2006)
21. Munkres, J.: Algorithms for the assignment and transportation problems. SIAM, Philadelphia (1957)
22. Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide baseline stereo from maximally stable extremal regions. In: BMVC (2002)
23. Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV, pp. 1150-1157 (1999)
24. Cho, M., Lee, J., Lee, K.M.: Feature correspondence and deformable object matching via agglomerative correspondence clustering. In: ICCV (2009)