Publication
Smooth simultaneous structural graph matching and point-set registration
Conference Article
Conference
IAPR Workshop on Graph-based Representations in Pattern Recognition (GbRPR)
Edition
8th
Pages
142-151
Doc link
http://dx.doi.org/10.1007/978-3-642-20844-7_15
File
Abstract
We present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved using the EM algorithm. The solution is then approximated as a succession of assignment problems which are solved, in a smooth way, using Softassign. Our method allows us to detect outliers in both graphs involved in the matching. Unlike the outlier rejectors such as RANSAC and Graph Transformation Matching, our method is able to refine an initial the tentative correspondence-set in a more flexible way than simply removing spurious correspondences. In the experiments, our method shows a good ratio between effectiveness and computational time compared with other methods inside and outside the graphs’ field.
Categories
computer vision, image matching, pattern matching, pattern recognition.
Author keywords
correspondence problem, expectation maximization, Softassign, affine registration, graph matching
Scientific reference
G. Sanroma, R. Alquézar Mancho and F. Serratosa i Casanelles. Smooth simultaneous structural graph matching and point-set registration, 8th IAPR Workshop on Graph-based Representations in Pattern Recognition, 2011, Münster, Germany, in Graph-based Representations in Pattern Recognition, Vol 6658 of Lecture Notes in Computer Science, pp. 142-151, 2011, Springer.
Follow us!