Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

CiteULike is a free service for managing and discovering scholarly references - click here to get started.

Sign In to gain access to subscriptions and/or personal tools.
Journal of Information Science
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
0165551507087712v1
34/6/777    most recent
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by You, J.
Right arrow Articles by Kim, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

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

Jinhee You

Department of Computer Science, Yonsei University, Korea

Sanghyun Park

Department of Computer Science, Yonsei University, Korea, sanghyun{at}cs.yonsei.ac.kr

Inbum Kim

Division of Computor, Kimpo College, Korea

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

This version was published on December 1, 2008

Journal of Information Science, Vol. 34, No. 6, 777-798 (2008)
DOI: 10.1177/0165551507087712
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?