3 March 2014 Compact binary hashing for music retrieval
Author Affiliations +
Abstract
With the huge volume of music clips available for protection, browsing, and indexing, there is an increased attention to retrieve the information contents of the music archives. Music-similarity computation is an essential building block for browsing, retrieval, and indexing of digital music archives. In practice, as the number of songs available for searching and indexing is increased, so the storage cost in retrieval systems is becoming a serious problem. This paper deals with the storage problem by extending the supervector concept with the binary hashing. We utilize the similarity-preserving binary embedding in generating a hash code from the supervector of each music clip. Especially we compare the performance of the various binary hashing methods for music retrieval tasks on the widely-used genre dataset and the in-house singer dataset. Through the evaluation, we find an effective way of generating hash codes for music similarity estimation which improves the retrieval performance.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jin S. Seo, Jin S. Seo, } "Compact binary hashing for music retrieval", Proc. SPIE 9027, Imaging and Multimedia Analytics in a Web and Mobile World 2014, 90270I (3 March 2014); doi: 10.1117/12.2039459; https://doi.org/10.1117/12.2039459
PROCEEDINGS
7 PAGES


SHARE
Back to Top