Abstract
The graph structure is a strong formalism for representing pictures in syntactic pattern recognition. Many models for graph grammars have been proposed as a kind of hyper-dimensional generating systems, whereas the use of such grammars for pattern recognition is relatively infrequent. One of the reason is the difficulties of building a syntax analyzer for such graph grammars. In this paper, we define a subclass of nPCE graph grammars and present a parsing algorithm of O(n) for both sequential and parallel cases.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ehrig, H., M. Nagl and G. Rozenberg (ed.): Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 153, Springer-Verlag, Berlin, 1983
Ehrig, H., M. Nagl, G. Rozenberg and A. Rosenfeld (ed.): Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 291, Springer-Verlag, Berlin, 1987
Ehrig, H., H.-J. Kreowski and G. Rozenberg (ed.): Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, 532, Springer-Verlag, 1991
Flasinski, M.: Parsing of edNLC-graph grammars for scene analysis, Pattern Recognition, 21, pp. 623–629, 1988.
Aizawa, K. and A. Nakamura: Graph grammars with path controlled embedding, Theoretical Computer Science, 88, pp. 151–170, 1991.
Janssens, D., G. Rozenberg and R. Verraedt: On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing, 18, pp. 279–304, 1982.
Shi, Q. Y. and K. S. Fu: Parsing and translation of attributed expansive graph languages for scene analysis, IEEE Transaction on Pattern Analysis and Machine Intelligence, PAMI-5, pp. 472–485, 1983.
Mylopoulos, J. P. and T. Pavlidis: On the topological properties of quantized spaces, Journal of the Association for Computing Machinery, 18, pp. 239–254, 1971.
Rosenfeld, A.: Partial path groups and parallel group constructions, in G. Rozenberg and A. Salomaa (ed.), The Book of L, Springer-Verlag, Berlin, pp. 369–382, 1986.
Melter, R. A.: Tessellation graph characterization using rosettas, Pattern Recognition Letters, 4, pp. 79–85, 1986.
Flasinski, M.: Characteristics of edNLC-graph grammar for syntactic pattern recognition, Computer Vision, Graphics, and Image Processing, 47, pp. 1–21, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aizawa, K., Nakamura, A. (1992). Path-controlled graph grammars for syntactic pattern recognition. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-56346-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56346-4
Online ISBN: 978-3-540-47538-5
eBook Packages: Springer Book Archive