Research Online

Logo

Goldsmiths - University of London

Song Intersection by Approximate Nearest Neighbour Retrieval

Casey, Michael A. and Slaney, M.. 2006. Song Intersection by Approximate Nearest Neighbour Retrieval. International Conference on Music Information Retrieval (ISMIR), Victoria, BC, [Article]

No full text available

Abstract or Description

We present new methods for computing inter-song similarities using intersections between multiple audio pieces. The intersection contains portions that are similar, when one song is a derivative work of the other for example, in two different musical recordings. To scale our search to large song databaseswe have developed an algorithmbased on localitysensitive hashing (LSH) of sequences of audio features called audio shingles. LSH provides an efficient means to identify approximate nearest neighbors in a high-dimensional feature space. We combine these nearest neighbor estimates, each a match from a very large database of audio to a small portion of the query song, to form a measure of the approximate similarity. We demonstrate the utility of our methods on a derivative works retrieval experiment using both exact and approximate (LSH) methods. The results show that LSH is at least an order of magnitude faster than the exact nearest neighbor method and that accuracy is not impacted by the approximate method.

Item Type:

Article

Departments, Centres and Research Units:

Computing

Dates:

DateEvent
October 2006Published

Item ID:

15158

Date Deposited:

01 Dec 2015 14:58

Last Modified:

20 Jun 2017 09:43

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

http://research.gold.ac.uk/id/eprint/15158

Edit Record Edit Record (login required)