A Fast Retrieval Algorithm Based on Fibonacci Hashing for Audio Fingerprinting Systems

DOI

10.2991/icaiees-13.2013.59How to use a DOI?

Keywords

audio retrieval, Fibonacci Hashing, audio fingerprint, hash table.

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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Mei Chen
AU  - Qingmei Xiao
AU  - Kazuyuki Matsumoto
AU  - Minoru Yoshida
AU  - Xin Luo
AU  - Kenji Kita
PY  - 2013/12
DA  - 2013/12
TI  - A Fast Retrieval Algorithm Based on Fibonacci Hashing for Audio Fingerprinting Systems
BT  - Proceedings of the 2013 International Conference on Advanced Information Engineering and Education Science (ICAIEES 2013)
PB  - Atlantis Press
SP  - 219
EP  - 222
SN  - 1951-6851
UR  - https://doi.org/10.2991/icaiees-13.2013.59
DO  - 10.2991/icaiees-13.2013.59
ID  - Chen2013/12
ER  -