Transposition and Time-Scale Invariant Geometric Music Retrieval

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(mn log n); partial occurrences are found in O(mn log n) time. The algorithms resemble the sweepline algorithm introduced in [1].