Transposition and time-warp invariant geometric music retrieval algorithms

Kjell Lemström, Mika Laitinen

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

Abstrakti

In this paper, we study the problem of transposition and time-warp invariant (TTWI) polyphonic content-based music retrieval (CBMR) in symbolically encoded music for which, to our best knowledge, no solutions exist. Representing music by sets of points in plane, we introduce two new algorithms for this setting. Given a query point set, of size m, to be searched for in a database point set, of size n, and applying a search window of width w, our algorithms run in time O(mwn\log n) for finding exact TTWI occurrences, and O(mnw² log n) for partial occurrences. The algorithms are related to our prior transposition and time-scale invariant (TTSI) algorithms. As local tempo changes and jittering are always present in real-world CBMR queries, any TTSI algorithm cannot provide a sufficient solution to the problem; the extra robustness of the new algorithms bridges this gap perfectly.
Alkuperäiskielienglanti
OtsikkoMultimedia and Expo (ICME), 2011 IEEE International Conference on Multimedia and Expo
Sivumäärä6
KustantajaInstitute of Electrical and Electronics Engineers
Julkaisupäivä2011
ISBN (painettu)978-1-61284-348-3
ISBN (elektroninen)978-1-61284-349-0
DOI - pysyväislinkit
TilaJulkaistu - 2011
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaMultimedia and Expo (ICME), 2011 IEEE International Conference on Multimedia and Expo - Barcelona , Espanja
Kesto: 11 heinäkuuta 201115 heinäkuuta 2011

Tieteenalat

  • 113 Tietojenkäsittely- ja informaatiotieteet

Siteeraa tätä