By Topic

Linear hidden Markov model for music information retrieval based on humming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baolong Liu ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., China ; Yadong Wu ; Yang Li

Recently, some studies have placed emphasis on statistical analysis in music information retrieval (MIR). The paper is concerned with applying a linear hidden Markov model (HMM) with three kinds of states, S, C and D, as the matching mechanism for a query by a humming system. Note segmentation, pitch tracking and the database of the system are briefly introduced. The paper analyzes six probable errors in humming and proposes the SCD HMM to model each song. Each of the states, S, C and D, represents two of the six errors. The SCD HMM describes all kinds of possibilities of errors in a hummed query. Each query can find a most probable state sequence in a SCD HMM and get a probability score that determines the similarity between the query and the candidate songs. The retrieval system contains about 1000 Chinese folk songs. Experimental results show that the model is robust to the six errors and generally a 90% matching accuracy (listed on top 5) can be achieved.

Published in:

Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on  (Volume:5 )

Date of Conference:

6-10 April 2003