Sparse projections for high-dimensional binary codes

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

Volumn 07-12-June-2015, Issue , 2015, Pages 3332-3339

  Xia, Yan ^a,b   He, Kaiming ^b   Kohli, Pushmeet ^b   Sun, Jian ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BINS; CLUSTERING ALGORITHMS; COMPUTER VISION; IMAGE CLASSIFICATION; NEAREST NEIGHBOR SEARCH; PATTERN RECOGNITION;

BINARY ENCODINGS; COMPUTATIONAL COSTS; EFFECTIVE NUMBER OF PARAMETERS; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; NEAREST NEIGHBOUR SEARCH; PROJECTION MATRIX; PROJECTION OPERATOR;

CODES (SYMBOLS);

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

References (33)

1. P. Agrawal, R. Girshick, and J. Malik. Analyzing the performance of multilayer neural networks for object recognition. In ECCV, pages 329-344. Springer, 2014
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, pages 459-468, 2006
3. T. Blumensath and M. E. Davies. Iterative thresholding for sparse approximations. Journal of Fourier Analysis and Ap-plications, 14(5-6):629-654, 2008
4. S. S. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAM journal on scientific computing, pages 33-61, 1998
5. R. Courant. Variational methods for the solution of problems of equilibrium and vibrations. Bulletin of the American Mathematical Society, 49(1):1-23, 1943
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry, 2004
7. J. Donahue, Y. Jia, O. Vinyals, J. Hoffman, N. Zhang, E. Tzeng, and T. Darrell. Decaf: A deep convolutional activation feature for generic visual recognition. In ICML, 2014
8. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. Liblinear: A library for large linear classification. JMLR, 2008
9. T. Ge, K. He, Q. Ke, and J. Sun. Optimized product quantization for approximate nearest neighbor search. In CVPR, 2013
10. Y. Gong, S. Kumar, H. A. Rowley, and S. Lazebnik. Learning binary codes for high-dimensional data using bilinear projections. In CVPR, 2013
11. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011
12. J. C. Gower and G. B. Dijksterhuis. Procrustes problems, volume 3. Oxford University Press Oxford, 2004
13. K. He, X. Zhang, S. Ren, and J. Sun. Spatial pyramid pooling in deep convolutional networks for visual recognition. In ECCV, 2014
14. G. E. Hinton, N. Srivastava, A. Krizhevsky, I. Sutskever, and R. R. Salakhutdinov. Improving neural networks by preventing co-adaptation of feature detectors. arXiv:1207. 0580, 2012
15. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1990
16. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998
17. H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, 2008
18. H. Jegou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. TPAMI, 2011
19. H. Jegou, M. Douze, C. Schmid, and P. Perez. Aggregating local descriptors into a compact image representation. In CVPR, 2010
20. A. Krizhevsky, I. Sutskever, and G. Hinton. Imagenet classification with deep convolutional neural networks. In NIPS, 2012
21. B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, 2009
22. K. Lange, D. R. Hunter, and I. Yang. Optimization transfer using surrogate objective functions. Journal of computa-tional and graphical statistics, 2000
23. H. Lee, A. Battle, R. Raina, and A. Ng. Efficient sparse coding algorithms. In NIPS, 2006
24. D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60:91-110, 2004
25. A. Oliva and A. Torralba. Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV, 2001
26. F. Perronnin and C. Dance. Fisher kernels on visual vocabularies for image categorization. In CVPR, 2007
27. O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, et al. Imagenet large scale visual recognition challenge. arXiv:1409. 0575, 2014
28. J. Sánchez and F. Perronnin. High-dimensional signature compression for large-scale image classification. In CVPR, 2011
29. P. Schönemann. A generalized solution of the orthogonal procrustes problem. Psychometrika, 31(1):1-10, 1966
30. Y. Wang, J. Yang, W. Yin, and Y. Zhang. A new alternating minimization algorithm for total variation image reconstruction. SIAM Journal on Imaging Sciences, 2008
31. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753-1760, 2008
32. F. X. Yu, S. Kumar, Y. Gong, and S.-F. Chang. Circulant binary embedding. In ICML, 2014
33. M. D. Zeiler and R. Fergus. Visualizing and understanding convolutional neural networks. In ECCV, 2014.