A fast retrieval algorithm based on fibonacci hashing for audio fingerprinting systems

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In audio fingerprinting system, the database consists of hundreds of millions of sub-fingerprints. How to find out the most similar audio in the shortest time and use less memory in huge repository of sub-fingerprints is a hot topic of research. Recently, Philips introduced an effective search method based on hash table. In this paper, a fast retrieval algorithm based on the Fibonacci Hashing is proposed as an extension of Philips's method. The algorithm uses Fibonacci Hashing function which can adjust the size of hash table according to capacity of memory, provide a good distribution of hash value, and save memory. The performance of presented algorithm has been evaluated by experiments.

Cite

CITATION STYLE

APA

Chen, M., Xiao, Q., Matsumoto, K., Yoshida, M., Luo, X., & Kita, K. (2013). A fast retrieval algorithm based on fibonacci hashing for audio fingerprinting systems. In Proceedings of the 2013 International Conference on Advanced Information Engineering and Education Science, ICAIEES 2013 (pp. 219–222). Atlantis Press. https://doi.org/10.2991/icaiees-13.2013.59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free