Asymmetric sparse kernel approximations for large-scale visual search

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

Volumn , Issue , 2014, Pages 2115-2122

  Davis, Damek ^a   Balzer, Jonathan ^a   Soatto, Stefano ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

high dimensional search; nearest neighbors; sparse kernel approximations

Indexed keywords

EMBEDDINGS;

COMPRESSION TECHNIQUES; HIGH-DIMENSIONAL; KERNEL PCA; KERNEL REPRESENTATION; NEAREST NEIGHBORS; SPARSE KERNELS; VISUAL SEARCH;

PATTERN RECOGNITION;

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

References (24)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 459-468, 2006.
2. N. Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68(3):337-404, 1950.
3. A. Bourrier, F. Perronnin, R. Gribonval, P. Pérez, and H. Jégou. Nearest neighbor search for arbitrary kernels with explicit embeddings. Research Report RR-8040, INRIA, Aug. 2012.
4. A. Coates and A. Y. Ng. The importance of encoding versus training with sparse coding and vector quantization. In International Conference on Machine Learning (ICML), volume 8, page 10, 2011.
5. T. Cover and J. Thomas. Elements of Information Theory. Wiley-Interscience, 2012.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In ACM Annual Symposium on Computational Geometry, pages 253-262, 2004.
7. J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. FeiFei. Imagenet: A large-scale hierarchical image database. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 248-255, 2009.
8. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In ACM Symposium on Theory of Computing, pages 604-613, 1998.
9. H. Jégou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(1):117-128, 2011.
10. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26(1):189-206, 1984.
11. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In IEEE International Conference on Computer Vision (ICCV), pages 2130-2137, 2009.
12. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM Journal on Computing, 30(2):457-474, 2000.
13. D. G. Lowe. Object recognition from local scale-invariant features. In IEEE International Conference on Computer Vision (ICCV), volume 2, pages 1150-1157, 1999.
14. J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11:19-60, 2010.
15. Y. Mu, J. Wright, and S.-F. Chang. Accelerated large scale optimization by concomitant hashing. In European Conference on Computer Vision (ECCV), pages 414-427, 2012.
16. A. Oliva and A. Torralba. Modeling the shape of the scene: A holistic representation of the spatial envelope. International Journal of Computer Vision, 42(3):145-175, 2001.
17. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In IEEE Conference on Signals, Systems and Computers (ASILOMAR), pages 40-44, 1993.
18. J.-R. Sack and J. Urrutia. Handbook of Computational Geometry. North Holland, 1999.
19. R. Salakhutdinov and G. Hinton. Semantic hashing. International Journal of Approximate Reasoning, 50(7):969-978, 2009.
20. B. Schölkopf, A. Smola, and K.-R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
21. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. In Conference on Communication and Computation, pages 368-377, 1999.
22. A. Torralba, R. Fergus, and W. T. Freeman. 80 million tiny images: A large data set for nonparametric object and scene recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(11):1958-1970, 2008.
23. A. Vedaldi and A. Zisserman. Sparse kernel approximations for efficient classification and detection. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 2320-2327, 2012.
24. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Advances in Neural Information Processing Systems (NIPS), 2008.