Hyper-graph Matching via Reweighted Random Walks

13 years 2 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as graph matching in which nodes represent feature points while edges describe pairwise relations between feature points. Recently, several researches have tried to embed higher-order relations of feature points by hyper-graph matching formulations. In this paper, we generalize the previous hyper-graph matching formulations to cover relations of features in arbitrary orders, and propose a novel state-ofthe-art algorithm by reinterpreting the random walk concept on the hyper-graph in a probabilistic manner. Adopting personalized jumps with a reweighting scheme, the algorithm effectively reflects the one-to-one matching constraints during the random walk process. Comparative experiments on synthetic data and real images show that the proposed method clearly outperforms existing algorithms especially in the presenc...
Jungmin Lee (Seoul National University), Minsu Cho
Added 10 Apr 2011
Updated 29 Apr 2011
Type Conference
Year 2011
Where CVPR
Authors Jungmin Lee (Seoul National University), Minsu Cho (Seoul National University), Kyoung Mu Lee (Seoul National University)
Comments (0)