A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space

Citations Over TimeTop 10% of 2012 papers

Abstract

A fast approximate nearest neighbor search algorithm for the (binary) Hamming space is proposed. The proposed Error Weighted Hashing (EWH) algorithm is up to 20 times faster than the popular locality sensitive hashing (LSH) algorithm and works well even for large nearest neighbor distances where LSH fails. EWH significantly reduces the number of candidate nearest neighbors by weighing them based on the difference between their hash vectors. EWH can be used for multimedia retrieval and copy detection systems that are based on binary fingerprinting. On a fingerprint database with more than 1,000 videos, for a specific detection accuracy, we demonstrate that EWH is more than 10 times faster than LSH. For the same retrieval time, we show that EWH has a significantly better detection accuracy with a 15 times lower error rate.

Related Papers

• → Order preserving hashing for approximate nearest neighbor search(2013)130 cited
• → A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space(2012)53 cited
• → Separated Variational Hashing Networks for Cross-Modal Retrieval(2019)34 cited
• → Efficient approximate nearest neighbor search with integrated binary codes(2011)13 cited
• → Multiple Binary Codes for Fast Approximate Similarity Search(2015)