License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06171.8
URN: urn:nbn:de:0030-drops-6525
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/652/
Go to the corresponding Portal

Meredith, David

Point-set algorithms for pattern discovery and pattern matching in music

pdf-format:
06171.MeredithDavid.Paper.652.pdf (0.7 MB)

Abstract

An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval system for indexing a collection of music documents so that it can be searched more rapidly. It can also be used in software tools for music analysis and composition and in a music transcription system or model of music cognition for discovering grouping structure, metrical structure and voice-leading structure. In most approaches to pattern discovery in music, the data is assumed to be in the form of strings. However, string-based methods become inefficient when one is interested in finding highly embellished occurrences of a query pattern or searching for polyphonic patterns in polyphonic music. These limitations can be avoided by representing the music as a set of points in a multidimensional Euclidean space. This point-set pattern matching approach allows the maximal repeated patterns in a passage of polyphonic music to be discovered in quadratic time and all occurrences of these patterns to be found in cubic time. More recently, Clifford et al. (2006) have shown that the best match for a query point set within a text point set of size n can be found in O(n log n) time by incorporating randomised projection, uniform hashing and FFT into the point-set pattern matching approach. Also, by using appropriate heuristics for selecting compact maximal repeated patterns with many non-overlapping occurrences, the point-set pattern discovery algorithms described here can be adapted for data compression. Moreover, the efficient encodings generated when this compression algorithm is run on music data seem to resemble the motivic-thematic analyses produced by human experts.

BibTeX - Entry

@InProceedings{meredith:DagSemProc.06171.8,
  author =	{Meredith, David},
  title =	{{Point-set algorithms for pattern discovery and pattern matching in music}},
  booktitle =	{Content-Based Retrieval},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6171},
  editor =	{Tim Crawford and Remco C. Veltkamp},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/652},
  URN =		{urn:nbn:de:0030-drops-6525},
  doi =		{10.4230/DagSemProc.06171.8},
  annote =	{Keywords: Content-based music retrieval, point-set pattern matching}
}

Keywords: Content-based music retrieval, point-set pattern matching
Collection: 06171 - Content-Based Retrieval
Issue Date: 2006
Date of publication: 19.09.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI