Batch-Orthogonal Locality-Sensitive Hashing for Angular Similarity

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 36, Issue 10, 2014, Pages 1963-1974

  Ji, Jianqiu ^a   Yan, Shuicheng ^c   Li, Jianmin ^a   Gao, Guangyu ^b   Tian, Qi ^d   Zhang, Bo ^a  

^a TSINGHUA UNIVERSITY   (China)

^b BEIJING INSTITUTE OF TECHNOLOGY   (China)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d University of Texas at San Antonio   (United States)

Author keywords

angular similarity; approximate nearest neighbor search; locality sensitive hashing; Sign random projection

Indexed keywords

ESTIMATION; IMAGE RETRIEVAL; MEAN SQUARE ERROR;

ANGULAR SIMILARITY; APPROXIMATE NEAREST NEIGHBORS (ANN); ESTIMATION VARIANCE; HASHING METHOD; LOCALITY SENSITIVE HASHING; MEAN SQUARED ERROR; RANDOM PROJECTIONS; UNBIASED ESTIMATES;

NEAREST NEIGHBOR SEARCH;

EID: 84933037463     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2014.2315806     Document Type: Article

References (50)

1. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. 25th Int. Conf. Very Large Data Bases, 1999, pp. 518-529.
2. P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. ACM Symp. Theory Comput., 1998, pp. 604-613.
3. D. Ravichandran, P. Pantel, and E. H. Hovy, "Randomized algorithms and NLP: Using locality sensitive hash functions for high speed noun clustering," in Proc. 43rd Annu. Meet. Assoc. Comput. Linguistics, 2005, pp. 622-629.
4. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig, "Syntactic clustering of the web," Comput. Netw., vol. 29, nos. 8-13, pp. 1157-1166, 1997.
5. O. Chum, J. Philbin, and A. Zisserman, "Near duplicate image detection: min-hash and TF-IDF weighting," in Proc. Brit. Mach. Vis. Conf., 2008, vol. 810, pp. 812-815.
6. A. Broder, "On the resemblance and containment of documents," in Proc. Compression Complexity of Sequences, 1997, pp. 21-29.
7. G. S. Manku, A. Jain, and A. D. Sarma, "Detecting near-duplicates for web crawling," in Proc. 16th Int. Conf. World Wide Web, 2007, pp. 141-150.
8. O. Chum, M. Perdoch, and J. Matas, "Geometric min-hashing: Finding a (thick) needle in a haystack," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2009, pp. 17-24.
9. A. Torralba, R. Fergus, and W. T. Freeman, "80 million tiny images: A large data set for nonparametric object and scene recognition," IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 11, pp. 1958-1970, Nov. 2008.
10. 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.
11. P. Li, A. Shrivastava, J. L. Moore, and A. C. König, "Hashing algorithms for large-scale learning," in Proc. Adv. Neural Inf. Process. Syst., 2011, pp. 2672-2680.
12. M. Charikar, "Similarity estimation techniques from rounding algorithms," in Proc. ACM Symp. Theory Comput., 2002, pp. 380-388.
13. D. G. Lowe, "Distinctive image features from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91-110, 2004.
14. P. Jain, B. Kulis, and K. Grauman, "Fast image search for learned metrics," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2008, pp. 1-8.
15. P. Jain, S. Vijayanarasimhan, and K. Grauman, "Hashing hyperplane queries to near points with applications to large-scale active learning," in Proc. Adv. Neural Inf. Process. Syst., 2010, pp. 928-936.
16. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing for scalable image search," in Proc. IEEE Int. Conf. Comput. Vis., 2009, pp. 2130-2137.
17. J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian, "Super-bit locality-sensitive hashing," in Proc. Adv. Neural Inf. Process. Syst., 2012, pp. 108-116.
18. T. Dean, M. A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik, "Fast, accurate detection of 100,000 object classes on a single machine," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2013.
19. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Localitysensitive hashing scheme based on p-stable distributions," in Proc. Symp. Comput. Geom., 2004, pp. 253-262.
20. S. Schleimer, D. S. Wilkerson, and A. Aiken, "Winnowing: Local algorithms for document fingerprinting," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2003, pp. 76-85.
21. Y. Ke, R. Sukthankar, and L. Huston, "Efficient near-duplicate detection and sub-image retrieval," in Proc. ACM Multimedia, 2004, pp. 869-876.
22. Y.-H. Kuo, K.-T. Chen, C.-H. Chiang, and W. H. Hsu, "Query expansion for hash-based image object retrieval," in Proc. ACM Multimedia, 2009, pp. 65-74.
23. B. Matei, Y. Shan, H. S. Sawhney, Y. Tan, R. Kumar, D. F. Huber, and M. Hebert, "Rapid object indexing using locality sensitive hashing and joint 3d-signature space estimation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 7, pp. 1111-1126, Jul. 2006.
24. B. Georgescu, I. Shimshoni, and P. Meer, "Mean shift based clustering in high dimensions: A texture classification example," in Proc. IEEE Int. Conf. Comput. Vis., 2003, pp. 456-463.
25. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," in Proc. Annu. IEEE Symp. Found. Comput. Sci., 2006, pp. 459-468.
26. P. Li and A. C. König, "b-bit minwise hashing," in Proc. Int. World Wide Web Conf., 2010, pp. 671-680.
27. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," in Proc. Adv. Neural Inf. Process. Syst., 2009, pp. 1509-1517.
28. P. Li, T. Hastie, and K. W. Church, "Very sparse random projections," in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2006, pp. 287-296.
29. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Proc. Adv. Neural Inf. Process. Syst., 2008, pp. 1753-1760.
30. W. Liu, J. Wang, S. Kumar, and S.-F. Chang, "Hashing with graphs," in Proc. Int. Conf. Mach. Learning, 2011, pp. 1-8.
31. Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2011, pp. 817-824.
32. H. Jégou, T. Furon, and J.-J. Fuchs, "Anti-sparse coding for approximate nearest neighbor search," in Proc. Int. Conf. Acoust., Speech, Signal Process., 2012, pp. 2029-2032.
33. K. He, F. Wen, and J. Sun, "K-means hashing: An affinity-preserving quantization method for learning binary compact codes," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2013, pp. 2938-2945.
34. Y. Mu, J. Shen, and S. Yan, "Weakly-supervised hashing in kernel space," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2010, pp. 3344-3351.
35. J. Wang, S. Kumar, and S.-F. Chang, "Sequential projection learning for hashing with compact codes," in Proc. Int. Conf. Mach. Learning, 2010, pp. 1127-1134.
36. J. Wang, S. Kumar, and S.-F. Chang, "Semi-supervised hashing for large-scale search," in Proc. IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 12, pp. 2393-2406, Dec. 2012.
37. W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang, "Supervised hashing with kernels," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2012, pp. 2074-2081.
38. J. Wang, O. Kumar, and S.-F. Chang, "Semi-supervised hashing for scalable image retrieval," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2010, pp. 3424-3431.
39. M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binary codes," in Proc. Int. Conf. Mach. Learning, 2011, pp. 353-360.
40. C. Strecha, A. A. Bronstein, M. M. Bronstein, and P. Fua, "LDAhash: Improved matching with smaller descriptors," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 1, pp. 66-78, Jan. 2012.
41. R. Salakhutdinov and G. E. Hinton, "Semantic hashing," Int. J. Approximate Reasoning, vol. 50, no. 7, pp. 969-978, 2009.
42. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobe LSH: efficient indexing for high-dimensional similarity search," in Proc. 33rd Int. Conf. Very Large Data Bases, 2007, pp. 950-961.
43. V. Satuluri and S. Parthasarathy, "Bayesian locality sensitive hashing for fast similarity search," in Proc. VLDB Endowment, vol. 5, no. 5, pp. 430-441, 2012.
44. M. Norouzi, A. Punjani, and D. J. Fleet, "Fast search in hamming space with multi-index hashing," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2012, pp. 3108-3115.
45. H. Jégou, M. Douze, and C. Schmid, "Hamming embedding and weak geometric consistency for large scale image search," in Proc. 10th Eur. Conf. Comput. Vis.: Part I, 2008, pp. 304-317.
46. M. X. Goemans and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, 1995.
47. B. Kulis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in Proc. Adv. Neural Inf. Process. Syst., 2009, pp. 1042-1050.
48. Y. Chikuse, Statistics on Special Manifolds. New York, NY, USA: Springer, Feb. 2003.
49. S. A. J. Winder and M. Brown, "Learning local image descriptors," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2007, pp. 1-8.
50. H. Jégou, M. Douze, C. Schmid, and P. Pérez, "Aggregating local descriptors into a compact image representation," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2010, pp. 3304-3311.