Rate the Article: An Efficient Hash Count Indexing and Searching Scheme for Audio Fingerprinting, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 99 | Views: 331

Research Paper | Computer Science & Engineering | India | Volume 3 Issue 9, September 2014 | Rating: 6.9 / 10


An Efficient Hash Count Indexing and Searching Scheme for Audio Fingerprinting

Simarjeet Singh Bhatia, Rupali Bhartiya


Abstract: In todays dynamically changing world music databases are the one which are updating at a great speed and so is the identification process. In order to recognize a song rapidly and accurately we use an audio fingerprint. An audio fingerprint summarizes an audio recording or a song. A song can be recognized or identified by matching its fingerprint to the fingerprints present in a database. It has a wide variety of applications in broadcast monitoring, connected audio (FM/AM), music library and many more. This process of audio fingerprinting is divided into two phases namely fingerprint extraction and fingerprint matching. In this paper focus on fingerprint matching phase has been kept. We propose a new method of indexing and search algorithm. This indexing method will provide a base for our search algorithm to make it hybrid and more efficient. Theoretically and practically our algorithm provides better results as compared to Haitsma and Kalker method.


Keywords: sub-fingerprint, audio fingerprint, hashing, bunching, indexing


Edition: Volume 3 Issue 9, September 2014,


Pages: 1910 - 1915



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top