A graph-rewriting paradigm for discrete relaxation: Application to sheet-music recognition

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 12, Issue 6, 1998, Pages 763-799

  Fahmy, H ^a,b,c   Blostein, D ^b,d,e,f  

^a UNIVERSITY OF TORONTO   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

^c IBM TORONTO LAB   (Canada)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^e CARNEGIE MELLON UNIVERSITY   (United States)

^f IEEE   (Canada)

Author keywords

Constraints; Diagram understanding; Discrete relaxation; Document image analysis; Graph rewriting; Graphics recognition; Interaction model; Label set; Neighborhood model; Optical music recognition

Indexed keywords

EID: 0001351532     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001498000439     Document Type: Article

References (44)

1. D. Bainbridge and N. Carter, "Automatic reading of music notation", Handbook of Character Recognition and Document Image Analysis, eds. H. Bunke and P. Wang, World Scientific, 1997, pp. 583-603.
2. S. Baumann, "A simplified attributed graph grammar for high-level music recognition", Proc. Third Int. Conf. Document Analysis and Recognition, Montreal, Canada, 1995, pp. 1080-1083.
3. D. Blostein and H. Baird, "A critical survey of music image analysis", Structured Document Image Analysis, eds. H. Baird, H. Bunke, and K. Yamamoto, Springer Verlag, 1992, pp. 405-434.
4. D. Blostein and L. Haken, "Justification of printed music", Commun. ACM 34, 3 (1991), 88-99.
5. D. Blostein and L. Haken, "The lime music editor: a diagram editor involving complex translations", Software - Practice and Experience 24, 3 (1994) 289-306.
6. D. Blostein, "General diagram-recognition methodologies", Graphics Recognition - Methods and Applications, eds. R. Kasturi and K. Tombre, LNCS Vol. 1072, Springer Verlag, 1996, pp. 106-122.
7. H. Bunke, "Attributed programmed graph grammars and their application to schematic diagram interpretation", IEEE Trans. Patt. Anal. Mach. Intell. 4, 6 (1982) 574-582.
8. N. Carter, "Conversion of the Haydn symphonies into electronic form using automatic score recognition: a pilot study", SPIE Proc. Series 2181 (1994) 279-290.
9. P. Chou, "Recognition of equations using a two-dimensional stochastic context-free grammar", Proc. SPIE Visual Communications and Image Processing IV, Philadelphia, PA, Nov. 1989, pp. 852-863.
10. L. Davis and T. Henderson, "Hierarchical constraint processes for shape analysis", IEEE Trans. Patt. Anal. Mach. Intell. 3, 3 (1981) 265-277.
11. L. Davis and A. Rosenfeld, "Cooperating processes for low level vision: a survey", Artif. Intell. 17 (1981) 245-263.
12. J. Dolado and F. Torrealdea, "Formal manipulation of Forrester diagrams by graph grammars", IEEE Trans. Syst. Man Cybern. 18, 6 (1988) 981-996.
13. D. Dori and A. Pnueli, "The grammar of dimensions in machine drawings", Comput. Vision Graph. Imag. Process. 42 (1988) 1-18.
14. H. Ehrig and H.-J. Kreowski, "Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems", Inform. Syst. 5 (1980) 225-238.
15. H. Fahmy and D. Blostein, "A graph grammar programming style for recognition of music notation", Mach. Vision Appl. 6, 2 (1993) 83-99.
16. H. Fahmy, "Reasoning in the presence of uncertainty via graph rewriting", Ph.D. Thesis, TR 95-382, Computing and Information Science, Queen's University, March 1995.
17. K.S. Fu, Syntactic Pattern Recognition and Applications, Prentice Hall, 1982.
18. I. Fujinaga, B. Alphonce, B. Pennycook and K. Hogan, "Optical music recognition: progress report", Proc. Int. Computer Music Conf., Montreal, Canada, 1991, pp. 66-74.
19. H. Göttler, "Diagram editors = graphs + attributes + graph grammars", Int. J. Man-Machine Studies 37, 4 (1992) 481-502.
20. A. Grbavec and D. Blostein, "Mathematics recognition using graph rewriting", Third Int. Conf. Document Analysis and Recognition, Montreal, Canada, August 1995, pp. 417-421.
21. R. Haralick and L. Shapiro, "The consistent labeling problem I", IEEE Trans. Patt. Anal. Mach. Intell. 1, 2 (1979) 173-184.
22. R. Haralick and L. Shapiro, "The consistent labeling problem II", IEEE Trans. Patt. Anal. Mach. Intell. 2, 3 (1980) 193-203.
23. J. den Hartog, T. ten Kate and J. Gerbrands, "Knowledge-based segmentation for automatic map interpretation", Graphics Recognition - Methods and Applications, eds. R. Kasturi and K. Tombre, LNCS Vol. 1072, Springer Verlag, 1996, pp. 159-178.
24. T. Henderson, Discrete Relaxation Techniques, Oxford University Press, New York, 1990.
25. T. Ho, J. Hull and S. Srihari, "Decision combination in multiple classifier systems", IEEE Trans. Patt. Anal. Mach. Intell. 16, 1 (1994) 66-75.
26. Int. Workshop on Graph Grammars and Their Application to Computer Science and Biology, LNCS Vol. 73, Springer Verlag, 1979.
27. Second Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 153, Springer Verlag, 1983.
28. Third Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 291, eds. H. Ehrig, M. Nagl, G. Rozenberg and A. Rosenfeld, Springer Verlag, 1987.
29. Fourth Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 532, Springer Verlag, 1991.
30. Fifth Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 1073, Springer Verlag, 1996.
31. D. Isenor and S. Zaky, "Fingerprint identification using graph matching", Patt. Recogn. 19, 2 (1986) 113-122.
32. S. Kaplan, J. Loyall and S. Goering, "Specifying concurrent languages and systems with Δ-grammars", Fourth Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 532, Springer Verlag, 1991, pp. 475-489.
33. G. Kopec and P. Chou, "Document image decoding using Markov source models", IEEE Trans. Patt. Anal. Mach. Intell. 16, 6 (1994) 602-617.
34. S. Lavirotte and L. Pottier, "Optical formula recognition", Fourth Int. Conf. Document Analysis and Recognition, Ulm, Germany, August, 1997, pp. 357-361.
35. R. Mohr and G. Masini, "Good old discrete relaxation", Proc. ECAI'88 - European Conf. AI, sponsored by European Coordinating Committee for AI (ECCAI), München, Germany, 1988, pp. 651-656.
36. U. Montanari, "Networks of constraints: fundamental properties and applications to picture processing", Inform. Sci. 7 (1974) 95-132.
37. J. Mulder, A. Mackworth and W. Havens, "Knowledge structuring and constraint satisfaction: the Mapsee approach", IEEE Trans. Patt. Anal. Mach. Intell. 10, 6 (1988) 866-879.
38. M. Nagl and A. Schürr, "A specification environment for graph grammars", Fourth Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 532, Springer Verlag, 1991, pp. 41-54. (The PROGRES system is available at http://www-i3.informatik.rwth-aachen.de/research/progres/index.html.)
39. J. Pfaltz and A. Rosenfeld, "Web grammars", Proc. 1st Int. Joint Conf. Artificial Intelligence, Washington, 1969, pp. 599-609.
40. F. Preparata and M. Shamos. Computational Geometry: An Introduction, Springer-Verlag, 1985.
41. J. Rekers and A. Schürr, "Defining and parsing visual languages with layered graph grammars", J. Visual Languages and Computing 8, 1 (1997) 27-55.
42. J. Sowa, Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley Publishing Company, 1984.
43. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, San Diego, California, 1993.
44. A. Zündorf, "Graph pattern matching in PROGRES", Fifth Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS Vol. 1073, Springer Verlag, 1996, pp. 454-468.