Beyond 'project and sign' for cosine estimation with binary codes

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2014, Pages 6884-6888

  Balu, Raghavendran ^a   Furon, Teddy ^a   Jégou, Hervé ^a  

^a INRIA   (France)

Author keywords

approximate nearest neighbors; Hamming embedding; Locality sensitive hashing; similarity search

Indexed keywords

ALGORITHMS; BINARY CODES; ENCODING (SYMBOLS); IMAGE RETRIEVAL;

APPROXIMATE NEAREST NEIGHBOR; COSINE SIMILARITY; ENCODING STRATEGY; ENCODING TECHNIQUES; HAMMING EMBEDDING; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBOR SEARCH; SIMILARITY SEARCH;

SIGNAL PROCESSING;

EID: 84905268888     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2014.6854934     Document Type: Conference Paper

References (22)

1. A. Torralba, R. Fergus, and Y. Weiss, "Small codes and large databases for recognition," in CVPR, June 2008.
2. H. Jégou, M. Douze, and C. Schmid, "Hamming embedding and weak geometric consistency for large scale image search," in ECCV, October 2008.
3. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in NIPS, December 2009.
4. F. Perronnin, Y. Liu, J. Sanchez, and H. Poirier, "Large-scale image retrieval with compressed Fisher vectors," in CVPR, June 2010.
5. A. Joly and O. Buisson, "Random maximum margin hashing," in CVPR, 2011.
6. M. S. Charikar, "Similarity estimation techniques from rounding algorithms," in STOC, May 2002, pp. 380-388.
7. A. Rahimi and B. Recht, "Random features for large-scale kernel machines," in NIPS, 2007.
8. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," in NIPS, 2010.
9. Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in CVPR, June 2011.
10. P. T. Boufounos, "Universal rate-efficient scalar quantization," IEEE Trans. Inform. Theory, vol. 58, no. 3, March 2012.
11. W. Dong, M. Charikar, and K. Li, "Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces," in SIGIR, July 2008, pp. 123-130.
12. H. Jégou, T. Furon, and J. J. Fuchs, "Anti-sparse coding for approximate nearest neighbor search," in ICASSP, March 2012.
13. V. K. Goyal, M. Vetterli, and N. T. Thao, "Quantized overcomplete expansions in RN: Analysis, synthesis, and algorithms," IEEE Trans. Inform. Theory, vol. 44, no. 1, pp. 16-31, January 1998.
14. K. Simonyan, A. Vedaldi, and A. Zisserman, "Learning local feature descriptors using convex optimisation," Tech. Rep., Department of Engineering Science, University of Oxford, 2013.
15. J. Ji, J. Li, S. Yan, B. Zhang, and Q. Tian, "Super-bit localitysensitive hashing," in NIPS, December 2012.
16. B. Kulis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in NIPS, December 2009.
17. H. Jégou, M. Douze, C. Schmid, and P. Pérez, "Aggregating local descriptors into a compact image representation," in CVPR, June 2010.
18. M. Jain, H. Jégou, and P. Gros, "Asymmetric hamming embedding," in ACM Multimedia, October 2011.
19. H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearest neighbor search," IEEE Trans. PAMI, vol. 33, no. 1, pp. 117-128, January 2011.
20. J. J. Fuchs, "Spread representations," in ASILOMAR, November 2011.
21. H. Jégou, R. Tavenard, M. Douze, and L. Amsaleg, "Searching in one billion vectors: re-rank with source coding," in ICASSP, Prague Czech Republic, 2011.
22. D. Lowe, "Distinctive image features from scale-invariant keypoints," IJCV, vol. 60, no. 2, pp. 91-110, 2004.