English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/96282
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
Citado 33 veces en Web of Knowledge®  |  Ver citas en Google académico
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar otros formatos: Exportar EndNote (RIS)Exportar EndNote (RIS)Exportar EndNote (RIS)
Título

A new graph matching method for point-set correspondence using the EM algorithm and Softassign

Autor Sanroma, Gerard; Alquézar Mancho, Renato ; Serratosa, Francesc
Palabras clave Correspondence problem
Graph matching
Affine registration
Outlier detection
Expectation maximization
Softassign
Fecha de publicación 2012
EditorElsevier
Citación Computer Vision and Image Understanding 116(2): 292-304 (2012)
ResumenFinding correspondences between two point-sets is a common step in many vision applications (e.g., image matching or shape retrieval). We present a graph matching method to solve the point-set correspondence problem, which is posed as one of mixture modelling. Our mixture model encompasses a model of structural coherence and a model of affine-invariant geometrical errors. Instead of absolute positions, the geometrical positions are represented as relative positions of the points with respect to each other. We derive the Expectation-Maximization algorithm for our mixture model. In this way, the graph matching problem is approximated, in a principled way, as a succession of assignment problems which are solved using Softassign. Unlike other approaches, we use a true continuous underlying correspondence variable. We develop effective mechanisms to detect outliers. This is a useful technique for improving results in the presence of clutter. We evaluate the ability of our method to locate proper matches as well as to recognize object categories in a series of registration and recognition experiments. Our method compares favourably to other graph matching methods as well as to point-set registration methods and outlier rejectors.
Versión del editorhttp://dx.doi.org/10.1016/j.cviu.2011.10.009
URI http://hdl.handle.net/10261/96282
DOI10.1016/j.cviu.2011.10.009
ISSN1077-3142
Aparece en las colecciones: (IRII) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
A New Graph Matching.pdf3,37 MBAdobe PDFVista previa
Visualizar/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.