Large-scale cover song recognition using hashed chroma landmarks

Thierry Bertin-Mahieux; Daniel P. W. Ellis

Large-scale cover song recognition using hashed chroma landmarks
Bertin-Mahieux, Thierry
Ellis, Daniel P. W.
Electrical Engineering
Persistent URL:
Book/Journal Title:
2011 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics: Proceedings: October 16-19, 2011, Mohonk Mountain House, New Paltz, NY, USA
Publisher Location:
Piscataway, N.J.
Cover song recognition, also called version identification, can only be solved by exposing the underlying tonal content of music. Apart from obvious applications in copyright enforcement, techniques for cover identification can also be used to find patterns and structure in music datasets too large for any musicologist to even listen to. Much progress has been made on cover song recognition, but work to date has been reported on datasets of at most a few thousand songs, using algorithms that simply do not scale beyond the capacity of a small portable music player. In this paper, we consider the problem of finding covers in a database of a million songs, and we only consider algorithms that can deal with such data. Using a fingerprinting-inspired model, we present the first results of cover song recognition on the Million Song Dataset. This task has been renewed by the availability of so many tracks, and this work is intended to be the first step towards a practical solution.
Artificial intelligence
Publisher DOI:
Item views
text | xml
Suggested Citation:
Thierry Bertin-Mahieux, Daniel P. W. Ellis, 2011, Large-scale cover song recognition using hashed chroma landmarks, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:13630.

Center for Digital Research and Scholarship at Columbia University Libraries | Policies