English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/96874
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

Smooth simultaneous structural graph matching and point-set registration

AutorSanroma, Gerard; Alquézar Mancho, Renato ; Serratosa, Francesc
Fecha de publicación2011
EditorSpringer
CitaciónGraph-Based Representations in Pattern Recognition: 142-151 (2011)
SerieLecture Notes in Computer Science 6658
ResumenWe 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.
DescripciónTrabajo presentado al 8th IAPR-TC-15 International Workshop (GbRPR) celebrado en Münster(Alemania) del 18 al 20 de mayo de 2011.
Versión del editorhttp://dx.doi.org/10.1007/978-3-642-20844-7_15
URIhttp://hdl.handle.net/10261/96874
DOI10.1007/978-3-642-20844-7_15
Identificadoresdoi: 10.1007/978-3-642-20844-7_15
isbn: 978-3-642-20843-0
Aparece en las colecciones: (IRII) Libros y partes de libros
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
Smooth simultaneous.pdf3,18 MBUnknownVisualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.