This paper describes a simplified attributed programmed graph grammar to represent and process a-priori knowledge about common music notation. The presented approach serves as a high-level recognition stage and is interlocked to previous low-level recognition phases in our entire optical music recognition system (DOREMIDI++). The implemented grammar rules and control diagrams describe a declarative knowledge base to drive a transformation algorithm. This transformation converts the results of symbol recognition stages to a symbolic representation of the musical score.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A simplified attributed graph grammar for high-level music recognition


    Contributors:
    Baumann, S. (author)


    Publication date :

    1995-01-01


    Size :

    464700 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Simplified Attributed Graph Grammar for High-Level Music Recognition

    Baumann, S. | British Library Conference Proceedings | 1995


    A graph grammar programming style for recognition of music notation

    Fahmy, H. / Blostein, D. | British Library Online Contents | 1993


    Recognition of partially occluded objects using probabilistic ARG (attributed relational graph)-based matching

    Park, B. G. / Lee, K. M. / Lee, S. U. et al. | British Library Online Contents | 2003



    Region Correspondence by Inexact Attributed Planar Graph Matching

    Wang, C. / Abe, K. / IEEE Computer Society et al. | British Library Conference Proceedings | 1995