An FFT-based fast melody comparison method for query-by-singing/humming systems

• Published in: Pattern recognition letters Vol. 33; no. 16; pp. 2285 - 2291
• Main Authors: Tsai, Wei-Ho, Tu, Yu-Ming, Ma, Cin-Hao
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.12.2012
• Subjects: Dynamic time warping; Fast Fourier transform; Query-by-humming; Query-by-singing; Query-by-humming; Dynamic time warping; Fast Fourier transform; Query-by-singing
• ISSN: 0167-8655; 1872-7344
• DOI: 10.1016/j.patrec.2012.08.020

► An efficient query-by-singing/humming method is proposed to retrieve music recordings. ► The proposed method enables fast melody comparison. ► Fast melody comparison is done in the frequency domain rather than the time domain. Query-by-singing/humming (QBSH) is a promising way to retrieve music recordings based on main melody’s similarity. This paper presents an efficient QBSH method that enables fast melody comparison. In contrast to the most prevalent QBSH method, which measures the distances between note sequences in the time domain, the proposed method performs distance computation in the frequency domain. This is done with the fast Fourier transform, which converts different-length note sequences into equal-dimension vectors via zero padding. The equal dimensionality allows us to compare the vectors using Euclidean distance directly, which avoids performing time-consuming alignment between sequences. To take both efficiency and effectiveness into account, the proposed fast melody comparison method is combined with the dynamic time warping technique into a two-stage sequence matching system. Our experiments show that the proposed system outperforms several existing speed-up DTW-based systems in terms of both efficiency and effectiveness.