Abstract
Graph matching is an important class of methods in pattern recognition. Typically, a graph representing an unknown pattern is matched with a database of models. If the database of model graphs is large, an additional factor in induced into the overall complexity of the matching process. Various techniques for reducing the influence of this additional factor have been described in the literature. In this paper we propose to extract simple features from a graph and use them to eliminate candidate graphs from the database. The most powerful set of features and a decision tree useful for candidate elimination are found by means of the C4.5 algorithm, which was originally proposed for inductive learning of classification rules. Experimental results are reported demonstrating that efficient candidate elimination can be achieved by the proposed procedure.
Chapter PDF
Similar content being viewed by others
Key words
References
L.G. Shapiro and R.M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Analysis and Machine Intelligence, volume 3, pages 504–519, 1981.
A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. In IEEE Trans. Systems, Man, and Cybernetics, volume 13, pages 353–363, 1983.
B. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 20, pages 493–505, 1998.
S.W. Lu, Y. Ren, and C.Y. Suen. Hierarchical attributed graph represenation and recognition of handwritten Chinese characters. In Pattern Recognition, volume 24, pages 617–632, 1991.
J. Rocha and T. Pavlidis. A shape analysis model with applications to a character recognition system. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 16, pages 393–404, 1994.
S.W. Lee, J.H. Kim, and F.C.A Groen. Translation-, rotation-, and scale-invariant recognition of hand-drawn symbols in schematic diagrams. In Int’l J. Pattern Recognition and Artificial Intelligence, volume 4, no. 1, pages 1–15, 1990.
H. Bunke, B. Messmer. Clustering and error-correcting matching of graphs for learning and recognition of symbols in engineering drawings. J. Hull and S. Taylor (eds.): Document Analysis Systems II, pages 102–117. World Scientific, 1998.
A. Pearce, T. Caelli, and W.F. Bischof. Rulegraphs for graph matching in pattern recognition. In Pattern Recognition, volume 27, no. 9, pages 1231–1246, 1994.
E.K. Wong. Model matching in robot vision by subgraph isomorphism. In Pattern Recognition, volume 25, no. 3, pages 287–304, 1992.
L.G. Shapiro and R.M. Haralick. Organization of relational models for scene analysis. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 3, pages 595–602, 1982.
K. Sengupta and K.L. Boyer. Organizing large structural modelbases. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 17, 1995.
B. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism. In Pattern Recognition, volume 32, pages 1979–1998, 1999.
J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann Publishers, 1993.
J.R. Ullman. An algorithm for subgraph isomorphism. In JACM, volume 23(1), pages 31–42, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lazarescu, M., Bunke, H., Venkatesh, S. (2000). Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_25
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive