Dimosthenis Karatzas


Refereed Papers

A Recursive Embedding Approach to Median Graph Computation

M. Ferrer, D. Karatzas, E. Valveny and H. Bunke

Proceedings of the 7th IAPR -TC-15 Workshop on Graph-based Representations in Pattern Recognition, LNCS 5534, pp. 113-123, Venice, Italy, 2009


The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.

Full Paper



Valid XHTML 1.0! Valid CSS! Number of visitors since 3 June 2005:
Best viewed in 1024x768 - © 2005-06
Designed by: Christos Papadopoulos - Maintained by: Dimosthenis Karatzas