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

Authors:
Wei-Ho Tsai;Yu-Ming Tu;Cin-Hao Ma
Affiliations:
Department of Electronic Engineering & Graduate Institute of Computer and Communication Engineering, National Taipei University of Technology, No. 1, Sec. 3, Chunghsiao E. Rd, Taipei City 10608, T ...;Department of Electronic Engineering & Graduate Institute of Computer and Communication Engineering, National Taipei University of Technology, No. 1, Sec. 3, Chunghsiao E. Rd, Taipei City 10608, T ...;Department of Electronic Engineering & Graduate Institute of Computer and Communication Engineering, National Taipei University of Technology, No. 1, Sec. 3, Chunghsiao E. Rd, Taipei City 10608, T ...
Venue:
Pattern Recognition Letters
Year:
2012

Citing 8
Cited 0

Hierarchical filtering method for content-based music retrieval via acoustic input

MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Robust Polyphonic Music Retrieval with N-grams

Journal of Intelligent Information Systems
Toward accurate dynamic time warping in linear time and space

Intelligent Data Analysis
A phrase-level piecewise linear scaling algorithm for melody match in query-by-humming systems

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Effectiveness of N-gram fast match for query-by-humming systems

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
A General Framework of Progressive Filtering and Its Application to Query by Singing/Humming

IEEE Transactions on Audio, Speech, and Language Processing
Challenging Uncertainty in Query by Humming Systems: A Fingerprinting Approach

IEEE Transactions on Audio, Speech, and Language Processing
A Query-by-Singing System for Retrieving Karaoke Music

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.