Audio Fingerprinting: Nearest Neighbor Search in High Dimensional Binary Spaces
- 245 Downloads
- 18 Citations
Abstract
Audio fingerprinting is an emerging research field in which a song must be recognized by matching an extracted “fingerprint” to a database of known fingerprints. Audio fingerprinting must solve the two key problems of representation and search. In this paper, we are given an 8192-bit binary representation of each five second interval of a song and therefore focus our attention on the problem of high-dimensional nearest neighbor search. High dimensional nearest neighbor search is known to suffer from the curse of dimensionality, i.e. as the dimension increases, the computational or memory costs increase exponentially. However, recently, there has been significant work on efficient, approximate, search algorithms. We build on this work and describe preliminary results of a probabilistic search algorithm. We describe the data structures and search algorithm used and then present experimental results for a database of 1,000 songs containing 12,217,111 fingerprints.
Keywords
Error Rate Search Algorithm Neighbor Search Music Information Retrieval Approximate SearchPreview
Unable to display preview. Download preview PDF.
References
- 1.E. Allamanche, J. Herre, O. Hellmuth, B. Bernhard Frobach, and M. Cremer, “AudioID: Towards Content-Based Identification of Audio Material,” in Proc. Int. Conf. on Web Delivering of Music, 2001.Google Scholar
- 2.S. Arya, D.M. Mount, N.S. Nctanyahu, R. Silverman, and A.Y. Wu, “An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions,” J. of the ACM, vol. 45, no. 6, 1998, pp. 891–923.Google Scholar
- 3.Y. Cheng, “Music Database Retrieval Based on Spectral Similarity,” in Int. Symp. on Music Information retrieval, 2001.Google Scholar
- 4.D. Fragoulis, G. Rousopoulos, T. Panagopoulos, C. Alexiou, and C. Papaodysscus, “On the Automated Recognition of Seriously Distorted Musical Recordings,” IEEE Trans. on Signal Processing, vol. 49, no. 4, 2001, pp. 898–908.Google Scholar
- 5.J. Haitsma and T. Kalker, “A Highly Robust Audio Fingerprinting System.” in 3rd Int. Conf. on Music Information Retrieval ISMIR, 2002.Google Scholar
- 6.J. Haitsma, T. Kalker, and J. Oostveen, “Robust Audio Hashing for Content Identification,” in Content Based Multimedia Indexing, 2001.Google Scholar
- 7.P. Indyk and R. Motwani, “Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality,” in Proc. of the 30th annual ACM Symp. on Theory of Computing, 1998, pp. 604–613.Google Scholar
- 8.J.M. Kleinberg, “Two Algorithms for Nearest-Neighbor Search in High Dimensions,” in Proc. of the 29th annual ACM Symp. on Theory of Computing, 1997, pp. 599–608.Google Scholar
- 9.H. Neuschmied, H. Mayer, and E. Battle, “Content-Based Indentification of Audio Titles on the Internet,” in Proc. Int. Conf. on Web Delivering of Music, 2001.Google Scholar
- 10.J. Oostveen, T. Kalker, and J. Haitsma, “Feature Extraction and a Database Strategy for Video Fingerprinting,” in 5th Int. Conf. on Visual Information Systems, vol. LNCS 2314, pp. 117–128. Springer Verlag, 2002.Google Scholar
- 11.P.N. Yianilos, “Locally Lifting the Curse of Dimensionality for nearest Neighbor Search,” in Proc. of the 11th annual ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 361–370.Google Scholar