Abstract
Graph grammars are a promising tool for solving picture processing problems. However, the application of graph grammars to diagram recognition has been limited to rather simple analysis of local symbol configurations. This paper introduces the Build-Weed-Incorporate programming style for graph grammars and shows its application in determining the meaning of complex diagrams, where the interaction among physically distant symbols is semantically important. Diagram recognition can be divided into two stages: symbol recognition and high-level recognition. Symbol recognition has been studied extensively in the literature. In this work we assume the existence of a symbol recognizer and use a graph grammar to assemble the diagram's information content from the symbols and their spatial relationships. The Build-Weed-Incorporate approach is demonstrated by a detailed discussion of a graph grammar for high-level recognition of music notation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blostein D, Baird H (1991) A critical survey of music image analysis. In: Structured document image analysis. Baird H, Bunke H, Yamamoto K (eds.) Springer Verlag, 1991
Blostein D, Haken L (1991) Justification of printed music. Commun ACM 34:88–99
Bunke H (1982a) Attributed programmed graph grammars and their application to schematic diagram interpretation. IEEE Pattern Anal Machine Intelligence 4:574–582
Bunke H (1982b) On the generative power of sequential and parallel programmed graph grammars. Computing 29:89–112
Chou P (1989) Recognition of equations using a two-dimensional stochastic context-free grammar. Proc. SPIE Visual Communications and Image Processing IV, Philadelphia, pp 852–863
Claus V, Ehrig H, Rozenberg G (eds) (1979) Second international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture notes in computer science, vol 73)
Ehrig H, Nagl, M, Rozenberg G (1983) Second international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture notes in computer science, vol 153)
Ehrig H, Nagl, M, Rozenberg G (1987) Third international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture notes in computer science, vol 291)
Ehrig H, Kreowski H, Rozenberg G (1991) Fourth international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture notes in computer science, vol 532)
Fahmy H (1991) A graph-grammar approach to high-level music recognition. Technical Report 91-318, Department of Computing and Information Science. Master's thesis, Queen's University, Kingston, Ontario
Fahmy H, Blostein D (1991) A graph grammar for high-level recognition of music notation. Proc First International Conference on Document Analysis and Recognition, St. Malo, France
Fu KS (1982) Syntactic pattern recognition and applications. Prentice-Hall, Englewood Cliffs
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, Oxford
Goettler, H (1983) Attribute graph grammars for graphics. In: Ehrig H, Nagl M, Rozenberg G, Rosenfeld A (eds) Second international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture notes in computer science, vol 153)
Kreowski H, Rozenberg G (1990a) On structured graph grammars, I. Infor Sci 52:185–210
Kreowski H, Rozenberg G (1990b) On structure graph grammars, II. Infor Sci 52:221–246
Mahoney JV (1982) Automatic Analysis of musical score images. Dept. of Computer Science and Engineering, Bachelor of Science thesis, MIT, Cambridge
Mehlhorn K (1984) Data structures and algorithms 3: multidimensional searching and computational geometry. Springer, Berlin Heidelberg New York
Nagl M (1979) A tutorial and bibliographical survey on graph grammars. In: Claus V, Ehrig H, Rozenberg G (eds) International workshop on graph grammars and their application to computer science and biology. Springer, Berlin Heidelberg New York (Lecture note in computer science, vol 73)
Nagl M (1987) Set theoretic approaches to graph grammars. In: Ehrig H, Rozenberg G (eds) Third international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture note in computer science, vol 291)
Pfaltz J (1972) Web grammars and picture description. Computer Graphics Image Processing 1:193–220
Pfaltz J (1979) A graph grammar that describes the set of twodimensional surface networks. In: Claus V, Ehrig H, Rozenberg G (eds) International workshop on graph grammars and their application to computer science and biology. Springer, Berlin Heidelberg New York (Lecture note in computer science, vol 73)
Rosenkrantz DJ (1969) Programmed grammars and classes of formal languages. J ACM 16:107–131
Sanfeliu A, Fu KS (1983) Tree-graph grammars for pattern recognition. In: Ehrig H, Rozenberg G (eds) Second international workshop on graph grammars and their application to computer science. Springer, Berlin Heidelberg New York (Lecture note in computer science, vol 153)
Author information
Authors and Affiliations
Additional information
See Appendix A for an illustration of the terms for musical symbols used in this paper.
Rights and permissions
About this article
Cite this article
Fahmy, H., Blostein, D. A graph grammar programming style for recognition of music notation. Machine Vis. Apps. 6, 83–99 (1993). https://doi.org/10.1007/BF01211933
Issue Date:
DOI: https://doi.org/10.1007/BF01211933