Graph Matching via Sequential Monte Carlo
Year: 2012
Type: conference-paper
Abstract: . Graph matching is a powerful tool for computer vision and machine learning. In this paper, a novel approach to graph matching is developed based on the sequential Monte Carlo framework. By constructing a sequence of intermediate target distributions, the proposed algorithm sequentially performs a sampling and importance resampling to maximize the graph matching objective. Through the sequential sampling procedure, the algorithm effectively collects potential matches under one-to-one matching constraints to avoid the adverse effect of outliers and deformation. Experimental evaluations on synthetic graphs and real images demonstrate its higher robustness to deformation and outliers. Key words: graph matching, sequential Monte Carlo, feature correspondence, image matching, object recognition 1
Source: HAL
Authors: Yumin Suh, Minsu Cho, Kyoung Mu Lee
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4300940686
