Melody Recognition with Learned Edit Distances

Abstract : In a music recognition task, the classification of a new melody is often achieved by looking for the closest piece in a set of already known prototypes. The definition of a relevant similarity measure becomes then a crucial point. So far, the edit distance approach with a-priori fixed operation costs has been one of the most used to accomplish the task. In this paper, the application of a probabilistic learning model to both string and tree edit distances is proposed and is compared to a genetic algorithm cost fitting approach. The results show that both learning models outperform fixed-costs systems, and that the probabilistic approach is able to describe consistently the underlying melodic similarity model.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00322432
Contributor : Marc Sebban <>
Submitted on : Wednesday, September 17, 2008 - 4:26:50 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:30 PM
Long-term archiving on : Friday, June 4, 2010 - 11:30:05 AM

File

ssspr08_cr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00322432, version 1

Citation

Amaury Habrard, Jose-Manuel Inesta, David Rizo, Marc Sebban. Melody Recognition with Learned Edit Distances. Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2008 and SPR 2008, Dec 2008, Orlando, United States. pp.86-96. ⟨hal-00322432⟩

Share

Metrics

Record views

246

Files downloads

379