Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/96704
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 | Ferrer, Miquel | - |
dc.contributor.author | Karatzas, D. | - |
dc.contributor.author | Valveny, Ernest | - |
dc.contributor.author | Bardaji, I. | - |
dc.contributor.author | Bunke, Horst | - |
dc.date.accessioned | 2014-05-14T11:42:20Z | - |
dc.date.available | 2014-05-14T11:42:20Z | - |
dc.date.issued | 2011 | - |
dc.identifier | doi: 10.1016/j.cviu.2010.12.010 | - |
dc.identifier | issn: 1077-3142 | - |
dc.identifier.citation | Computer Vision and Image Understanding 115(7): 919-928 (2011) | - |
dc.identifier.uri | http://hdl.handle.net/10261/96704 | - |
dc.description.abstract | The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of this paper is the generalization of this previous method, proposing a generic recursive procedure that permits to recover the graph corresponding to a point in the vector space, introducing only the amount of approximation inherent to the use of graph matching algorithms. In order to evaluate the proposed method, we compare it with the set median and with the other state-of-the-art embedding-based methods for the median graph computation. The experiments are carried out using four different databases (one semi-artificial and three containing real-world data). Results show that with the proposed approach we can obtain better medians, in terms of the sum of distances to the training graphs, than with the previous existing methods. © 2011 Elsevier Inc. All rights reserved. | - |
dc.description.sponsorship | This work has been supported by the Spanish research programmes Consolider Ingenio 2010 CSD2007-00018, TIN2006-15694-C02-02 and TIN2008-04998 and the fellowship RYC-2009-05031. | - |
dc.publisher | Elsevier | - |
dc.relation.isversionof | Preprint | - |
dc.rights | openAccess | - |
dc.subject | Structural pattern recognition | - |
dc.subject | Graph embedding | - |
dc.subject | Graph matching | - |
dc.subject | Median graph | - |
dc.title | A generic framework for median graph computation based on a recursive embedding approach | - |
dc.type | artículo | - |
dc.identifier.doi | 10.1016/j.cviu.2010.12.010 | - |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.cviu.2010.12.010 | - |
dc.date.updated | 2014-05-14T11:42:20Z | - |
dc.description.version | Peer Reviewed | - |
dc.language.rfc3066 | eng | - |
dc.relation.csic | Sí | - |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
item.openairetype | artículo | - |
Aparece en las colecciones: | (IRII) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
A Generic Framework.pdf | 616 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
24
checked on 17-mar-2024
WEB OF SCIENCETM
Citations
18
checked on 27-feb-2024
Page view(s)
334
checked on 23-abr-2024
Download(s)
243
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.