This Article Full Text (OnlineFirst PDF) Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Google Scholar Articles by You, J. Articles by Kim, I. Social Bookmarking                   What's this?

An efficient frequent melody indexing method to improve the performance of query-by-humming systems

¹ Department of Computer Science, Yonsei University, Korea
² Division of Computor, Kimpo College, Korea

^* To whom correspondence should be addressed.

	Abstract

In recent years, the need to efficiently store and retrieve large amounts of musical information has increased. In this paper, we design and implement a Query-By-Humming (QBH) system, which can retrieve melodies similar to users' humming. To make this QBH system efficient, the following three methods were proposed. First, we convert the melodies to be indexed into the corresponding strings, in order to increase search speed. The conversion method is designed to tolerate the errors involved in humming. Second, we extract significant melodies from music and then build a couple of indexes from them. For this task, we propose reliable methods for extracting melodies that occur frequently and for melodies that begin after a long rest. Third, we propose a three-step index searching method for minimizing database access. Through the experiments with a real-world data set, it was verified that this system has noticeable improvements over the N-gram approach.

Key Words: content-based indexing method; multimedia database; music information retrieval; query-by-humming system

CiteULike    Connotea    Del.icio.us    Digg    Reddit    Technorati    What's this?