Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.676 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Instituts de recerca
  • IRI - Institut de Robòtica i Informàtica Industrial, CSIC-UPC
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Instituts de recerca
  • IRI - Institut de Robòtica i Informàtica Industrial, CSIC-UPC
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A generic framework for median graph computation based on a recursive embedding approach

Thumbnail
View/Open
1319-A-generic-framework-for-median-graph-computation-based-on-a-recursive-embedding-approach.pdf (551,1Kb)
 
10.1016/j.cviu.2010.12.010
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/15790

Show full item record
Ferrer Sumsi, MiquelMés informació
Karatzas, D
Valveny, Ernest
Bardaji Goikoetxea, Itziar
Bunke, Horst
Document typeArticle
Defense date2011
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
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. 
URIhttp://hdl.handle.net/2117/15790
DOI10.1016/j.cviu.2010.12.010
ISSN1077-3142
Publisher versionhttp://dx.doi.org/10.1016/j.cviu.2010.12.010
Collections
  • IRI - Institut de Robòtica i Informàtica Industrial, CSIC-UPC - Articles de revista [290]
  • VIS - Visió Artificial i Sistemes Intel·ligents - Articles de revista [134]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
1319-A-generic- ... ive-embedding-approach.pdf551,1KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina