Please use this identifier to cite or link to this item:
Título : Synthesis of median spectral graph
Autor : Ferrer Sumsi, Miquel, Serratosa Casanelles, Francesc, Sanfeliu Cortés, Alberto
Palabras clave : Pattern recognition
Pattern recognition systems
Fecha de publicación : 2005
Editor: Springer
Citación : 2nd Iberian Conference on Pattern Recognition and Image Analysis: pp. 139-146 (2005)
Resumen: In pattern recognition, median computation is an important technique for capturing the important information of a given set of patterns but it has the main drawback of its exponential complexity. Moreover, the Spectral Graph techniques can be used for the fast computation of the approximate graph matching error, with a considerably reduced execution complexity. In this paper, we merge both methods to define the Median Spectral Graphs. With the use of the Spectral Graph theories, we find good approximations of median graph. Experiments on randomly generated graphs demonstrate that this method works well and it is robust against noise.
Descripción : Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), 2005, Estoril (Portugal)
ISBN : 9783540261544
Appears in Collections:(IRII) Comunicaciones congresos

Files in This Item:
File Description SizeFormat 
doc1.pdf288,16 kBAdobe PDFView/Open
Show full item record

Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.