Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Localized Key Finding: Algorithms and Applications

Localized Key Finding: Algorithms and Applications <jats:p>We consider the problem of determining a localized tonal context in a musical composition. Our method is based in part on a key-finding algorithm developed by Krumhansl and Schmuckler (Krumhansl, 1990) and is applied in a sliding-window fashion, producing a sequence of key assignments. These assignments constitute so-called class data in that they possess no natural numerical properties and can be considered as arising from a classification process. A new approach for smoothing such class data using graph theoretic norm estimates is applied to the sequence of key assignments. The effectiveness of the proposed method is evaluated by comparing it with judgments made by experts. Then, the problem is placed in the context of machine recognition of music patterns. We discuss a music pattern recognition system proposed by Coyle and Shmulevich (1998) that relies on robust determination of localized tonal context. This, in turn, allows the system to incorporate perceptual error criteria.</jats:p> http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Music Perception CrossRef

Localized Key Finding: Algorithms and Applications

Music Perception , Volume 17 (4): 531-544 – Jan 1, 2000

Localized Key Finding: Algorithms and Applications


Abstract

<jats:p>We consider the problem of determining a localized tonal context in a musical composition. Our method is based in part on a key-finding algorithm developed by Krumhansl and Schmuckler (Krumhansl, 1990) and is applied in a sliding-window fashion, producing a sequence of key assignments. These assignments constitute so-called class data in that they possess no natural numerical properties and can be considered as arising from a classification process. A new approach for smoothing such class data using graph theoretic norm estimates is applied to the sequence of key assignments. The effectiveness of the proposed method is evaluated by comparing it with judgments made by experts. Then, the problem is placed in the context of machine recognition of music patterns. We discuss a music pattern recognition system proposed by Coyle and Shmulevich (1998) that relies on robust determination of localized tonal context. This, in turn, allows the system to incorporate perceptual error criteria.</jats:p>

Loading next page...
 
/lp/crossref/localized-key-finding-algorithms-and-applications-7tyDngxpSO

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0730-7829
DOI
10.2307/40285832
Publisher site
See Article on Publisher Site

Abstract

<jats:p>We consider the problem of determining a localized tonal context in a musical composition. Our method is based in part on a key-finding algorithm developed by Krumhansl and Schmuckler (Krumhansl, 1990) and is applied in a sliding-window fashion, producing a sequence of key assignments. These assignments constitute so-called class data in that they possess no natural numerical properties and can be considered as arising from a classification process. A new approach for smoothing such class data using graph theoretic norm estimates is applied to the sequence of key assignments. The effectiveness of the proposed method is evaluated by comparing it with judgments made by experts. Then, the problem is placed in the context of machine recognition of music patterns. We discuss a music pattern recognition system proposed by Coyle and Shmulevich (1998) that relies on robust determination of localized tonal context. This, in turn, allows the system to incorporate perceptual error criteria.</jats:p>

Journal

Music PerceptionCrossRef

Published: Jan 1, 2000

There are no references for this article.