Query-adaptative Locality Sensitive Hashing

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

Volumn , Issue , 2008, Pages 825-828

  Jégou, Hervé ^a   Amsaleg, Laurent ^b   Schmid, Cordelia ^a   Gros, Patrick ^b  

^a UNIV GRENOBLE ALPES   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Database searching; Image databases; Information retrieval; Quantization; Search methods

Indexed keywords

DATABASE SEARCHING; IMAGE DATABASES; INFORMATION RETRIEVAL; QUANTIZATION; SEARCH METHODS;

ACOUSTICS; FUNCTIONS; SPEECH;

SIGNAL PROCESSING;

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

References (16)

1. C. Böhm, S. Berchtold, and D. Keim, "Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases," ACM Computing Surveys, vol. 33, no. 3, pp. 322-373, 2001.
2. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "near-est neighbor" meaningful?" in Intl. Conf. on Database Theory, 1999, pp. 217-235.
3. R. M. Gray and D. L. Neuhoff, "Quantization," IEEE Trans. on Information Theory, vol. 44, pp. 2325-2384, Oct. 1998.
4. D. Lowe, "Distinctive image features from scale-invariant keypoints," Intl. Jrnl. of Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
5. H. Lejsek, F. H. Ásmundsson, B. Jónsson, and L. Amsaleg, "Scalability of local image descriptors: A comparative study," in ACM Conf. on Multimedia, 2006.
6. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni, "Locality- sensitive hashing scheme based on p-stable distributions," in Symp. on Computational Geometry, 2004, pp. 253-262.
7. G. Shakhnarovich, T. Darrell, and P. Indyk, Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, Mar 2006, ch. 3.
8. Y. Ke, R. Sukthankar, and L. Huston, "Efficient near-duplicate detection and sub-image retrieval," in ACM Conf. on Multimedia, 2004, pp. 869-876.
9. B. Matei, Y. Shan, H. Sawhney, Y. Tan, R. Kumar, D. Huber, and M. Hebert, "Rapid object indexing using locality sensitive hashing and joint 3D-signature space estimation," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 28, no. 7, pp. 1111 - 1126, July 2006.
10. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for near neighbor problem in high dimensions," in Symp. on the Foundations of Computer Science, 2006, pp. 459-468.
11. J. Conway and N. Sloane, "Voronoi regions of lattices, second moments of polytopes, and quantization," IEEE Trans. on Information Theory, vol. 28, no. 2, pp. 211-226, 1982.
12. _, "Fast quantizing and decoding algorithms for lattice quantizers and codes," IEEE Trans. on Information Theory, vol. 28, no. 2, pp. 227-232, 1982.
13. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. on Information Theory, vol. 48, no. 8, pp. 2201-2214, 2002.
14. M. Ran and J. Snyders, "Efficient decoding of the gosset, coxeter-todd and the barnes-wall lattices," in Symp. on Information Theory, 1998.
15. A. Vardy and Y. Be'ery, "Maximum-likelihood decoding of the leech lattice," IEEE Trans. on Information Theory, vol. 39, no. 4, pp. 1435-1444, 1993.
16. O. Amrani and Y. Be'ery, "Efficient bounded-distance decoding of the hexacode and associated decoders for the leech lattice and the golay code," IEEE Trans. on Multimedia, vol. 44, pp. 534-537, 1996.