Abstract
The paper introduces a multi-process graph matching device. The behavior of the device is demonstrated as it matches a reference graph to an image sequence with elements that exhibit a changing scale and level of resolvable detail. The device uses analysis by synthesis to consume the graphs to be matched. For the present work these are formed by skeletal line segments, but it is pointed out that relational matching will be investigated in future work. The responsibilities of the 8 cooperating processes are described and a cycle in the matching is stepped through. The theoretical dangers of taking suboptimal matches are contrasted with the practical advantages of greatly reducing the search space. The need for recovery after accepting associations that later prove to be wrong is pointed out. Comments on the description of the convergence to a labeling in terms of Scott’s lattice theory are given.
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
Sanfeliu, A., “A Distance Measure Based on Tree-graph-grammars: A Way of Recognizing Hidden and Deformed 3-D Complex Objects,” Proceedings of Seventh International Conference on Pattern Recognition, Montreal, 1984, pp. 739–741.
Sanfeliu, A. and Fu K-S., “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition,”IEEE Transactions on Systems, Man and Cybernetics, May-June, 1983.
Eshera, M.A. and Fu K-S, “An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph Matching,” to be published in IEEE Transactions on Pattern Analysis and Machine Intelligence.
Cheng, J.K. and Huang, T.S., “Image Recognition by Matching Relational Structures,” Proceedings of PRIP 81, pp. 542–547, August 1981.
Shapiro, L.G. and Haralick, R.M., “Structural Description and Inexact Matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-3, No 5, pp. 504–519, September 1981.
Garey, M.R. and Johnson, D.S., Computers and Intractability — a Guide to the Theory of NP-completeness, Freeman, 1979.
Shapiro, L.G.; “Solving Consistent Labeling Problems Having the Separation Property,” Proceedings of Seventh International Conference on Pattern Recognition, Montreal, 1984, pp. 313–315.
Mcgregor, J.J., “Relational Consistency Algorithms and Their Application in Finding Subgraph and Graph Isomorphisms,” Inf. Sciences, 19, pp. 229–250, 1979.
Mackworth, A.K. “Consistency in Networks of Relations,” Artificial Intelligence, Vol 8, No 1, pp. 99–118, 1977.
Nudel, B., “Consistent-Labeling Problems and their Algorithms: Expected-Complexities and Theory-Based Heuristics,” Artificial Intelligence, Vol 21, No 1 and 2, pp. 135–178, March 1983.
Scott, D., Lectures on a Mathematical Theory of Computation, Theoretical Foundations of Programming Methodology, Reidel, 1982.
Hoare, C.A.R.; Communicating Sequential Processes, Prentice Hall, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blake, R.E. (1987). Development of an Incremental Graph Matching Device. In: Devijver, P.A., Kittler, J. (eds) Pattern Recognition Theory and Applications. NATO ASI Series, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83069-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-83069-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83071-6
Online ISBN: 978-3-642-83069-3
eBook Packages: Springer Book Archive