Nearest neighbors using compact sparse codes

31st International Conference on Machine Learning, ICML 2014

Volumn 3, Issue , 2014, Pages 2746-2754

  Cherian, Anoop ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; LEARNING SYSTEMS;

APPROXIMATE NEAREST NEIGHBORS (ANN); DICTIONARY LEARNING; FAST RETRIEVALS; INVERTED FILES; NEAR- DUPLICATES; NEAREST NEIGHBORS; RETRIEVAL ACCURACY; SPARSE CODING;

CODES (SYMBOLS);

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

References (44)

1. Aharon, M., Elad, M., and Bruckstein, A. K-SVD: An algorithm for designing over complete dictionaries for sparse representation. TSP, 54(11):4311-4322, 2006.
2. Arora, S., Ge, R., and Moitra, A. New algorithms for learning incoherent and over complete dictionaries. arXiv preprint arXiv:1308.6273, 2013.
3. Babenko, A. and Lempitsky, V. The inverted multi-index. In CVPR, 2012.
4. Benedetto, J. J. and Kolesar, J. D. Geometric properties of grassmannian frames for r 2 and r 3. Journal on Advances in Signal Processing, 2006, 2006.
5. Beyer, K., Goldstein, J., Ramakrishnan, R., and Shaft, U. When is nearest neighbor meaningful? Database Theory, pp. 217-235, 1999.
6. Bloom, B. H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7): 422-426, 1970.
7. Boix, X., Roig, G., Leistner, C., and Van Gool, L. Nested sparse quantization for efficient feature coding. In ECCV, pp. 744-758. Springer, 2012.
8. Broder, A. Z. On the resemblance and containment of documents. In Compression and Complexity of Sequences. IEEE, 1997.
9. Cheng, H., Liu, Z., Hou, L., and Yang, J. Sparsity induced similarity measure and its applications. In TCSVT, 2012.
10. Cherian, A., Morellas, V., and Papanikolopoulos, N. Robust sparse hashing. In ICIP. IEEE, 2012.
11. Chum, O. and Matas, J. Large-scale discovery of spatially related images. PAMI, 32(2):371-377, 2010.
12. Chum, O., Philbin, J., Isard, M., and Zisserman, A. Scalable near identical image and shot detection. In CIVR. ACM, 2007.
13. Chum, O., Philbin, J., and Zisserman, A. Near duplicate image detection: Min-Hash and TF-IDF weighting. In BMVC, 2008.
14. Efron, B., Hastie, T., Johnstone, I., and Tibshirani, R. Least angle regression. Annals of Statistics, 32(2):407-451, 2004.
15. Fergus, R., Weiss, Y., and Torralba, A. Semi-supervised learning in gigantic image collections. In NIPS, 2009.
16. Gong, Y. and Lazebnik, S. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011.
17. Gordo, A. and Perronnin, F. Asymmetric distances for binary embeddings. In CVPR, 2011.
18. Gromov, M. Monotonicity of the volume of intersection of balls. Geometrical Aspects of Functional Analysis, pp. 1-4, 1987.
19. Indyk, P. and Motwani, R. Approximate nearest neighbors: towards removing the curse of dimensionality. Theory of Computing, pp. 604-613, 1998.
20. Jaccard, P. Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Socit vaudoise des Sciences Naturelles, 37:547-579, 1901.
21. Jegou, H, Douze, M, and Schmid, C. Product quantization for nearest neighbor search. PAMI, 33(1): 117-128, 2011.
22. Jegou, H., Tavenard, R., Douze, M., and Amsaleg, L. Searching in one billion vectors: re-rank with source coding. In ICASSP, pp. 861-864, 2011.
23. Kim, D., Sra, S., and Dhillon, I. S. A non-monotonic method for large-scale non-negative least squares. Optimization Methods and Software, 2012.
24. Klenk, S. and Heidemann, G. A sparse coding based similarity measure. In DMIN, 2009.
25. Kulis, B. and Grauman, K. Kernelized locality-sensitive hashing for scalable image search. In CVPR, 2009.
26. Lin, T., Liu, S., and Zha, H. Incoherent dictionary learning for sparse representation. In ICPR, 2012.
27. Liu, W., Wang, J., Kumar, S., and Chang, S. Hashing with graphs. In ICML, 2011.
28. Liu, W., Wang, J., Ji, R., Jiang, Y., and Chang, S. Supervised hashing with kernels. In CVPR, 2012.
29. Mairal, J., Bach, F., Ponce, J., and Sapiro, G. Online learning for matrix factorization and sparse coding. JMLR, 11:19-60, 2010.
30. Nister, D. and Stewenius, H. Scalable recognition with a vocabulary tree. In CVPR, 2006.
31. Norouzi, M. and Fleet, D. J. Cartesian k-means. In CVPR, 2013.
32. Norouzi, Mohammad and Blei, David M. Minimal loss hashing for compact binary codes. In ICML, 2011.
33. Raginsky, M. and Lazebnik, S. Locality-sensitive binary codes from shift-invariant kernels. In NIPS, 2009.
34. Ramirez, I., Sprechmann, P., and Sapiro, G. Classification and clustering via dictionary learning with structured incoherence and shared features. In CVPR, 2010.
35. Strecha, C., Bronstein, A., Bronstein, M., and Fua, P. LDA Hash: Improved matching with smaller descriptors. PAMI, 34(1):66-78, 2012.
36. Tropp, J. and Gilbert, A. Signal recovery from random measurements via orthogonal matching pursuit. TIT, 53 (12):4655-4666, 2007.
37. Tuytelaars, T. and Schmid, C. Vector quantizing feature space with a regular lattice. In ICCV, 2007.
38. Wang, J., Yang, J., Yu, K., Lv, F., Huang, T. and Gong, Y. Locality-constrained linear coding for image classification. In CVPR, 2010.
39. Weiss, Y., Torralba, A., and Fergus, R. Spectral hashing. In NIPS, 2009.
40. Winder, S., Hua, G., and Brown, M. Picking the best daisy. In CVPR, 2009.
41. Yaghoobi, M., Daudet, L., and Davies, M. Structured and incoherent parametric dictionary design. In ICASSP, 2010.
42. Yang, J., Yu, K., Gong, Y., and Huang, T. Linear spatial pyramid matching using sparse coding for image classification. In CVPR. IEEE, 2009.
43. Zepeda, J., Kijak, E., and Guillemot, C. Approximate nearest neighbors using sparse representations. In ICASSP, 2010.
44. Zhu, X., Huang, Z., Cheng, H., Cui, J., and Shen, H. Sparse hashing for fast multimedia search. ACM TIS, 31(2):9, 2013.