Abstract
Generalized median graph is a general concept useful to capture the essential information of a set of graphs. In addition, spectral techniques can be used to obtain approximate solutions of graph matching problems in a reasonable time. In this work we use the novel concept of spectral median graph which takes advantage of both the median concept and the spectral techniques, to synthesize the representative of a set of graphical symbols. The results show that this concept represents appropriately the most important intra-class features, while rejecting small distortions and, for extension, it can be used to infer a prototype of a set of symbols.
This work was sponsored research Fellowship number 401-027 (UAB) / Cicyt TIC2003-09291 (Ministerio Ciencia y Tecnología).
Chapter PDF
Similar content being viewed by others
References
Ullman, J.R.: An algorithm for subgraph isomorphism. Journal of ACM 23(1), 31–42 (1976)
Bunke, H., Messmer, B.T.: Recent advances in graph matching. IJPRAI 11(1), 169–203 (1997)
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)
Lladós, J., Valveny, E., Sánchez, G., Martí, E.: Symbol Recognition: Current Advances and Perspectives. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol. 2390, pp. 104–127. Springer, Heidelberg (2002)
Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377–388 (1996)
Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3), 353–362 (1983)
Dosch, P., Valveny, E.: Report on the second symbol recognition contest (to appear in lncs series) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrer, M., Valveny, E., Serratosa, F. (2006). Spectral Median Graphs Applied to Graphical Symbol Recognition. In: Martínez-Trinidad, J.F., Carrasco Ochoa, J.A., Kittler, J. (eds) Progress in Pattern Recognition, Image Analysis and Applications. CIARP 2006. Lecture Notes in Computer Science, vol 4225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892755_80
Download citation
DOI: https://doi.org/10.1007/11892755_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46556-0
Online ISBN: 978-3-540-46557-7
eBook Packages: Computer ScienceComputer Science (R0)