Abstract
An inexact matching algorithm for Attributed Relational Graphs is presented: according to it, two graphs are considered similar if, by using a defined set of syntactic and semantic transformations, they can be made isomorphic to each other. The matching process is carried out by using a State Space Representation: a state represents a partial solution of the matching between the graphs, and a transition between two states corresponds to the addition of a new pair of matched nodes. A set of feasibility rules are introduced for pruning states associated to partial matching solutions which do not satisfy the required graphs morphism. Results outlining the computational cost reduction achieved by the method are given with reference to a set of randomly generated graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shapiro, L. G., Haralick, R. M.: Structural description and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell. 3, 505–519 (1981).
Tsai, W. H., Fu, K. S.: Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. 9, 757–768 (1979).
Tsai, W. H., Fu, K. S.: Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Trans. Syst. Man Cybern. 13, 48–62 (1983).
Sanfeliu, A., Fu, K. S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13, 353–362 (1983).
Shapiro, L. G., Haralick, R. M.: A metric for comparing relational descriptions. IEEE Trans. Pattern Anal. Mach. Intell. 7, 90–94 (1985).
Ullman, J. R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 23, 31–42 (1976).
Bunke, H., Messmer, B. T.: Efficient attributed graph matching and its application to image analysis. In: Image analysis and processing (Braccini, C., DeFloriani, L., Vernazza, G., eds.), pp. 45–55. Berlin Heidelberg New York Tokyo: Springer 1995. (Lecture Notes in Computer Science, vol. 974)
Cordelia, L. P., Foggia, P., Sansone, C., Vento, M.: An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model. Proc. 13th ICPR. IEEE Comput. Society Press 3, 180–184 (1996).
Messmer, B. T.: Efficient graph matching algorithms for preprocessed model graphs. Ph.D. Thesis, Institute of Computer Science and Applied Mathematics, University of Bern, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Cordella, L.P., Foggia, P., Sansone, C., Vento, M. (1998). Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs. In: Jolion, JM., Kropatsch, W.G. (eds) Graph Based Representations in Pattern Recognition. Computing Supplement, vol 12. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6487-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6487-7_5
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83121-2
Online ISBN: 978-3-7091-6487-7
eBook Packages: Springer Book Archive