Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Ferrer, M.; Karatzas, D.; Valveny, E.; Bardaji, I.; Bunke, H.
Tipus d'activitat
Article en revista
Revista
Computer vision and image understanding
Data de publicació
2011
Volum
115
Número
7
Pàgina inicial
919
Pàgina final
928
DOI
https://doi.org/10.1016/j.cviu.2010.12.010 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/15790 Obrir en finestra nova
URL
http://dx.doi.org/10.1016/j.cviu.2010.12.010 Obrir en finestra nova
Resum
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 p...
Citació
Ferrer, 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.
Paraules clau
graph embedding, graph matching, pattern recognition PARAULES AUTOR: median graph, structural pattern recognition
Grup de recerca
VIS - Visió Artificial i Sistemes Intel.ligents

Participants

  • Ferrer Sumsi, Miquel  (autor)
  • Karatzas, Dìmosthenis  (autor)
  • Valveny Llobet, Ernest  (autor)
  • Bardaji Goikoetxea, Itziar  (autor)
  • Bunke, Horst  (autor)