MuseScore/omr
2019-02-18 08:47:21 -05:00
..
CMakeLists.txt remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
image.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
importpdf.cpp fix compiler error in importpdf 2019-02-18 08:47:21 -05:00
importpdf.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
ocr.cpp remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
ocr.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
omr.cpp replacing "..." (3 dots) with "…" (ellipsis) 2019-01-02 13:38:38 +01:00
omr.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
omrpage.cpp eliminate debug artifacts 2018-12-18 14:55:54 +01:00
omrpage.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
omrview.cpp eliminate debug artifacts 2018-12-18 14:55:54 +01:00
omrview.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
pattern.cpp remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
pattern.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
pdf.cpp remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
pdf.h remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
README.md fix headings and typos in omr/README.md 2017-12-26 10:53:56 +01:00
skew.cpp remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
TODO Fix #100396: change "note heads" to "noteheads" 2016-05-02 21:22:29 -04:00
utils.cpp remove RCS IDs from (almost) all files 2018-11-02 23:53:21 +01:00
utils.h eliminate debug artifacts 2018-12-18 14:55:54 +01:00

Updates on Optical Music Recognition

Graphical Model for System Identification

  1. We can simply use vertical line detection to find bar lines. But the detection performance is unreliable due to noise such as note stems or lines in text. The other problem of solely relying on line detection is that we can hardly interpret the structure of systems based on what has been detected. The solution to this problem is using a graphical model to represent the system structure and encode useful distance or non-overlapping constraints, with which we can determine the grouping of staves into systems and the location of barlines in each system at the same time (simultaneously estimate both).

  2. Suppose we have n staves (n-1 gaps), then there'll be 2^(n-1) ways of grouping systems if taking each gap as a binary switch connecting or not connecting the adjacent staves. In each system (staff group), barline positions will be commonly shared (a very strong and useful constraint!). We can use a nested dynamic programming to solve this problem. The optimal hypothesis (how the staves are grouped together) until the k-th stave yielding the max score h(k) = max(h(i) + system(i+1, ..., k)), based on previous optimal hypotheses h(i), i= 1,2,...,k-1. In each hypothesized system(i,...,j) from i-th to j-th staves, we recognize shared barlines from left to right by finding the best scoring configuration b_opt = max(b(k1) + b(k2) + ... + b(kn)) supposing each horizontal location corresponds to a bar or just background, where b(.) is the scoring function for barline in that column. We can also incorporate negative constraints (clef, key sigs, time sigs, or note stem) into this bar line recognition process.

Demo

Screenshots of some results

Todo

  • Add robust note detector to impose negative constraints for bar line identification. (see here)
  • Fix staff detection for vector graphs
  • Optimize OMR performance and add clef/key recognitions