Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/96282
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Sanroma, Gerard | - |
dc.contributor.author | Alquézar Mancho, Renato | - |
dc.contributor.author | Serratosa, Francesc | - |
dc.date.accessioned | 2014-05-07T08:43:43Z | - |
dc.date.available | 2014-05-07T08:43:43Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Computer Vision and Image Understanding 116(2): 292-304 (2012) | es_ES |
dc.identifier.issn | 1077-3142 | - |
dc.identifier.uri | http://hdl.handle.net/10261/96282 | - |
dc.description.abstract | Finding 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. | es_ES |
dc.description.sponsorship | This research is supported by Consolider Ingenio 2010 (CSD2007-00018), by the CICYT (DPI 2010-17112) and by project DPI-2010-18449. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.isversionof | Preprint | - |
dc.rights | openAccess | es_ES |
dc.subject | Correspondence problem | es_ES |
dc.subject | Graph matching | es_ES |
dc.subject | Affine registration | es_ES |
dc.subject | Outlier detection | es_ES |
dc.subject | Expectation maximization | es_ES |
dc.subject | Softassign | es_ES |
dc.title | A new graph matching method for point-set correspondence using the EM algorithm and Softassign | es_ES |
dc.type | artículo | es_ES |
dc.identifier.doi | 10.1016/j.cviu.2011.10.009 | - |
dc.description.peerreviewed | Peer reviewed | es_ES |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.cviu.2011.10.009 | es_ES |
dc.relation.csic | Sí | - |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.openairetype | artículo | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
Aparece en las colecciones: | (IRII) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
A New Graph Matching.pdf | 3,37 MB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
51
checked on 20-abr-2024
WEB OF SCIENCETM
Citations
41
checked on 28-feb-2024
Page view(s)
357
checked on 23-abr-2024
Download(s)
369
checked on 23-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.