The Open UniversitySkip to content
 

Robust polyphonic music retrieval with n-grams

Doraisamy, Shyamala and Rüger, Stefan (2003). Robust polyphonic music retrieval with n-grams. Journal of Intelligent Information Systems, 21(1) pp. 53–70.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1023/A:1023553801115
Google Scholar: Look up in Google Scholar

Abstract

In this paper we investigate the retrieval performance of monophonic and polyphonic queries made on a polyphonic music database. We extend the n-gram approach for full-music indexing of monophonic music data to polyphonic music using both rhythm and pitch information. We define an experimental framework for a comparative and fault-tolerance study of various n-gramming strategies and encoding levels. For monophonic queries, we focus in particular on query-by-humming systems, and for polyphonic queries on query-by-example. Error models addressed in several studies are surveyed for the fault-tolerance study. Our experiments show that different n-gramming strategies and encoding precision differ widely in their effectiveness. We present the results of our study on a collection of 6366 polyphonic MIDI-encoded music pieces.

Item Type: Journal Article
ISSN: 0925-9902
Keywords: polyphonic music retrieval; n-grams; query by humming; query by example; fault-tolerance
Academic Unit/Department: Knowledge Media Institute
Item ID: 8034
Depositing User: Users 7283 not found.
Date Deposited: 12 Jun 2007
Last Modified: 04 Apr 2011 09:21
URI: http://oro.open.ac.uk/id/eprint/8034
Share this page:

Altmetrics

Scopus Citations

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk