Searching notated polyphonic music using transportation distances
Proceedings of the 12th annual ACM international conference on Multimedia
Approximately matching polygonal curves with respect to the Fréchet distance
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Efficient content-based retrieval of motion capture data
ACM SIGGRAPH 2005 Papers
Digital Rights Management in Ubiquitous Computing
IEEE MultiMedia
Efficient human motion retrieval in large databases
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Large data methods for multimedia
Proceedings of the 15th international conference on Multimedia
Modeling privacy compromise: visibility of individuals via DRM and RFID in ubiquitous computing
Proceedings of the 2008 Spring simulation multiconference
Indexing and retrieval of human motion data by a hierarchical tree
Proceedings of the 16th ACM Symposium on Virtual Reality Software and Technology
Approximately matching polygonal curves with respect to the Fréchet distance
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Similarity search in animal sound databases
IEEE Transactions on Multimedia
Efficient motion search in large motion capture databases
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Lyrics-based audio retrieval and multimodal navigation in music collections
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
| Hi-index | 0.00 |
In this paper, we propose a unified approach to fast index-based music recognition. As an important area within the field of music information retrieval (MIR), the goal of music recognition is, given a database of musical pieces and a query document, to locate all occurrences of that document within the database, up to certain possible errors. In particular, the identification of the query with regard to the database becomes possible. The approach presented in this paper is based on a general algorithmic framework for searching complex patterns of objects in large databases. We describe how this approach may be applied to two important music recognition tasks: The polyphonic (musical score-based) search in polyphonic score data and the identification of pulse-code modulation audio material from a given acoustic waveform. We give an overview on the various aspects of our technology including fault-tolerant search methods. Several areas of application are suggested. We describe several prototypic systems we have developed for those applications including the notify! and the audentify! systems for score- and waveform-based music recognition, respectively.