Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Robust Polyphonic Music Retrieval with N-grams

Shyamala DoraisamyContact Information and Stefan RügerContact Information

(1) Department of Computing, South Kensington Campus, Imperial College London, London, SW7 2AZ, UK

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.

polyphonic music retrieval -  n-grams - query by humming - query by example - fault-tolerance


Contact InformationShyamala Doraisamy
Email: sd3@imperial.ac.uk

Contact InformationStefan Rüger
Email: s.ruege@imperial.ac.uk
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this article
Export this article as RIS | Text
 
Remote Address: 38.107.191.114 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)