An improved method of locality sensitive hashing for indexing large-scale and high-dimensional features

Signal Processing

Volumn 93, Issue 8, 2013, Pages 2244-2255

  Gu, Xiaoguang ^a,b   Zhang, Yongdong ^a   Zhang, Lei ^a,b   Zhang, Dongming ^a   Li, Jintao ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

High dimensional; Large scale; Locality sensitive hashing; Non Uniform problem; Pivot based filtering algorithm

Indexed keywords

FILTERING ALGORITHM; HIGH-DIMENSIONAL; LARGE-SCALE; LOCALITY SENSITIVE HASHING; NON-UNIFORM;

DIGITAL STORAGE; SPEED;

INDEXING (OF INFORMATION);

EID: 84876288430     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2012.07.014     Document Type: Article

References (41)

1. D. Gorisse, M. Cord, and F. Precioso Locality-sensitive hashing for chi2 distance IEEE Transactions on Pattern Analysis and Machine Intelligence 34 2012 402 409
2. M. Wang, X.-S. Hua, R. Hong, J. Tang, G.-J. Qi, and Y. Song Unified video annotation via multigraph learning IEEE Transactions on Circuits and Systems for Video Technology 19 2009 733 746
3. A. Gionis, P. Indyk, R. Motwani, Similarity search in high dimensions via hashing, in: Proceedings of 25th International Conference on Very Large Data Bases (VLDB), 1999, pp. 518-529.
4. M. Datar, N. Immorlica, P. Indyk, V. Mirrokni, Locality-sensitive hashing scheme based on p-stable distributions, in: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG '04, ACM, New York, NY, USA, 2004, pp. 253-262.
5. A. Andoni, P. Indyk, E2LSH: Exact Euclidean Locality Sensitive Hashing, 2004. URL 〈 http://web.mit.edu/andoni/www/LSH/ 〉.
6. A. Andoni, and P. Indyk Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions Communications of the ACM 51 2008 117 122
7. B. Kulis, K. Grauman, Kernelized locality-sensitive hashing for scalable image search, in: Proceedings of 12th International Conference on Computer Vision, 2009, pp. 2130-2137.
8. Y. Ke, R. Sukthankar, L. Huston, Efficient near-duplicate detection and sub-image retrieval, in: ACM Conference on Multimedia, 2004, pp. 869-876.
9. G. Shakhnarovich, T. Darrell, and P. Indyk Nearest-Neighbor Methods in Learning and Vision: Theory and Practice 2006 MIT Press
10. B. Matei, Y. Shan, H. Sawhney, Y. Tan, R. Kumar, D. Huber, and M. Hebert Rapid object indexing using locality sensitive hashing and joint 3D-signature space estimation IEEE Transactions on Pattern Analysis and Machine Intelligence 28 7 2006 1111 1126
11. M. Wang, X.-S. Hua, J. Tang, and R. Hong Beyond distance measurement: constructing neighborhood similarity for video annotation IEEE Transactions on Multimedia 11 2009 465 476
12. M. Wang, X.-S. Hua, T. Mei, R. Hong, G.-J. Qi, Y. Song, and L.-R. Dai Semi-supervised kernel density estimation for video annotation Computer Vision and Image Understanding 113 3 2009 384 396
13. M. Wang, K. Yang, X.-S. Hua, and H.-J. Zhang Towards a relevant and diverse search of social images IEEE Transactions on Multimedia 12 8 2010 829 842
14. R. Hong, M. Wang, M. Xu, S. Yan, T.-S. Chua, Dynamic captioning video accessibility enhancement for hearing impairment, in: ACM International Conference on Multimedia (ACM MM), 2010.
15. P. Indyk, N. Thaper, Fast image retrieval via embeddings, in: Proceedings of the International Workshop on Statistical and Computational Theories of Vision, 2003.
16. Rina Panigrahy, Entropy based nearest neighbor search in high dimensions, in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA '06, ACM, New York, NY, USA, 2006, pp. 1186-1195.
17. Q. Lv, W. Josephson, Z. Wang, M. Charikar, K. Li, Multi-probe LSH: efficient indexing for high-dimensional similarity search, in: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB '07, VLDB Endowment, 2007, pp. 950-961.
18. A. Joly, O. Buisson, A posteriori multi-probe locality sensitive hashing, in: Proceedings of the 16th ACM International Conference on Multimedia, MM '08, ACM, New York, NY, USA, 2008, pp. 209-218.
19. H. Jegou, L. Amsaleg, C. Schmid, P. Gros, Query-adaptative locality sensitive hashing, in: International Conference on Acoustics, Speech, and Signal Processing, 2008.
20. Y. Weiss, A. Torralba, and R. Fergus Spectral hashing The Neural Information Processing Systems 21 2008 1753 1760
21. J. Wang, S. Kumar, S.-F. Chang, Sequential projection learning for hashing with compact codes, in: Proceedings of the 27th International Conference on Machine Learning, 2010.
22. W. Liu, J. Wang, S. Kumar, S.-F. Chang, Hashing with graphs, in: Proceedings of the 28th International Conference on Machine Learning, 2011.
23. J. Wang, S. Kumar, S.-F. Chang, Semi-supervised hashing for scalable image retrieval, in: CVPR, 2010.
24. M. Bawa, T. Condie, P. Ganesan, LSH forest: self-tuning indexes for similarity search, in: WWW 2005, 2005, pp. 651-660.
25. P.N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, 1993, pp. 311-321.
26. T. Chiueh, Content-based image indexing, in: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, 1994, pp. 582-593.
27. S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the 21st International Conference on Very Large Data Bases, VLDB '95, 1995, pp. 574-584.
28. T. Bozkaya, M. Ozsoyoglu, Distance-based indexing for high-dimensional metric spaces, in: ACM SIGMOD Record, vol. 26, ACM, 1997, pp. 357-368.
29. L. Zhang, X. Gu, Y. Zhang, D. Zhang, J. Li, A pivot-based filtering algorithm for enhancing query performance of LSH, in: Visual Communications and Image Processing (VCIP), 2011, pp. 1-4.
30. P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, in: FOCS, Published by the IEEE Computer Society, 2000, p. 189.
31. H. Jgou, M. Douze, and C. Schmid Product quantization for nearest neighbor search IEEE Transactions on PAMI 33 1 2011 117 128
32. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín Searching in metric spaces ACM Computing Surveys 33 2001 273 321
33. W.A. Burkhard, and R.M. Keller Some approaches to best-match file searching Communications of the ACM 16 1973 230 236
34. R. Baeza-Yates, W. Cunto, U. Manber, S. Wu, Proximity matching using fixed-queries trees, in: Combinatorial Pattern Matching, Springer, 1994, pp. 198-212.
35. R. Baeza-Yates Searching: an algorithmic tour Encyclopedia of Computer Science and Technology 37 1997 331 359
36. E. Chávez, J. Marroquín, and G. Navarro Fixed queries array: a fast and economical data structure for proximity searching Multimedia Tools and Applications 14 2 2001 113 135
37. J. Uhlmann Satisfying general proximity/similarity queries with metric trees Information Processing Letters 40 4 1991 175 179
38. I. Kalantari, and G. McDonald A data structure and an algorithm for the nearest point problem IEEE Transactions on Software Engineering 1983 631 634
39. P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB '97, 1997, pp. 426-435.
40. I.T. Jolliffe, Principal component analysis, in: Springer Series in Statistics, 2nd edition, Springer, 2002.
41. T.-S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, Y.-T. Zheng, Nus-wide: a real-world web image database from National University of Singapore, in: ACM International Conference on Image and Video Retrieval, 2009.