By Topic

Approximate lower-bounding functions for the speedup of DTW for melody recognition

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)
Hong-Ru Lee ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Taiwan ; Ching Chen ; Jang, J.-S.R.

Conventional methods for melody recognition (or the so-called query by humming) are primarily based on dynamic programming, such as dynamic time warping (DTW). However, the computation load of DTW becomes prohibitively massive when the database has more than, say, 10,000 songs. To lessen the computation while keeping a reasonable recognition rates, this paper present a lower-bound based method that can reduce the computation effectively.

Published in:

Cellular Neural Networks and Their Applications, 2005 9th International Workshop on

Date of Conference:

28-30 May 2005