The query by humming method based on cluster analysis and dynamic time warping

2015 ◽  
pp. 415-420
Keyword(s):  
Cluster Analysis ◽  
Dynamic Time Warping ◽  
Time Warping ◽  
Query By Humming ◽  
Dynamic Time

Follow That Tune-Adaptive Approach to DTW-based Query-by-Humming System

2015 ◽  
Vol 39 (4) ◽  
pp. 467-476 ◽  
Author(s):  
Bartłomiej Stasiak
Keyword(s):  
Dynamic Time Warping ◽  
Experimental Validation ◽  
Recognition Rate ◽  
Multimedia Databases ◽  
Time Warping ◽  
Query By Humming ◽  
Human Ability ◽  
Alignment Problem ◽  
Computationally Expensive ◽  
Dynamic Time

Abstract Dynamic Time Warping is a standard algorithm used for matching time series irrespective of local tempo variations. Its application in the context of Query-by-Humming interface to multimedia databases requires providing the transposition independence, which involves some additional, sometimes computationally expensive processing and may not guarantee the success, e.g., in the presence of a pitch trend or accidental key changes. The method of tune following, proposed in this paper, enables solving the pitch alignment problem in an adaptive way inspired by the human ability of ignoring typical errors occurring in sung melodies. The experimental validation performed on the database containing 4431 queries and over 5000 templates confirmed the enhancement introduced by the proposed algorithm in terms of the global recognition rate.

A New Approximate Matching Algorithm and its Application in Internet Music Search by Humming

2012 ◽  
Vol 433-440 ◽  
pp. 3662-3668
Author(s):  
Yun Feng Dong ◽  
Bei Qi
Keyword(s):  
Dynamic Time Warping ◽  
Large Scale ◽  
Time Warping ◽  
Similarity Matching ◽  
Matching Algorithm ◽  
Approximate Matching ◽  
Query By Humming ◽  
Dynamic Time

This paper has proposed a new approximate matching algorithm—similarity matching, and use the characteristics of algorithm to establish a system of internet music search by humming. The author compared the similarity matching algorithm and dynamic time warping (DTW) algorithm, which is most commonly used to query by humming, by the system of internet music search by humming. On the two standard of the query hit ratio and query speed, we got the result that similarity matching algorithm's comprehensive efficiency is superior, is one of QBH (query by humming) algorithm, which is applicable to the large-scale music library such as internet music search.

Sign in / Sign up

Export Citation Format

Share Document