Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Melodic matching techniques for large music databases
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
A fast and practical bit-vector algorithm for the longest common subsequence problem
Information Processing Letters
A comparison of melodic database retrieval techniques using sung queries
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Modern Information Retrieval
Robust temporal and spectral modeling for query By melody
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
The Shazam music recognition service
Communications of the ACM - Music information retrieval
Effectiveness of note duration information for music retrieval
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Accurately finding audio recordings in response to symbolic queries is one of the key challenges in the field of music information retrieval. Pitch is one of the main features of music; in this paper we propose and evaluate approaches for using pitch information in polyphonic symbolic queries to retrieve full tracks of audio recordings. The audio data is first converted into symbolic data, using an automated transcription process. This is a noisy process, adding up to three times as many notes to the transcription than are actually present. Nevertheless, recordings can be accurately retrieved by manually-constructed queries (either in full or truncated) using the longest common subsequence algorithm (and a sliding window if the queries are truncated). Precision at 1 of about 80% was achieved, and around 85% of queries return correct answers in the top 10 from a collection of 1808 recordings. Truncated queries are as effective as untruncated queries for retrieving correct answers in the first rank position. Thus, the burden on users is reduced as they only need to produce a small fraction of a song as a query.