Query by humming: musical information retrieval in an audio database
Proceedings of the third ACM international conference on Multimedia
Computer Science in Perspective
Filtering methods for content-based retrieval on indexed symbolic music databases
Information Retrieval
| Hi-index | 0.00 |
This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations required by real-world applications. In this setting, music is represented by sets of points in plane. A matching, pertinent to the application, involves two such sets of points and invariances under translations and time scalings. We give an algorithm for finding exact occurrences, under such a setting, of a given query point set, of size m, within a database point set, of size n, with running time O(mn2logn); partial occurrences are found in O(m2n2logn) time. The algorithms resemble the sweepline algorithm introduced in [1].