Reweighted Random Walks for Graph MatchingAuthors Minsu Cho Jungmin Lee Kyoung Mu Lee Abstract Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching algorithm against outliers and deformation. Matching between two graphs is formulated as node selection on an association graph whose nodes represent candidate correspon
