Robust Polyphonic Music Retrieval with N-grams

  • Authors:
  • Shyamala Doraisamy;Stefan Rüger

  • Affiliations:
  • Department of Computing, South Kensington Campus, Imperial College London, London SW7 2AZ, UK. sd3@imperial.ac.uk;Department of Computing, South Kensington Campus, Imperial College London, London SW7 2AZ, UK. s.ruege@imperial.ac.uk

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.