|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space
Dec. 2012 (vol. 34 no. 12)
pp. 2481-2488
| ASCII Text | x | ||
| Mani Malek Esmaeili, R. K. Ward, M. Fatourechi, "A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 12, pp. 2481-2488, Dec., 2012. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.2012.170, author = {Mani Malek Esmaeili and R. K. Ward and M. Fatourechi}, title = {A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {34}, number = {12}, issn = {0162-8828}, year = {2012}, pages = {2481-2488}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2012.170}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space IS - 12 SN - 0162-8828 SP2481 EP2488 EPD - 2481-2488 A1 - Mani Malek Esmaeili, A1 - R. K. Ward, A1 - M. Fatourechi, PY - 2012 KW - vectors KW - copy protection KW - file organisation KW - image retrieval KW - multimedia systems KW - binary fingerprinting KW - fast approximate nearest neighbor search algorithm KW - Hamming space KW - error weighted hashing algorithm KW - EWH algorithm KW - locality sensitive hashing algorithm KW - LSH algorithm KW - hash vectors KW - multimedia retrieval KW - copy detection systems KW - Nearest neighbor searches KW - Indexes KW - Signal processing algorithms KW - Hamming distance KW - Algorithm design and analysis KW - Approximation algorithms KW - binary embedding KW - Nearest neighbor search KW - Hamming space KW - multimedia fingerprinting KW - copy retrieval VL - 34 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
Web Extra: View Supplemental Material(PDF)
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.
Index Terms:
vectors,copy protection,file organisation,image retrieval,multimedia systems,binary fingerprinting,fast approximate nearest neighbor search algorithm,Hamming space,error weighted hashing algorithm,EWH algorithm,locality sensitive hashing algorithm,LSH algorithm,hash vectors,multimedia retrieval,copy detection systems,Nearest neighbor searches,Indexes,Signal processing algorithms,Hamming distance,Algorithm design and analysis,Approximation algorithms,binary embedding,Nearest neighbor search,Hamming space,multimedia fingerprinting,copy retrieval
Citation:
Mani Malek Esmaeili, R. K. Ward, M. Fatourechi, "A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 12, pp. 2481-2488, Dec. 2012, doi:10.1109/TPAMI.2012.170
Usage of this product signifies your acceptance of the Terms of Use.