English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/96874
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


Smooth simultaneous structural graph matching and point-set registration

AuthorsSanroma, Gerard; Alquézar Mancho, Renato ; Serratosa, Francesc
Issue Date2011
CitationGraph-Based Representations in Pattern Recognition: 142-151 (2011)
SeriesLecture Notes in Computer Science 6658
AbstractWe 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. © 2011 Springer-Verlag Berlin Heidelberg.
DescriptionTrabajo presentado al 8th IAPR-TC-15 International Workshop (GbRPR) celebrado en Münster(Alemania) del 18 al 20 de mayo de 2011.
Publisher version (URL)http://dx.doi.org/10.1007/978-3-642-20844-7_15
Identifiersdoi: 10.1007/978-3-642-20844-7_15
isbn: 978-3-642-20843-0
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
Smooth simultaneous.pdf3,18 MBUnknownView/Open
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.