Discrete graph hashing

Advances in Neural Information Processing Systems

Volumn 4, Issue January, 2014, Pages 3419-3427

  Liu, Wei ^a   Mu, Cun ^b   Kumar, Sanjiv ^c   Chang, Shih Fu ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Columbia University ^*  (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; DIGITAL STORAGE; GRAPHIC METHODS; HASH FUNCTIONS; INFORMATION SCIENCE; NEAREST NEIGHBOR SEARCH; OPTIMIZATION;

DEGRADED PERFORMANCE; DISCRETE CONSTRAINTS; DISCRETE OPTIMIZATION; FAST NEAREST NEIGHBOR SEARCH; LOCAL NEIGHBORHOODS; MAXIMIZATION ALGORITHM; NEIGHBORHOOD STRUCTURE; OPTIMIZATION PROCEDURES;

CODES (SYMBOLS);

EID: 84927125924     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. T. Ahonen, A. Hadid, and M. Pietikainen. Face description with local binary patterns: Application to face recognition. TPAMI, 28(12): 2037-2041, 2006.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM, 51(1): 117-122, 2008.
3. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proc. STOC, 1998.
4. M. Charikar. Similarity estimation techniques from rounding algorithms. In Proc. STOC, 2002.
5. J. de Leeuw. Applications of convex analysis to multidimensinal scaling. Recent Developments in Statistics, pages 133-146, 1977.
6. 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. CVPR, 2013.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B, 39(1): 1-38, 1977.
8. C.-S. Foo, C. B. Do, and A. Y. Ng. A majorization-minimization algorithm for (multiple) hyperparameter learning. In Proc. ICML, 2009.
9. Y. Gong, S. Lazebnik, A. Gordo, and F. Perronnin. Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. TPAMI, 35(12): 2916-2929, 2013.
10. Y. Gong, L. Wang, R. Guo, and S. Lazebnik. Multi-scale orderless pooling of deep convolutional activation features. In Proc. ECCV, 2014.
11. J. Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4): 798-859, 2001.
12. W. J. Heiser. Convergent computation by iterative majorization: theory and applications in multidimensional data analysis. Recent advances in descriptive multivariate analysis, pages 157-189, 1995.
13. T. Jebara and A. Choromanska. Majorization for crfs and latent likelihoods. In NIPS 25, 2012.
14. W. Kong and W.-J. Li. Isotropic hashing. In NIPS 25, 2012.
15. A. Krizhevsky. Learning multiple layers of features from tiny images. Technical report, 2009.
16. B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS 22, 2009.
17. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing. TPAMI, 34(6): 1092-1104, 2012.
18. P. Li and A. C. Konig. Theory and applications of b-bit minwise hashing. Communications of the ACM, 54(8): 101-109, 2011.
19. P. Li, A. Shrivastava, J. Moore, and A. C. Konig. Hashing algorithms for large-scale learning. In NIPS 24, 2011.
20. X. Li, G. Lin, C. Shen, A. van den Hengel, and A. R. Dick. Learning hash functions using column generation. In Proc. ICML, 2013.
21. W. Liu, J. He, and S.-F. Chang. Large graph construction for scalable semi-supervised learning. In Proc. ICML, 2010.
22. W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In Proc. CVPR, 2012.
23. W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs. In Proc. ICML, 2011.
24. W. Liu, J. Wang, Y. Mu, S. Kumar, and S.-F. Chang. Compact hyperplane hashing with bilinear functions. In Proc. ICML, 2012.
25. Y. Mu, J. Shen, and S. Yan. Weakly-supervised hashing in kernel space. In Proc. CVPR, 2010.
26. B. Neyshabur, P. Yadollahpour, Y. Makarychev, R. Salakhutdinov, and N. Srebro. The power of asymmetry in binary hashing. In NIPS 26, 2013.
27. M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In Proc. ICML, 2011.
28. M. Norouzi, D. J. Fleet, and R. Salakhudinov. Hamming distance metric learning. In NIPS 25, 2012.
29. A. Oliva and A. Torralba. Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV, 42(3): 145-175, 2001.
30. R. Salakhutdinov and G. Hinton. Semantic hashing. International Journal of Approximate Reasoning, 50(7): 969-978, 2009.
31. G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In Proc. ICCV, 2003.
32. F. Shen, C. Shen, Q. Shi, A. van den Hengel, and Z. Tang. Inductive hashing on manifolds. In Proc. CVPR, 2013.
33. J. Shi and J. Malik. Normalized cuts and image segmentation. TPAMI, 22(8): 888-905, 2000.
34. Q. Shi, J. Petterson, G. Dror, J. Langford, A. Smola, and S. V. N. Vishwanathan. Hash kernels for structured data. JMLR, 10: 2615-2637, 2009.
35. A. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: a large dataset for non-parametric object and scene recognition. TPAMI, 30(11): 1958-1970, 2008.
36. K. Q. Weinberger, A. Dasgupta, J. Langford, A. J. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In Proc. ICML, 2009.
37. Y. Weiss, R. Fergus, and A. Torralba. Multidimensional spectral hashing. In Proc. ECCV, 2012.
38. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS 21, 2008.
39. L. Wolf, T. Hassner, and I. Maoz. Face recognition in unconstrained videos with matched background similarity. In Proc. CVPR, 2011.
40. J. Xiao, J. Hays, K. A. Ehinger, A. Oliva, and A. Torralba. Sun database: Large-scale scene recognition from abbey to zoo. In Proc. CVPR, 2010.