A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories

Abstract

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special "don't care" symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established "step-leap " representation is examined. In the step-leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don't care symbols are introduced to represent categories e.g. ∗ = s, ∗ = l and # = -s, # = -l. For such a sequence, we are interested in finding maximal repeating pairs and repetitions with a hole (two matching subsequences separated with an intervening non-matching symbol). We propose an O(n+d(n-d)+z)-time algorithm for computing all such repetitions in a given sequence x = x[1..n] with d binary don't care symbols, where z is the output size.
Fichier principal
Vignette du fichier
ismir2005.pdf (138.36 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00619902 , version 1 (25-03-2013)

Identifiers

  • HAL Id : hal-00619902 , version 1

Cite

Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR 2005), 2005, Londres, United Kingdom. pp.167-174. ⟨hal-00619902⟩
269 View
247 Download

Share

Gmail Mastodon Facebook X LinkedIn More