A Comprehensive Trainable Error Model for Sung Music Queries

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1613/jair.1334

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 oral 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Comprehensive Trainable Error Model for Sung Music Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Comprehensive Trainable Error Model for Sung Music Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Comprehensive Trainable Error Model for Sung Music Queries will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-480043

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.