Fast orthogonal projection based on kronecker product

Proceedings of the IEEE International Conference on Computer Vision

Volumn 2015 International Conference on Computer Vision, ICCV 2015, Issue , 2015, Pages 2929-2937

  Zhang, Xu ^a,b   Yu, Felix X ^b,c   Guo, Ruiqi ^c   Kumar, Sanjiv ^c   Wang, Shengjin ^a   Chang, Shi Fu ^b  

^a TSINGHUA UNIVERSITY   (China)

^b Columbia University ^*  (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER VISION; NEAREST NEIGHBOR SEARCH;

APPROXIMATE NEAREST NEIGHBORS (ANN); COMPUTER VISION APPLICATIONS; EFFICIENT LEARNING; HIGH DIMENSIONAL DATA; KRONECKER PRODUCT; ORTHOGONAL MATRIX; ORTHOGONAL PROJECTION; STRUCTURED MATRIXES;

MATRIX ALGEBRA;

EID: 84973865965     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2015.335     Document Type: Conference Paper

References (38)

1. N. Ailon and B. Chazelle. The fast johnson-lindenstrauss transform and approximate nearest neighbors. SIAM Journal on Computing, 39 (1): 302-322, 2009.
2. W. U. Bajwa, J. D. Haupt, G. M. Raz, S. J. Wright, and R. D. Nowak. Toeplitz-structured compressed sensing matrices. In IEEE/SP 14th Workshop on Statistical Signal Processing, 2007.
3. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In ACM Symposium on Theory of Computing, 2002.
4. Y. Cheng, F. X. Yu, R. Feris, S. Kumar, A. Choudhary, and S.-F. Chang. An exploration of parameter redundancy in deep networks with circulant projections. In ICCV, 2015.
5. A. Dasgupta, R. Kumar, and T. Sarlós. Fast locality-sensitive hashing. In SIGKDD, 2011.
6. 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 CVPR, 2013.
7. A. Gersho and R. M. Gray. Vector quantization and signal compression. Springer Science & Business Media, 1992.
8. Y. Gong, S. Kumar, H. A. Rowley, and S. Lazebnik. Learning binary codes for high-dimensional data using bilinear projections. In CVPR, 2013.
9. Y. Gong, S. Kumar, V. Verma, and S. Lazebnik. Angular quantization-based binary codes for fast similarity search. In Advances in Neural Information Processing Systems, pages 1196-1204, 2012.
10. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011.
11. J. Haupt, W. U. Bajwa, G. Raz, and R. Nowak. Toeplitz compressed sensing matrices with applications to sparse channel estimation. IEEE Transactions on Information Theory, 2010.
12. A. Hinrichs and J. Vybíral. Johnson-lindenstrauss lemma for circulant matrices. Random Structures & Algorithms, 39 (3): 391-398, 2011.
13. R. Hunger. Floating point operations in matrix-vector calculus. Munich University of Technology, Inst. for Circuit Theory and Signal Processing, 2005.
14. L. Jacques, J. N. Laska, P. T. Boufounos, and R. G. Baraniuk. Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors. IEEE Trans. Info. Theory, 2013.
15. H. Jégou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, 2008.
16. H. Jégou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE TPAMI, 2011.
17. H. Jégou, M. Douze, C. Schmid, and P. Pérez. Aggregating local descriptors into a compact image representation. In CVPR, 2010.
18. H. Jégou, T. Furon, and J. Fuchs. Anti-sparse coding for approximate nearest neighbor search. In ICASSP, 2012.
19. J. Ji, S. Yan, J. Li, G. Gao, Q. Tian, and B. Zhang. Batchorthogonal locality-sensitive hashing for angular similarity. IEEE TPAMI, 2014.
20. B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, 2009.
21. Q. Le, T. Sarlós, and A. Smola. Fastfood-approximating kernel expansions in loglinear time. In ICML, 2013.
22. P. Li, A. Shrivastava, J. Moore, and A. C. Konig. Hashing algorithms for large-scale learning. In NIPS, 2011.
23. W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In CVPR, 2012.
24. M. Norouzi, D. Fleet, and R. Salakhutdinov. Hamming distance metric learning. In NIPS, 2012.
25. M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, 2011.
26. M. Norouzi and D. J. Fleet. Cartesian k-means. In CVPR. IEEE, 2013.
27. M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In NIPS, 2009.
28. M. Rastegari, A. Farhadi, and D. Forsyth. Attribute discovery via predictable discriminative binary codes. In ECCV. 2012.
29. J. Sánchez and F. Perronnin. High-dimensional signature compression for large-scale image classification. In CVPR, 2011.
30. P. H. Schönemann. A generalized solution of the orthogonal procrustes problem. Psychometrika, 31 (1): 1-10, 1966.
31. C. Strecha, A. Bronstein, M. Bronstein, and P. Fua. Ldahash: Improved matching with smaller descriptors. IEEE TPAMI, 2012.
32. A. Torralba, R. Fergus, and Y. Weiss. Small codes and large image databases for recognition. In CVPR, 2008.
33. C. F. Van Loan. The ubiquitous kronecker product. Journal of Computational and Applied Mathematics, 123 (1): 85-100, 2000.
34. J. Wang, S. Kumar, and S.-F. Chang. Semi-supervised hashing for large-scale search. IEEE TPAMI, 2012.
35. J. Wang, J. Wang, J. Song, X.-S. Xu, H. T. Shen, and S. Li. Optimized cartesian k-means. IEEE TKDD, 27 (1): 180-192, Jan 2015.
36. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, 2008.
37. F. X. Yu, S. Kumar, Y. Gong, and S.-F. Chang. Circulant binary embedding. In ICML, 2014.
38. F. X. Yu, S. Kumar, H. Rowley, and S.-F. Chang. Compact nonlinear maps and circulant extensions. arXiv preprint arXiv: 1503. 03893, 2015.