Loading...
Loading...

Go to the content (press return)

An approximate algorithm for median graph computation using graph embedding

Author
Ferrer, M.; Valveny, E.; Serratosa, F.; Riesen, K.; Bunke, H.
Type of activity
Presentation of work at congresses
Name of edition
19th International Conference on Pattern Recognition
Date of publication
2008
Presentation's date
2008
Book of congress proceedings
19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA
First page
1
Last page
4
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICPR.2008.4761354 Open in new window
Repository
http://hdl.handle.net/2117/19342 Open in new window
URL
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4761354&isnumber=4760915 Open in new window
Abstract
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces....
Citation
Ferrer, M. [et al.]. An approximate algorithm for median graph computation using graph embedding. A: International Conference on Pattern Recognition. "19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA". Tampa, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2008, p. 1-4.
Group of research
VIS - Artificial Vision and Intelligent Systems

Participants

  • Ferrer Sumsi, Miquel  (author and speaker )
  • Valveny Llobet, Ernest  (author and speaker )
  • Serratosa Casanelles, Francesc  (author and speaker )
  • Riesen, Kaspar  (author and speaker )
  • Bunke, Horst  (author and speaker )