Automatic modulation finding using convex sets of notes

Aline Honingh*

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

Key finding algorithms, designed to determine the local key of segments in a piece of music, usually have difficulties at the locations where modulations occur. A specifically designed program to indicate modulations in a piece of music is presented in this paper. It was previously shown that the major and minor diatonic scale, as well as the diatonic chords, form convex sets when represented in the Euler lattice (Honingh and Bod 2005). Therefore, a non-convex set within a piece of music may indicate that this specific set is not part of a diatonic scale, which could indicate a modulation in the music. A program has been developed that finds modulations in a piece of music by localizing nonconvex sets. The program was tested on the first five preludes and fugues in a major key from the first book of Bach's Well-tempered Clavier. It has been shown that the algorithm works best for modulations that involve many chromatic notes.

Original languageEnglish
Title of host publicationMathematics and Computation in Music - First International Conference, MCM 2007, Revised Selected Papers
Pages88-96
Number of pages9
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event1st International Conference on Mathematics and Computation in Music, MCM 2007 - Berlin, Germany
Duration: 18 May 200720 May 2007

Publication series

NameCommunications in Computer and Information Science
Volume37 CCIS
ISSN (Print)1865-0929

Conference

Conference1st International Conference on Mathematics and Computation in Music, MCM 2007
CountryGermany
CityBerlin
Period18/05/0720/05/07

Fingerprint

Dive into the research topics of 'Automatic modulation finding using convex sets of notes'. Together they form a unique fingerprint.

Cite this