Polysemous codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9906 LNCS, Issue , 2016, Pages 785-801

  Douze, Matthijs ^a   Jégou, Hervé ^a   Perronnin, Florent ^a  

^a FACEBOOK AI RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER VISION; IMAGE PROCESSING; NEAREST NEIGHBOR SEARCH; SCHEDULING ALGORITHMS; SEMANTICS; VECTORS;

APPROXIMATE COMPUTATION; ASYMMETRIC DISTANCES; COMPRESSED DOMAIN; CREATIVE COMMONS; DISTANCE ESTIMATION; IMAGE DESCRIPTORS; SINGLE- MACHINES; VECTOR QUANTIZERS;

HAMMING DISTANCE;

EID: 84990829380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-46475-6_48     Document Type: Conference Paper

References (56)

1. Ai, L., Yu, J., Wu, Z., He, Y., Guan, T.: Optimized residual vector quantization for efficient approximate nearest neighbor search. Multimedia Syst. 1-13 (2015)
2. Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018-1028 (2014)
3. André, F., Kermarrec, A.M., le Scouarnec, N.: Cache locality is not enough: highperformance nearest neighbor search with product quantization fast scan. In: Proceedings of the International Conference on Very Large DataBases (2015)
4. Babenko, A., Lempitsky, V.: The inverted multi-index. In: CVPR, June 2012
5. Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: CVPR, June 2014
6. Babenko, A., Lempitsky, V.: Improving bilayer product quantization for billion-scale approximate nearest neighbors in high dimensions. arXiv preprint arXiv:1404.1831 (2014)
7. Babenko, A., Lempitsky, V.: Tree quantization for large-scale similarity search and classification. In: CVPR, June 2015
8. Babenko, A., Slesarev, A., Chigorin, A., Lempitsky, V.: Neural codes for image retrieval. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014, Part I. LNCS, vol. 8689, pp. 584-599. Springer, Heidelberg (2014)
9. Balu, R., Furon, T., Jégou, H.: Beyond project and sign for distance estimation with binary codes. In: ICASSP, April 2014
10. Barnes, C.F., Rizvi, S., Nasrabadi, N.: Advances in residual vector quantization: a review. IEEE Trans. Image Process. 5(2), 226-262 (1996)
11. Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In:STOC, pp. 380-388, May 2002
12. Chen, Y., Guan, T., Wang, C.: Approximate nearest neighbor search by residual vector quantization. Sensors 10(12), 11259-11273 (2010)
13. Cho, M., Lee, K.M.: Mode-seeking on graphs via random walks. In: CVPR, June 2012
14. Dong, W., Charikar, M., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW, March 2011
15. Dong, W., Charikar, M., Li, K.: Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In: SIGIR, pp. 123-130, July 2008
16. Farvardin, N.: A study of vector quantization for noisy channels. IEEE Trans. Inform. Theor. 36(5), 799-809 (1990)
17. Farvardin, N., Vaishampayan, V.: On the performance and complexity of channeloptimized vector quantizers. IEEE Trans. Inform. Theor. 37(1), 155-160 (1991)
18. Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: CVPR, June 2013
19. Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimension via hashing. In: Proceedings of the International Conference on Very Large DataBases, pp. 518-529 (1999)
20. Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. In: CVPR, June 2011
21. Gordo, A., Perronnin, F.: Asymmetric distances for binary embeddings. In: CVPR (2011)
22. Gray, R.M., Neuhoff, D.L.: Quantization. IEEE Trans. Inform. Theor. 44, 2325-2384 (1998)
23. He, K., Wen, F., Sun, J.: K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: CVPR (2013)
24. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604-613 (1998)
25. Jain, M., Jégou, H., Gros, P.: Asymmetric hamming embedding. In: ACM Multimedia, October 2011
26. Jegou, H., Douze, M., Schmid, C.: Hamming embedding and weak geometric consistency for large scale image search. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol. 5302, pp. 304-317. Springer, Heidelberg (2008)
27. Jégou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. PAMI 33(1), 117-128 (2011)
28. Jégou, H., Douze, M., Schmid, C., Pérez, P.: Aggregating local descriptors into a compact image representation. In: CVPR, June 2010
29. Jégou, H., Tavenard, R., Douze, M., Amsaleg, L.: Searching in one billion vectors:re-rank with source coding. In: ICASSP, May 2011
30. Juang, B.H., Gray, A.J.: Multiple stage vector quantization for speech coding. In:ICASSP, vol. 7, pp. 597-600. IEEE (1982)
31. Kalantidis, Y., Avrithis, Y.: Locally optimized product quantization for approximate nearest neighbor search. In: CVPR, June 2014
32. Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: NIPS, December 2012
33. Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: ICCV, October 2009
34. LeCun, Y., Boser, B., Denker, J., Henderson, D., Howard, R., Hubbard,W., Jackel, L.: Handwritten digit recognition with a back-propagation network. In: Advances in Neural Information Processing Systems 2, NIPS (1989)
35. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. IJCV 60(2), 91-110 (2004)
36. Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: Proceedings of the International Conference on Very Large DataBases, pp. 950-961 (2007)
37. Lv, Q., Charikar, M., Li, K.: Image similarity search with compact data structures. In: CIKM, pp. 208-217, November 2004
38. Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. arXiv preprint arXiv:1411.2173 (2014)
39. Norouzi, M., Fleet, D.: Cartesian k-means. In: CVPR, June 2013
40. Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multiindex hashing. In: CVPR (2012)
41. Paulevé, L., Jégou, H., Amsaleg, L.: Locality sensitive hashing: a comparison of hash function types and querying mechanisms. Pattern Recogn. Lett. 31(11), 1348-1358 (2010)
42. Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: NIPS (2010)
43. Thomee, B., Shamma, D.A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., Li, L.J.: The new data and new challenges in multimedia research. arXiv preprint arXiv:1503.01817, March 2015
44. Torralba, A., Fergus, R., Freeman, W.T.: 80 million tiny images: a large database for non-parametric object and scene recognition. IEEE Trans. PAMI 30(11), 1958-1970 (2008)
45. Torralba, A., Fergus, R.,Weiss, Y.: Small codes and large databases for recognition. In: CVPR, June 2008
46. Usunier, N., Buffoni, D., Gallinari, P.: Ranking with ordered weighted pairwise classification. In: ICML, June 2009
47. Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable k-NN graph construction for visual descriptors. In: CVPR, pp. 1106-1113, June 2012
48. Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. arXiv preprint arXiv:1408.2927 (2014)
49. Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for large scale search. IEEE Trans. PAMI 6(12), 1 (2012)
50. Wang, J., Liu, W., Kumar, S., Chang, S.: Learning to hash for indexing big data - a survey. CoRR abs/1509.05472 (2015). http://arxiv.org/abs/1509.05472
51. Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, December 2009
52. Xia, Y., He, K., Wen, F., Sun, J.: Joint inverted indexing. In: ICCV, December 2013
53. Xu, H., Wang, J., Li, Z., Zeng, G., Li, S., Yu, N.: Complementary hashing for approximate nearest neighbor search. In: ICCV, November 2011
54. Zeger, K., Gersho, A.: Pseudo-gray coding. IEEE Trans. Commun. 38(12), 2147-2158 (1990)
55. Zhang, T., Du, C., Wang, J.: Composite quantization for approximate nearest neighbor search. In: ICML, pp. 838-846, June 2014
56. Zhang, T., Qi, G.J., Tang, J., Wang, J.: Sparse composite quantization. In: CVPR, June 2015