Development of an Incremental Graph Matching Device

  • Richard E. Blake
Conference paper
Part of the NATO ASI Series book series (volume 30)


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.


Internal Line Identification Letter Relational Match Matching Step Reference Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    Cheng, J.K. and Huang, T.S., “Image Recognition by Matching Relational Structures,” Proceedings of PRIP 81, pp. 542–547, August 1981.Google Scholar
  5. [5]
    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.CrossRefGoogle Scholar
  6. [6]
    Garey, M.R. and Johnson, D.S., Computers and Intractability — a Guide to the Theory of NP-completeness, Freeman, 1979.MATHGoogle Scholar
  7. [7]
    Shapiro, L.G.; “Solving Consistent Labeling Problems Having the Separation Property,” Proceedings of Seventh International Conference on Pattern Recognition, Montreal, 1984, pp. 313–315.Google Scholar
  8. [8]
    Mcgregor, J.J., “Relational Consistency Algorithms and Their Application in Finding Subgraph and Graph Isomorphisms,” Inf. Sciences, 19, pp. 229–250, 1979.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    Mackworth, A.K. “Consistency in Networks of Relations,” Artificial Intelligence, Vol 8, No 1, pp. 99–118, 1977.MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    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.CrossRefGoogle Scholar
  11. [11]
    Scott, D., Lectures on a Mathematical Theory of Computation, Theoretical Foundations of Programming Methodology, Reidel, 1982.Google Scholar
  12. [12]
    Hoare, C.A.R.; Communicating Sequential Processes, Prentice Hall, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Richard E. Blake
    • 1
  1. 1.Computer Science DepartmentUniversity of TennesseeKnoxvilleUSA

Personalised recommendations