Manipulation of music for melody matching
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Algorithmic Clustering of Music Based on String Compression
Computer Music Journal
MIDI to SP-MIDI Transcoding Using Phrase Stealing
IEEE MultiMedia
Journal of the American Society for Information Science and Technology
Melodic analysis with segment classes
Machine Learning
Towards a computational model of melody identification in polyphonic music
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Searching for music: from melodies in mind to the resources on the web
Proceedings of the 13th International Conference on Humans and Computers
Polyphonic alignment algorithms for symbolic music retrieval
CMMR/ICAD'09 Proceedings of the 6th international conference on Auditory Display
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Hi-index | 0.00 |
Retrieving music from large digital databases is a demanding computational task. The cost of indexing and searching depends on the computational effort of measuring musical similarity, but also heavily on the number and sizes of files in the database. One way to speed up music retrieval is to reduce the search space by removing redundant and uninteresting material in the database. We propose a simple measure of ‘interestingness’ based on music complexity, and present a reduction algorithm for MIDI files based on this measure. It is evaluated by comparing reduction ratios and the correctness of retrieval results for a query by humming task before and after applying the reduction.