Tree-graph grammars for pattern recognition

  • A. Sanfeliu
  • K. S. Fu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


This paper deals with a class of grammars which is called tree-graph grammar (TGG) and its attributed version (ATGG, attributed-tree-graph grammar). The features of this class of grammars include its power to generate useful graphs and its fast parser. Principally, the graphs that can be characterized by these grammars are a subset of hierarchical graphs, including planar graphs. Also these TGG's (and ATGG's) can generate graphs describing, for example, textures, flow charts, circuit diagrams, etc. It is proved that the class of context-free graph grammars (CFGG) is a subclass of TGG's. Also it is shown that TGG can generate graphs which can not be produced by CFGG's, for example, planar graphs. Moreover, a parser for ATGG's is proposed. This parser has time complexity of 0(n4) (n is the number of nodes of the graph plus the number of superimposed nodes), and space complexity of 0(n2). For the special case where the starting node is given, the time complexity is reduced to 0(n3). Finally, an application of ATGG's to the recognition of circuit diagrams is presented.


Time Complexity Planar Graph Production Rule Circuit Diagram Input 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.
    R. A. Kirsch, “Computer Interpretation of English Text and Picture Patterns,” IEEE Trans. on Electronic Computers, EC-13, 363, 1964.Google Scholar
  2. 2.
    R. Narasimhan, “Labeling Schemata and Syntactic Descriptions of Pictures,” Information and Control 7, 151, 1964.Google Scholar
  3. 3.
    V. Claus, M. Ehrig, and G. Rozenberg, Eds., Graph-Grammars and Their Application to Computer Science and Biology, Springer-Verlag, 1979.Google Scholar
  4. 4.
    H. O. Bunke, “Computer Recognition of Circuit Diagrams,” Purdue University, TR-EE 80-54, Dec. 1980.Google Scholar
  5. 5.
    F. Nake, A. Rosenfeld (eds.), Graph Languages, North Holland, Amsterdam, 1972.Google Scholar
  6. 6.
    S. Watanabe, “Chemical Structure Language (CSL) and its Applications,” Proc. 3rd Intern. Joint Conf. Pattern Recognition (Coronado, Calif., Nov. 8–11, 1976), pp. 602–606.Google Scholar
  7. 7.
    J. M. Brayer and K. S. Fu, “The Derivation Diagram of a Web Grammar and Its Application to Scene Analysis,” 1976 Joint Workshop on Pattern Recognition and Artificial Intelligence (Hyannis, Mass., June 1–3, 1976), IEEE Publ. 76CH1169-2C, 1976.Google Scholar
  8. 8.
    P. D. Vigna and C. Ghezzi, “Context-Free Graph Grammars,” Inf. and Control 37, 207–233, 1978.Google Scholar
  9. 9.
    K. S. Fu, Syntactic Pattern Recognition and Applications, Prentice-Hall, 1982.Google Scholar
  10. 10.
    T. Pavlidis, Structural Pattern Recognition, Springer-Verlag, 1977.Google Scholar
  11. 11.
    H. Bley, “Digitization and Segmentation of Circuit Diagrams,” Proc. 1st Scandinavian Conf. on Im. Analysis, Linkoping, Sweden, 1980.Google Scholar
  12. 12.
    R. L. T. Cederberg, “Automatic Interpretation of Hand-Drawn Electrical Schematics, ” Int. Conf. on CAD and Manufacture of Electronic Components, Circuit and Systems, Univ. of Sussex, July 3–5, 1979.Google Scholar
  13. 13.
    J. F. Jarvis, “The Line Drawing Editor: Schematic Diagram Editing Using Pattern Recognition Techniques,” Comp. Graphics and Im. Proc., Vol. 6, 1977, 452–484.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • A. Sanfeliu
    • 1
  • K. S. Fu
    • 2
  1. 1.Instituto de CiberneticaUniversidad Politecnica de BarcelonaBarcelonaSpain
  2. 2.School of Electrical EngineeringPurdue UniversityWest LafayetteUSA

Personalised recommendations