ACM Home Page
Please provide us with feedback. Feedback
Compacting music signatures for efficient music retrieval
Full text PdfPdf (301 KB)
Source ACM International Conference Proceeding Series; Vol. 261 archive
Proceedings of the 11th international conference on Extending database technology: Advances in database technology table of contents
Nantes, France
SESSION: Research sessions: Indexing table of contents
Pages 229-240  
Year of Publication: 2008
ISBN:978-1-59593-926-5
Authors
Bin Cui  Peking University
H. V. Jagadish  University of Michigan
Beng Chin Ooi  National University of Singapore
Kian-Lee Tan  National University of Singapore
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 148,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1353343.1353374
What is a DOI?

ABSTRACT

Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is easy to quantize music into a discrete string representation, retrieval by content requires (approximate) sub-string matching, which is hard.

In this paper, we present a novel system, called MUSIG, that uses compact MUsic SIGnatures for efficient contentbased music retrieval. The signature is computed as follows: (a) each music file is split into a set of (overlapping) segments; (b) similar segments are clustered together; the number of clusters corresponds to the number of dimensions; (c) for each music file, the number of its segments that fall into a cluster determines the key value in that dimension.

Most index structures for multimedia are only able to provide an initial filtering and return a set of candidate answers that must be further examined. For MUSIG, we have also designed a scoring function that permits a ranked answer set to be generated directly based only on the signatures. Our experimental results show that this scheme retains a high degree of accuracy while being very efficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Download karaoke files and players. In http://www.schok.co.uk/kb/downloads.htm, 2005.
2
3
4
 
5
C. Francu and C. G. Nevill-Manning. Distance metrics and indexing strategies for a digital library of popular music. In Proc. International Conference on Multimedia and Expo (II), pages 889--, 2000.
 
6
 
7
J. Hartigan and M. Wong. A K-means clustering algorithm. In Applied Statistics, Volume. 28, pages 100--108, 1979.
8
9
10
 
11
K. Jensen and T. H. Andersen. Real-time beat estimation using feature extraction. In Proc. the Computer Music Modeling and Retrieval Symposium, 2003.
12
 
13
14
15
 
16
M. Marolt. On finding melodic lines in audio recordings. In Proc. 7th Int. Conference on Digital Audio Effects, 2004.
17
 
18
T. Nishimura, H. Hashiguchi, J. Takita, J. X. Zhang, M. Goto, and R. Oka. Music signal spotting retrieval by a humming query using start frame feature dependent continuous dynamic programming. In Proc. International Symposium on Music Information Retrieval, pages 301--307, 2001.
 
19
 
20
21
22
 
23
G. Tzanetakis and P. Cook. Musical genre classification of audio signals. In IEEE Transactions on Speech and Audio Processing, pages 293--302, 2002.
24
25
 
26
 
27
 
28
E. Ukkonen. On-line construction of suffix trees. In Algorithmica, pages 14(3):249--260, 1995.
29
30
31


Collaborative Colleagues:
Bin Cui: colleagues
H. V. Jagadish: colleagues
Beng Chin Ooi: colleagues
Kian-Lee Tan: colleagues