Hash bit selection: A unified solution for selection problems in hashing

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

Volumn , Issue , 2013, Pages 1570-1577

  Liu, Xianglong ^a   He, Junfeng ^b,c   Lang, Bo ^a   Chang, Shih Fu ^b  

^a BEIHANG UNIVERSITY   (China)

^b Department of Earth and Environmental Sciences   (United States)

^c FACEBOOK   (United States)

Author keywords

hash bit selection; locality sensitive hashing; nearest neighbor search; normalized dominant set

Indexed keywords

APPLICATION SCENARIO; DOMINANT SET; HASH BIT SELECTION; LARGE SCALE EXPERIMENTS; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBOR SEARCH; REPLICATOR DYNAMICS; SELECTION FRAMEWORK;

ALGORITHMS; PATTERN RECOGNITION;

IMAGE RETRIEVAL;

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

References (21)

1. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time markov chains. In CONCUR, pages 146-161. Springer-Verlag, 1999.
2. T.-S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, and Y. Zheng. Nus-wide: a real-world web image database from national university of Singapore. In CIVR, 2009.
3. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG, 2004
4. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011.
5. J. He, S. Kumar, and S.-F. Chang. On the difficulty of nearest neighbor search. In ICML, 2012.
6. J. He, R. Radhakrishnan, S.-F. Chang, and C. Bauer. Compact hashing with joint optimization of search accuracy and time. In CVPR, 2011.
7. J. Heo, Y. Lee, J. He, S.-F. Chang, and S. Yoon. Spherical hashing. In CVPR, 2012.
8. H. Jegou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE TPAMI, 33(1): 117-128, 2011.
9. A. Joly and O. Buisson. Random Maximum Margin Hashing. In CVPR. IEEE, 2011.
10. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
11. Y. Lee, J. Heo, and S. Yoon. Quadra-embedding: Binary code embedding with low quantization error. In ACCV, 2012.
12. H. Liu and S. Yan. Robust graph mode seeking by graph shift. In ICML, 2010.
13. S. Liu, H. Liu, L. J. Latecki, S. Yan, C. Xu, and H. Lu. Size adaptive selection of most informative features. In AAAI, 2011.
14. W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs, in ICML, 2011.
15. Y. Mu, X. Chen, X. Liu, T.-S. Chua, and S. Yan. Multimedia semantics-aware query-adaptive hashing with bits reconfig-urability. IJMIR, pages 1-12, 2012.
16. M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, 2011.
17. M. Pavan and M. Pelillo. Dominant sets and pairwise clustering. IEEE TPAMI, 29(1): 167-172, 2007.
18. J. Song, Y. Yang, Z. Huang, H. Shen, and R. Hong. Multiple feature hashing for real-time large scale near-duplicate video retrieval, in ACM MM, 2011.
19. J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for scalable image retrieval. In CVPR, 2010.
20. J. Wang, S. Kumar, and S.-F. Chang. Sequential projection learning for hashing with compact codes. In ICML, 2010.
21. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2008.