Show simple item record

dc.contributor.authorBardaji Goikoetxea, Itziar
dc.contributor.authorFerrer Sumsi, Miquel
dc.contributor.authorSanfeliu Cortés, Alberto
dc.contributor.otherInstitut de Robòtica i Informàtica Industrial
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
dc.date.accessioned2010-12-16T19:15:07Z
dc.date.available2010-12-16T19:15:07Z
dc.date.issued2010
dc.identifier.citationBardaji Goikoetxea, I.; Ferrer Sumsi, M.; Sanfeliu Cortés, A. A comparison between two representatives of a set of graphs: median vs barycenter graph. A: IAPR International Workshops on Structural and Syntactic Pattern Recognition. "Structural, syntactic and statistical pattern recognition. Lecture Notes in Computer Science; vol. 6218". Springer Verlag, 2010, p. 149-158. DOI 10.1007/978-3-642-14980-1_14.
dc.identifier.urihttp://hdl.handle.net/2117/10662
dc.description.abstractIn this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels in nodes and edges and on the other hand, that they can handle relatively large amount of data. Namely, the approximated algorithms to compute the Median Graph via graph embedding and a new method to compute the Barycenter Graph. Our contribution is to give a new algorithm for the barycenter computation and to compare it to the median Graph. To compare these two representatives, we take into account algorithmic considerations and experimental results on the quality of the representative and its robustness, on several datasets.
dc.format.extent10 p.
dc.language.isoeng
dc.publisherSpringer Verlag
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.otherbarycenter graph
dc.subject.othergraph matching
dc.titleA comparison between two representatives of a set of graphs: median vs barycenter graph
dc.typeConference report
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.1007/978-3-642-14980-1_14
dc.subject.inspecClassificació INSPEC::Pattern recognition
dc.relation.publisherversionhttp://dx.doi.org/10.1007/978-3-642-14980-1_14
dc.rights.accessOpen Access
local.identifier.drac4400953
dc.description.versionPreprint
local.citation.contributorIAPR International Workshops on Structural and Syntactic Pattern Recognition
local.citation.publicationNameStructural, syntactic and statistical pattern recognition. Lecture Notes in Computer Science; vol. 6218
local.citation.startingPage149
local.citation.endingPage158


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record