Guest Speaker

Name That Tune: Finding a Song from a Sung Query

Bryan Pardo
University of Michigan

Thurs., Mar. 4th
3:30pm; 480 Dreese Labs
All interested parties are invited.
Refreshments will be served immediately preceding the talk.

Abstract:
Music Information Retrieval has become an active area of research motivated by the increasing importance of internet-based music distribution. Online catalogs are already approaching one million songs, so it is important to study new techniques for searching these vast stores of audio. One approach to finding music that has received much attention is “Query by Humming” (QBH). This approach enables users to retrieve songs and information about them by singing, humming, or whistling a melodic fragment. In QBH systems, the query is a digital audio recording of a melodic fragment, and the ultimate target is a complete digital audio recording of a piece.

We have created a QBH system for music search and retrieval. A user sings a theme from the desired piece of music. The sung theme (query) is converted into a sequence of pitch-intervals and rhythms. This sequence is compared to musical themes (targets) stored in a database. The top pieces are returned to the user in order of similarity to the sung theme. We describe two approaches to measuring similarity between database themes and the sung query. In the first, queries are compared to database themes using probabilistic string-alignment algorithms. Here, similarity between target and query is determined by edit cost. In the second approach, pieces in the database are represented as hidden Markov models (HMMs). In this approach, the query is treated as an observation sequence and a target is judged similar to the query if its HMM has a high likelihood of generating the query. Experiments show that while no approach is clearly superior in retrieval ability, string matching often has a significant speed advantage. Moreover, neither approach surpasses human performance.

Host: DeLiang (Leon) Wang