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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ferrer, M., Serratosa, F., & Sanfeliu, A. (2005). Synthesis of median spectral graph. In Lecture Notes in Computer Science (Vol. 3523, pp. 139–146). Springer Verlag. https://doi.org/10.1007/11492542_18
Mendeley helps you to discover research relevant for your work.