Density sensitive hashing

IEEE Transactions on Cybernetics

Volumn 44, Issue 8, 2014, Pages 1362-1371

  Jin, Zhongming ^a   Li, Cheng ^a   Lin, Yue ^a   Cai, Deng ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Clustering; locality sensitive hashing; random projection

Indexed keywords

ARTIFICIAL INTELLIGENCE; PATTERN RECOGNITION; VIRTUAL REALITY;

BETTER PERFORMANCE; CLUSTERING; GEOMETRIC STRUCTURE; HASHING ALGORITHMS; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBOR SEARCH; PRECISION AND RECALL; RANDOM PROJECTIONS;

IMAGE RETRIEVAL;

EID: 84904624966     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCYB.2013.2283497     Document Type: Article

References (54)

1. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
2. L. Arge, M. Berg, H. Haverkort, and K. Yi, "The priority R-tree: A practically efficient and worst-case optimal R-tree," in Proc. SIGMOD, 2004, pp. 347-358.
3. B. Kullis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in Proc. Neur. Inf. Process. Syst., 2010, pp. 1042-1050.
4. J. Bentley "Multidimensional binary search trees used for associative searching," Commun. ACM, vol. 18, no. 9, pp. 509-517, 1975.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is nearest neighbor meaningful?," in Proc. ICDT, 1999, pp. 217-235.
6. J. Brandt, "Transform coding for fast approximate nearest neighbor search in high dimensions," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2010, pp. 1815-1822.
7. D. Cai, "Spectral regression: A regression framework for efficient regularized subspace learning," Ph.D. thesis, Dept. Comput. Sci, Univ. Illinois at Urbana-Champaign, Champaign, IL, USA, May 2009.
8. M. Charikar, "Similarity estimation techniques from rounding algorithms," in Proc. STOC, 2002, pp. 380-388. (Pubitemid 35009398)
9. A. Dasgupta, R. Kumar, and T. Sarls, "Fast locality-sensitive hashing," in Proc. IEEE Int. Conf. Knowl. Discovery Data Min., 2011, pp. 1073-1081.
10. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Locality-sensitive hashing scheme based on p-stable distributions," in Proc. Symp. Comput. Geometry, 2004, pp. 253-262.
11. Y. Gao, B. Zheng, G. Chen, Q. Li, and X. Guo, "Continuous visible nearest neighbor query processing in spatial databases," VLDB J., vol. 20, no. 3, pp. 371-396, 2011.
12. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. Int. Conf. Very Large Data Bases, 1999, pp. 518-529.
13. Y. Gong, S. Kumar, V. Verma, and S. Lazebnik, "Angular quantizationbased binary codes for fast similarity search," in Proc. Adv. Neur. Inf. Process. Syst., 2012, pp. 1205-1213.
14. Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2011, pp. 817-824.
15. J. He, S.-F. Chang, R. Radhakrishnan, and C. Bauer, "Compact hashing with joint optimization of search accuracy and time," in Proc. CVPR, 2011, pp. 753-760.
16. J. He, S. Kumar, and S.-F. Chang, "On the difficulty of nearest neighbor search," in Proc. ICML, 2012, pp. 65-72.
17. J. He, W. Liu, and S.-F. Chang, "Scalable similarity search with optimized kernel hashing," in Proc. IEEE Int. Conf. Knowl. Discovery Data Min., 2010, pp. 1129-1138.
18. H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearest neighbor search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 1, pp. 117-128, Jan. 2011.
19. J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian, "Super-bit locality-sensitive hashing," in Proc. NIPS, 2012, pp. 108-116.
20. Q. Jiang and M. Sun, "Semi-supervised simhash for efficient document similarity search," in Proc. 49th Annu. Meeting Assoc. Comput. Linguist.: Human Lang. Technol., 2011, pp. 93-101.
21. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," Contemp. Math., vol. 26, pp. 189-206, 1984.
22. A. Joly and O. Buisson, "A posteriori multi-probe locality sensitive hashing," in Proc. ACM Multimedia, 2008, pp. 209-218.
23. A. Joly and O. Buisson, "Random maximum margin hashing," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2011, pp. 873-880.
24. M. R. Kolahdouzan and C. Shahabi, "Voronoi-based k nearest neighbor search for spatial network databases," in Proc. Int. Conf. Very Large Data Bases, 2004, pp. 840-851.
25. W. Kong and W.-J. Li, "Isotropic hashing," in Proc. NIPS, 2012, pp. 1655-1663.
26. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, "Fast nearest neighbor search in medical image databases," in Proc. Int. Conf. Very Large Data Bases, 1996, pp. 215-226.
27. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing for scalable image search," in Proc. IEEE Int. Conf. Comput. Vision, 2009, pp. 2130-2137.
28. P. Li, A. B. Owen, and C.-H. Zhang, "One permutation hashing," in Proc. NIPS, 2012, pp. 3122-3130.
29. P. Li, A. Shrivastava, J. Moore, and C. Konig, "Hashing algorithms for large-scale learning," in Proc. Neur. Inf. Process. Syst., 2011, pp. 2672-2680.
30. Y. Lin, R. Jin, D. Cai, and X. He, "Random projection with filtering for nearly duplicate search," in Proc. AAAI, 2012, pp. 641-647.
31. Y. Lin, R. Jin, D. Cai, S. Yan, and X. Li, "Compressed hashing," in Proc. CVPR, 2013, pp. 446-451.
32. W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang, "Supervised hashing with kernels," in Proc. CVPR, 2012, pp. 2074-2081.
33. W. Liu, J. Wang, S. Kumar, and S.-F. Chang, "Hashing with graphs," in Proc. Int. Conf. Mach. Learn., 2011, pp. 1-8.
34. W. Liu, J. Wang, Y. Mu, S. Kumar, and S.-F. Chang, "Compact hyperplane hashing with bilinear functions," in Proc. ICML, 2012, pp. 17-24.
35. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multi-probe LSH: Efficient indexing for high-dimensional similarity search," in Proc. Int. Conf. Very Large Data Bases, 2007, pp. 950-961.
36. Y. Mu, J. Shen, and S. Yan, "Weakly-supervised hashing in kernel space," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2010, pp. 3344-3351.
37. M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binary codes," in Proc. Int. Conf. Mach. Learn., 2011, pp. 353-360.
38. R. Panigrahy, "Entropy based nearest neighbor search in high dimensions," in Proc. SODA, 2006, pp. 1186-1195. (Pubitemid 43275346)
39. L. Paulevé, H. Jégou, and L. Amsaleg, "Locality sensitive hashing: A comparison of hash function types and querying mechanisms," Pattern Recognit. Lett., vol. 31, no. 11, pp. 1348-1358, 2010.
40. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," in Proc. Neur. Inf. Process. Syst., 2009, pp. 1509-1517.
41. R. Salakhutdinov and G. E. Hinton, "Semantic hashing," Int. J. Approx. Reason., vol. 50, no. 7, pp. 969-978, 2009.
42. J. Wang, O. Kumar, and S.-F. Chang, "Semi-supervised hashing for scalable image retrieval," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2010, pp. 3424-3431.
43. J. Wang, S. Kumar, and S.-F. Chang, "Sequential projection learning for hashing with compact codes," in Proc. Int. Conf. Mach. Learn., 2010, pp. 1127-1134.
44. X.-J. Wang, L. Zhang, F. Jing, and W.-Y. Ma, "AnnoSearch: Image auto-annotation by search," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., 2006, pp. 1483-1490. (Pubitemid 44931495)
45. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Proc. Neur. Inf. Process. Syst., 2008, pp. 1753-1760.
46. C. Wu, J. Zhu, D. Cai, C. Chen, and J. Bu, "Semi-supervised nonlinear hashing using bootstrap sequential projection learning," IEEE Trans. Knowl. Data Eng., vol. 25, no. 6, pp. 1380-1393, Jun. 2013.
47. B. Xu, J. Bu, Y. Lin, C. Chen, X. He, and D. Cai, "Harmonious hashing," in Proc. IJCAI, 2013, pp. 1820-1826.
48. H. Xu, J. Wang, Z. Li, G. Zeng, N. Yu, and S. Li, "Complementary hashing for approximate nearest neighbor search," in Proc. IEEE Int. Conf. Comput. Vision, 2011, pp. 1631-1638.
49. Z. Yu, D. Cai, and X. He, "Error-correcting output hashing in fast similarity search," in Proc. ICIMCS, 2010, pp. 7-10.
50. D. Zhang, J. Wang, D. Cai, and J. Lu, "Laplacian co-hashing of terms and documents," in Proc. ECIR, 2010, pp. 577-580.
51. D. Zhang, J. Wang, D. Cai, and J. Lu, "Self-taught hashing for fast similarity search," in Proc. SIGIR, 2010, pp. 18-25.
52. D. Zhang, G. Yang, Y. Hu, Z. Jin, D. Cai, and X. He, "A unified approximate nearest neighbor search scheme by combining data structure and hashing," in Proc. IJCAI, 2013, pp. 681-687.
53. Y. Zhen and D.-Y. Yeung, "Co-regularized hashing for multimodal data," in Proc. NIPS, 2012, pp. 1385-1393.
54. Y. Zhen and D.-Y. Yeung, "A probabilistic model for multimodal hash function learning," in Proc. KDD, 2012, pp. 940-948.