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

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

Title

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

AuthorsSanroma, Gerard; Alquézar Mancho, Renato ; Serratosa, Francesc
KeywordsCorrespondence problem
Graph matching
Affine registration
Outlier detection
Expectation maximization
Softassign
Issue Date2012
PublisherElsevier
CitationComputer Vision and Image Understanding 116(2): 292-304 (2012)
AbstractFinding 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.
Publisher version (URL)http://dx.doi.org/10.1016/j.cviu.2011.10.009
URIhttp://hdl.handle.net/10261/96282
DOIhttp://dx.doi.org/10.1016/j.cviu.2011.10.009
ISSN1077-3142
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
A New Graph Matching.pdf3,37 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


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