Please use this identifier to cite or link to this item:
http://hdl.handle.net/10261/30415
Share/Export:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Title: | Synthesis of median spectral graph |
Authors: | Ferrer, Miquel CSIC ORCID; Serratosa, Francesc; Sanfeliu, Alberto CSIC ORCID | Keywords: | Pattern recognition Pattern recognition systems |
Issue Date: | 2005 | Publisher: | Springer Nature | Citation: | 2nd Iberian Conference on Pattern Recognition and Image Analysis: pp. 139-146 (2005) | Abstract: | 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. | Description: | Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), 2005, Estoril (Portugal) | Publisher version (URL): | http://dx.doi.org/10.1007/11492542_18 | URI: | http://hdl.handle.net/10261/30415 | DOI: | 10.1007/11492542_18 | ISBN: | 9783540261544 |
Appears in Collections: | (IRII) Comunicaciones congresos |
Show full item record
CORE Recommender
Page view(s)
591
checked on Apr 17, 2024
Download(s)
485
checked on Apr 17, 2024
Google ScholarTM
Check
Altmetric
Altmetric
WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.