Smooth simultaneous structural graph matching and point-set registration

Authors:
Gerard Sanromà;René Alquézar;Francesc Serratosa
Affiliations:
Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain;Institut de Robtica i Informtica Industrial, CSIC-UPC, Barcelona, Spain;Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain
Venue:
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Year:
2011

Citing 13
Cited 0

The invisible hand algorithm: solving the assignment problem with statistical physics

Neural Networks
On the unification of line processes, outlier rejection, and robust statistics with applications in early vision

International Journal of Computer Vision
A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Matching With a Dual-Step EM Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural matching with active triangulations

Computer Vision and Image Understanding
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision
A unified framework for alignment and correspondence

Computer Vision and Image Understanding
A Performance Evaluation of Local Descriptors

IEEE Transactions on Pattern Analysis and Machine Intelligence
A novel optimizing network architecture with applications

Neural Computation
A robust Graph Transformation Matching for non-rigid registration

Image and Vision Computing

Quantified Score

Hi-index	0.00

Visualization

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.