Show simple item record

dc.contributor.authorFerrer Sumsi, Miquel
dc.contributor.authorKaratzas, D
dc.contributor.authorValveny, Ernest
dc.contributor.authorBardaji Goikoetxea, Itziar
dc.contributor.authorBunke, Horst
dc.contributor.otherInstitut de Robòtica i Informàtica Industrial
dc.date.accessioned2012-05-07T17:30:35Z
dc.date.available2012-05-07T17:30:35Z
dc.date.created2011
dc.date.issued2011
dc.identifier.citationFerrer, M. [et al.]. A generic framework for median graph computation based on a recursive embedding approach. "Computer vision and image understanding", 2011, vol. 115, núm. 7, p. 919-928.
dc.identifier.issn1077-3142
dc.identifier.urihttp://hdl.handle.net/2117/15790
dc.description.abstractThe 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.
dc.format.extent10 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Processament del senyal::Reconeixement de formes
dc.subject.lcshPattern recognition systems
dc.subject.otherpattern recognition PARAULES AUTOR: median graph
dc.subject.othergraph embedding
dc.subject.othergraph matching
dc.subject.otherstructural pattern recognition
dc.titleA generic framework for median graph computation based on a recursive embedding approach
dc.typeArticle
dc.subject.lemacReconeixement de formes (Informàtica) / Imatges -- Processament
dc.contributor.groupUniversitat Politècnica de Catalunya. VIS - Visió Artificial i Sistemes Intel·ligents
dc.identifier.doi10.1016/j.cviu.2010.12.010
dc.subject.inspecClassificació INSPEC::Pattern recognition
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.cviu.2010.12.010
dc.rights.accessOpen Access
local.identifier.drac10287713
dc.description.versionPreprint
local.citation.authorFerrer, M.; Karatzas, D.; Valveny, E.; Bardaji, I.; Bunke, H.
local.citation.publicationNameComputer vision and image understanding
local.citation.volume115
local.citation.number7
local.citation.startingPage919
local.citation.endingPage928


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record