Multilinear hyperplane hashing

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 2016-December, Issue , 2016, Pages 5119-5127

  Liu, Xianglong ^a   Fan, Xinjie ^a   Deng, Cheng ^b   Li, Zhujin ^a   Su, Hao ^c   Tao, Dacheng ^d  

^a BEIHANG UNIVERSITY   (China)

^b XIDIAN UNIVERSITY   (China)

^c Stanford University   (United States)

^d UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; GEOMETRY; HASH FUNCTIONS; PATTERN RECOGNITION;

ACTIVE LEARNING; COLLISION PROBABILITY; FAST NEAREST NEIGHBOR SEARCH; FAST SEARCH; HASHING METHOD; LEARNING FRAMEWORKS; LINEAR PROJECTIONS; SEARCH PERFORMANCE;

NEAREST NEIGHBOR SEARCH;

EID: 84984899124     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2016.553     Document Type: Conference Paper

References (32)

1. M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, pages 380-388, 2002.
2. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In ACM SOCG, pages 253-262, 2004.
3. T. Dean, M. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik. Fast, accurate detection of 100,000 object classes on a single machine. In IEEE CVPR, pages 1-8, 2013.
4. Y. Gong, S. Kumar, V. Verma, and S. Lazebnik. Angular quantization-based binary codes for fast similarity search. In NIPS, pages 1196-1204, 2012.
5. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In IEEE CVPR, pages 817-824, 2011.
6. J. He, J. Feng, X. Liu, T. Cheng, T.-H. Lin, H. Chung, and S.-F. Chang. Mobile product search with bag of hash bits and boundary reranking. In IEEE CVPR, pages 3005-3012, 2012.
7. J. He, S. Kumar, and S.-F. Chang. On the difficulty of nearest neighbor search. In ICML, pages 1-8, 2012.
8. P. Jain, S. Vijayanarasimhan, and K. Grauman. Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning. In NIPS, pages 928-936. 2010.
9. W. Kong and W.-J. Li. Double-bit quantization for hashing. In AAAI, pages 2604-2623, 2012.
10. A. Krizhevsky. Learning Multiple Layers of Features from Tiny Images. Technical report, 2009.
11. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradientbased learning applied to document recognition. Proceedings of the IEEE, 86(11):2278-2324, Nov 1998.
12. X. Li, G. Lin, C. Shen, A. van den Hengel, and A. Dick. Learning hash functions using column generation. In ICML, pages 1-8, 2013.
13. W. Liu, C. Mu, S. Kumar, and S.-F. Chang. Discrete graph hashing. In NIPS, pages 3419-3427, 2014.
14. W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs. In ICML, pages 1-8, 2011.
15. W. Liu, J. Wang, Y. Mu, S. Kumar, and S.-F. Chang. Compact hyperplane hashing with bilinear functions. In ICML, pages 1-8, 2012.
16. X. Liu, J. He, C. Deng, and B. Lang. Collaborative hashing. In IEEE CVPR, pages 2147-2154, 2014.
17. X. Liu, J. He, and B. Lang. Reciprocal Hash Tables for Nearest Neighbor Search. In AAAI, pages 626-632, 2013.
18. X. Liu, L. Huang, C. Deng, J. Lu, and B. Lang. Multi-view complementary hash tables for nearest neighbor search. In IEEE ICCV, pages 1107-1115, 2015.
19. X. Liu, Y. Mu, B. Lang, and S.-F. Chang. Compact hashing for mixed image-keyword query over multi-label images. In ACM ICMR, page 18, 2012.
20. S. Mehrotra. On the implementation of a primal-dual interior point method. 1992.
21. Y. Mu, G. Hua, W. Fan, and S.-F. Chang. Hash-svm: Scalable kernel machines for large-scale visual classification. In IEEE CVPR, pages 979-986, 2014.
22. Y. Mu, J. Wright, and S.-F. Chang. Accelerated large scale optimization by concomitant hashing. In ECCV, pages 414-427, 2012.
23. Y. Mu and S. Yan. Non-metric locality-sensitive hashing. In M. Fox and D. Poole, editors, AAAI, pages 539-544, 2010.
24. B. Neyshabur, N. Srebro, R. Salakhutdinov, Y. Makarychev, and P. Yadollahpour. The power of asymmetry in binary hashing. In NIPS, pages 2823-2831, 2013.
25. M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, pages 353-360, 2011.
26. F. Shen, C. Shen, W. Liu, and H. Tao Shen. Supervised discrete hashing. In IEEE CVPR, pages 37-45, 2015.
27. A. Shrivastava and P. Li. Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips). In NIPS, pages 1-8, 2008.
28. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. J. Mach. Learn. Res., 2:45-66, Mar. 2002.
29. A. Torralba, R. Fergus, and W. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE TPAMI, 30(11):1958-1970, Nov 2008.
30. C. Xu, D. Tao, C. Xu, and Y. Rui. Large-margin weakly supervised dimensionality reduction. In ICML, pages 865-873, 2014.
31. F. X. Yu, S. Kumar, Y. Gong, and S.-F. Chang. Circulant binary embedding. In ICML, pages 1-8, 2014.
32. B. Zhao, F.Wang, and C. Zhang. Efficient maximum margin clustering via cutting plane algorithm. In SDM, pages 751-762, 2008.