A comparative evaluation of search techniques for query-by-humming using the MUSART testbed

✍ Scribed by Roger B. Dannenberg; William P. Birmingham; Bryan Pardo; Ning Hu; Colin Meek; George Tzanetakis

• Publisher: John Wiley and Sons
• Year: 2007
• Tongue: English
• Weight: 911 KB
• Volume: 58
• Category: Article
• ISSN: 1532-2882
• DOI: 10.1002/asi.20532

✦ Synopsis

Abstract

Query‐by‐humming systems offer content‐based searching for melodies and require no special musical training or knowledge. Many such systems have been built, but there has not been much useful evaluation and comparison in the literature due to the lack of shared databases and queries. The MUSART project testbed allows various search algorithms to be compared using a shared framework that automatically runs experiments and summarizes results. Using this testbed, the authors compared algorithms based on string alignment, melodic contour matching, a hidden Markov model, n‐grams, and CubyHum. Retrieval performance is very sensitive to distance functions and the representation of pitch and rhythm, which raises questions about some previously published conclusions. Some algorithms are particularly sensitive to the quality of queries. Our queries, which are taken from human subjects in a realistic setting, are quite difficult, especially for n‐gram models. Finally, simulations on query‐by‐humming performance as a function of database size indicate that retrieval performance falls only slowly as the database size increases.