We are grateful to Mika Turkia for the implementations.Peer reviewe

Lemström, Kjell

Mäkinen, Veli

Ukkonen, Esko

Helsingin yliopiston digitaalinen arkisto

Geometric algorithms for transposition invariant content-based music retrieval

We represent music as sets of points or sets of horizontal line segments in the Euclidean plane. Via this geometric representation we cast transposition invariant content-based music retrieval problems as ones of matching sets of points or sets of horizontal line segments in plane under translations. For finding the exact occurrences of a point set (the query pattern) of size m within another point set (representing the database) of size n, we give an algorithm with running time O(mn), and for finding partial occurrences another algorithm with running time O(mn log m). We also use the total length of the overlap between the line segments of a translated query and a database (i.e., the shared time) as a quality measure of an occurrence and present an O(n log n + mn log m) algorithm for finding translations giving the largest possible overlap. Some experimental results on the performance of the algorithms are reported

Esko Ukkonen

Kjell Lemström

Veli Mäkinen

JScholarship

Geometric Algorithms for Transposition Invariant Content-Based Music Retrieval

NEUROSURGERY ENTHUSIASTIC WOMEN SOCIETY

Geometric algorithms for transposition invariant content based music retrieval.

Johns Hopkins University

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6730

Geometric algorithms for transposition invariant content-based music retrieval

Abstract

Similar works

Full text

Available Versions

Helsingin yliopiston digitaalinen arkisto

JScholarship

NEUROSURGERY ENTHUSIASTIC WOMEN SOCIETY

Johns Hopkins University