A Comprehensive Trainable Error Model for Sung Music Queries

Abstract

We propose a model for errors in sung queries, a variant of the hidden Markov model (HMM). This is a solution to the problem of identifying the degree of similarity between a (typically error-laden) sung query and a potential target in a database of musical works, an important problem in the field of music information retrieval. Similarity metrics are a critical component of “query-by-humming” (QBH) applications which search audio and multimedia databases for strong matches to aural queries. Our model comprehensively expresses the types of error or variation between target and query: cumulative and non-cumulative local errors, transposition, tempo and tempo changes, insertions, deletions and modulation. The model is not only expressive, but automatically trainable, or able to learn and generalize from query examples. We present results of simulations, designed to assess the discriminatory potential of the model, and tests with real sung queries, to demonstrate relevance to real-world applications. 0.

Cite

Text

Meek and Birmingham. "A Comprehensive Trainable Error Model for Sung Music Queries." Journal of Artificial Intelligence Research, 2004. doi:10.1613/JAIR.1334

Markdown

[Meek and Birmingham. "A Comprehensive Trainable Error Model for Sung Music Queries." Journal of Artificial Intelligence Research, 2004.](https://mlanthology.org/jair/2004/meek2004jair-comprehensive/) doi:10.1613/JAIR.1334

BibTeX

@article{meek2004jair-comprehensive,
  title     = {{A Comprehensive Trainable Error Model for Sung Music Queries}},
  author    = {Meek, Colin and Birmingham, William P.},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2004},
  pages     = {57-91},
  doi       = {10.1613/JAIR.1334},
  volume    = {22},
  url       = {https://mlanthology.org/jair/2004/meek2004jair-comprehensive/}
}