Smooth Simultaneous Structural Graph Matching and Point-Set Registration

• Published in: Graph-Based Representations in Pattern Recognition pp. 142 - 151
• Main Authors: Sanromà, Gerard, Alquézar, René, Serratosa, Francesc
• Format: Book Chapter Publication
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Affine registration; Computer vision; Correspondence problem; Enginyeria de la telecomunicació; Expectation maximization; Graph matching; Image matching; Pattern matching; Pattern recognition systems; Processament del senyal; Reconeixement de formes; Reconeixement de formes (Informàtica); Softassign; Visió per ordinador; Àrees temàtiques de la UPC
• ISBN: 3642208436; 9783642208430; 9783642208447; 3642208444
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-20844-7_15

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.