Abstract
The median graph is a useful tool to cluster a set of graphs and obtain a prototype of them. The spectral graph theory is another approach to represent graphs and find “good” approximate solutions for the graph-matching problem. Recently, both approaches have been put together and a new representation has emerged, which is called Spectral-Median Graphs. In this paper, we summarize and compare two techniques to synthesize a Spectral-Median Graph: one is based on the correlation of the modal matrices and the other one is based on the averaging of the spectral modes. Results show that, although both approaches obtain good prototypes of the clusters, the first one is slightly more robust against the noise than the second one.
This work was sponsored research Fellowship number 401-027 (UAB) / Cicyt TIN2006-15694-C02-02 (Ministerio Ciencia y Tecnología).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ullman, J.R.: An algorithm for subgraph isomorphism. Journal of ACM 23(1), 31–42 (1976)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004)
Jiang, X., Münger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144–1151 (2001)
Jiang, X., Münger, A., Bunke, H.: Synthesis of representative graphical symbols by computing generalized median graph. In: Chhabra, A.K., Dori, D. (eds.) GREC 1999. LNCS, vol. 1941, pp. 183–192. Springer, Heidelberg (2000)
Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Recognition and Image Analysis 10(5), 695–703 (1988)
Ferrer, M., Serratosa, F., Sanfeliu, A.: Synthesis of median spectral graph. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3523, pp. 139–146. Springer, Heidelberg (2005)
White, D., Wilson, R.C.: Mixing spectral representations of graphs. In: ICPR, vol. 4, pp. 140–144. IEEE Computer Society Press, Los Alamitos (2006)
Dosch, P., Valveny, E.: Report on the second symbol recognition contest. In: Liu, W., Lladós, J. (eds.) GREC 2005. LNCS, vol. 3926, pp. 381–397. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ferrer, M., Serratosa, F., Valveny, E. (2007). Evaluation of Spectral-Based Methods for Median Graph Computation. In: Martí, J., Benedí, J.M., Mendonça, A.M., Serrat, J. (eds) Pattern Recognition and Image Analysis. IbPRIA 2007. Lecture Notes in Computer Science, vol 4478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72849-8_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-72849-8_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72848-1
Online ISBN: 978-3-540-72849-8
eBook Packages: Computer ScienceComputer Science (R0)