| Authors |
|
| Publication date |
1997
|
| Journal |
Proceedings of the International Computer Music Conference
|
| Event |
23rd International Computer Music Conference, ICMC 1997
|
| Volume | Issue number |
1997
|
| Pages (from-to) |
337-340
|
| Organisations |
-
Other
-
Faculty of Science (FNWI) - Informatics Institute (IVI)
|
| Abstract |
Linking notes in a musical performance to the corresponding notes in a score, so-called score-performance matching, has been the topic of quite a large body of research. Proper matching algorithms are crucial for real-time composition and automatic accompaniment systems, as well as for music performance research and the design of expression editors. A matching algorithm is presented that takes advantage of the temporal structure that is annotated in the score. It is compared to two alternative matching procedures that use structural information only implicitly.
|
| Document type |
Article
|
| Language |
English
|
| Published at |
http://hdl.handle.net/2027/spo.bbp2372.1997.088
|
|
Permalink to this page
|
