About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Qinghua Daxue Xuebao/Journal of Tsinghua University
Paper
VP-tree based multi-stage matching algorithm for query-by-humming systems
Abstract
Query by humming (QBH) is an important application for musical information retrieval. The key challenges in QBH are the unstructured data modules in audio songs and the balance between searching speed and accuracy. This paper presents a data structure for audio songs using a hand labeling method to label the melody and to divide the songs into natural segments. The search index uses the segmentation structure rather than the entire lyrics for the song. The system generates a VP-tree search structure with a multi-level searching algorithm that includes coarse searching for fast match and dynamic time warping (DTW) that leads to a fine match. Evaluations with 2 213 melody segments reduce the search time by over 40% without greatly reducing the recognition accuracy.