Composite quantization for approximate nearest neighbor search

31st International Conference on Machine Learning, ICML 2014

Volumn 3, Issue , 2014, Pages 2421-2439

  Zhang, Ting ^a   Du, Chao ^b   Wang, Jingdong ^c  

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

^b TSINGHUA UNIVERSITY   (China)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; QUERY PROCESSING;

APPROXIMATE NEAREST NEIGHBOR SEARCH; BENCHMARK DATASETS; EXPERIMENTAL COMPARISON; NEAREST NEIGHBOR SEARCH; SHORT CODES; STATE-OF-THE-ART ALGORITHMS;

CODES (SYMBOLS);

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

References (35)

1. Arya, S. and Mount, D. M. Approximate nearest neighbor queries in fixed dimensions. In SODA, pp. 271-280, 1993.
2. Beygelzimer, A., Kakade, S., and Langford, J. Cover trees for nearest neighbor. In ICML, pp. 97-104, 2006.
3. Friedman, J. H., Bentley, J. L., and Finkel, R. A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3(3):209-226, 1977.
4. Gionis, A., Indyk, P., and Motwani, R. Similarity search in high dimensions via hashing. In VLDB, pp. 518-529, 1999.
5. Gong, Y. and Lazebnik, S. Iterative quantization: A pro- crustean approach to learning binary codes. In CVPR, pp. 817-824, 2011.
6. Gordo, A. and Perronnin, F. Asymmetric distances for binary embeddings. In CVPR, pp. 729-736, 2011.
7. Jain, P., Kulis, B., and Grauman, K. Fast image search for learned metrics. In CVPR, 2008.
8. Jegou, H., Douze, M., and Schmid, C. Hamming embedding and weak geometric consistency for large scale image search. In ECCV (1), pp. 304-317, 2008.
9. Jegou, H., Douze, M., Schmid, C., and Perez, P. Aggregating local descriptors into a compact image representation. In CVPR, pp. 3304-3311, 2010.
10. Jegou, H., Douze, M., and Schmid, C. Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell., 33(1): 117-128, 2011a.
11. Jegou, H., Tavenard, R., Douze, M., and Amsaleg, L. Searching in one billion vectors: Re-rank with source coding. In ICASSP, pp. 861-864, 2011b.
12. Jia, Y., Wang, J., Zeng, G., Zha, H., and Hua, Xian-Sheng. Optimizing kd-trees for scalable visual descriptor indexing. In CVPR, pp. 3392-3399, 2010.
13. Kong, W. and Li, W. Isotropic hashing. In NIPS, pp. 1655- 1663, 2012.
14. Kulis, B. and Darrells, T. Learning to hash with binary reconstructive embeddings. In NIPS, pp. 577-584, 2009.
15. Kulis, B. and Grauman, K. Kernelized locality-sensitive hashing for scalable image search. In ICCV, 2009.
16. LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P. Gradient- based learning applied to document recognition. In Intelligent Signal Processing, pp. 306-351. IEEE Press, 2001.
17. Liu, W., Wang, J., Kumar, S., and Chang, S. Hashing with graphs. In ICML, pp. 1-8, 2011.
18. Muja, M. and Lowe, D. G. Fast approximate nearest neighbors with automatic algorithm configuration. In VISS- APP(1), pp. 331-340, 2009.
19. Nister, D. and Stewenius, H. Scalable recognition with a vocabulary tree. In CVPR (2), pp. 2161-2168, 2006.
20. Norouzi, M. and Fleet, D. J. Minimal loss hashing for compact binary codes. In ICML, pp. 353-360, 2011.
21. Norouzi, M. and Fleet, D. J. Cartesian k-means. In CVPR, pp. 3017-3024, 2013.
22. Perronnin, F. and Dance, C. R. Fisher kernels on visual vocabularies for image categorization. In CVPR, 2007.
23. Raginsky, M. and Lazebnik, S. Locality sensitive binary codes from shift-invariant kernels. In NIPS, 2009.
24. Russell, B. C., Torralba, A., Murphy, K. P., and Freeman, W. T. Labelme: A database and web-based tool for image annotation. International Journal of Computer Vision, 77(1-3): 157-173, 2008.
25. Salakhutdinov, R. and Hinton, G. E. Semantic hashing. Int. J. Approx. Reasoning, 50(7):969-978, 2009.
26. Shakhnarovich, G., Darrell, T., and Indyk, P. Nearest- Neighbor Methods in Learning and Vision: Theory and Practice. The MIT press, 2006.
27. Silpa-Anan, C. and Hartley, R. Optimised kd-trees for fast image descriptor matching. In CVPR, 2008.
28. Wang, J. and Li, S. Query-driven iterated neighborhood graph search for large scale indexing. In ACM Multimedia, pp. 179-188, 2012.
29. Wang, J., Wang, J., Yu, N., and Li, S. Order preserving hashing for approximate nearest neighbor search. In ACM Multimedia, pp. 133-142, 2013a.
30. Wang, J., Wang, J., Zeng, G., Gan, R., Li, S., and Guo, B. Fast neighborhood graph search using cartesian concatenation. CoRR, abs/1312.3062, 2013b.
31. Wang, J., Wang, J., Zeng, G., Gan, R., Li, S., and Guo, B. Fast neighborhood graph search using cartesian concatenation. In ICCV, pp. 2128-2135, 2013c.
32. Wang, J., Wang, N., Jia, Y., Li, J., Zeng, G., Zha, H. and Hua, X.-S. Trinary-projection trees for approximate nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell., 36(2):388-403, 2014.
33. Weiss, Y., Torralba, A. B., and Fergus, R. Spectral hashing. In NIPS, pp. 1753-1760, 2008.
34. Xu, H., Wang, J., Li, Z., Zeng, G., Li, S., and Yu, N. Complementary hashing for approximate nearest neighbor search. In/CCV, pp. 1631-1638, 2011.
35. Yuan, M. and Lin, Y. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68:49-67, 2006.