Locality sensitive hashing: A comparison of hash function types and querying mechanisms

Pattern Recognition Letters

Volumn 31, Issue 11, 2010, Pages 1348-1358

  Paulevé, Loïc ^a   Jégou, Hervé ^b   Amsaleg, Laurent ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

^c CAMPUS DE BEAULIEU   (France)

Author keywords

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

Indexed keywords

DATABASE SEARCHING; FEATURE SPACE; HASHING FUNCTIONS; HIGH-DIMENSIONAL; IMAGE DATABASE; IMAGE DATABASES; K-MEANS; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBORS; PERFORMANCE GAIN; QUANTIZERS; QUERYING MECHANISMS; RANDOM PROJECTIONS; REAL DATA SETS; SEARCH METHOD; SEARCH SCHEME; SIFT DESCRIPTORS;

DATABASE SYSTEMS; HASH FUNCTIONS; SEARCH ENGINES; VECTOR SPACES;

INFORMATION RETRIEVAL;

EID: 77953324416     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2010.04.004     Document Type: Article

References (29)

1. Agrell E., Eriksson T., Vardy A., and Zeger K. Closest point search in lattices. IEEE Trans. Inform. Theory 48 8 (2002) 2201-2214
2. Andoni, A., Indyk, P., 2006. Near-optimal hashing algorithms for near neighbor problem in high-dimensions. In: Proc. of the Symposium on the Foundations of Computer Science, pp. 459-468.
3. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U., 1999. When is nearest neighbor meaningful? In: Int. Conf. on Database Theory, August, pp. 217-235.
4. Böhm C., Berchtold S., and Keim D. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33 3 (2001) 322-373
5. Brown M., and Lowe D.G. Automatic panoramic image stitching using invariant features. Internat. J. Comput. Vision 74 1 (2007) 59-73
6. Casey, M., Slaney, M. 2007. Fast recognition of remixed music audio. In: Internat. Conf. on Acoustics, Speech and Signal Process, April, vol. 4, pp. 1425-1428.
7. Conway J., and Sloane N. Fast quantizing and decoding algorithms for lattice quantizers and codes. IEEE Trans. Inform. Theory 28 2 (1982) 227-232
8. Conway J., and Sloane N. Voronoi regions of lattices, second moments of polytopes, and quantization. IEEE Trans. Inform. Theory 28 2 (1982) 211-226
9. Conway J., Sloane N., and Bannai E. Sphere-packings, Lattices, and Groups (1987), Springer-Verlag New York, Inc., New York, NY, USA
10. Datar, M., Immorlica, N., Indyk, P., Mirrokni, V., 2004. Locality sensitive hashing scheme based on p-stable distributions. In: Proc. of the Symposium on Computational Geometry, pp. 253-262.
11. Gionis, A., Indyk, P., Motwani, R., 1999. Similarity search in high-dimension via hashing. In: Proc. of the Internat. Conf. on Very Large DataBases, pp. 518-529.
12. Gray R.M., and Neuhoff D.L. Quantization. IEEE Trans. Inform. Theory 44 (1998) 2325-2384
13. Jégou, H., Amsaleg, L., Schmid, C., Gros, P., 2008a. Query-adaptive locality sensitive hashing. In: Internat. Conf. Acoustics, Speech, and Signal Processing.
14. Jégou, H., Douze, M., Schmid, C., 2008b. Hamming embedding and weak geometric consistency for large scale image search. In: European Conf. on Computer Vision, October.
15. Joly, A., Buisson, O., 2008. A posteriori multi-probe locality sensitive hashing. In: ACM Conf. on Multimedia, pp. 209-218.
16. Ke, Y., Sukthankar, R., Huston, L., 2004. Efficient near-duplicate detection and sub-image retrieval. In: ACM Conf. on Multimedia, pp. 869-876.
17. Lejsek, H., Ásmundsson, F., Jónsson, B., Amsaleg, L., 2006. Scalability of local image descriptors: A comparative study. In: ACM Conf. on Multimedia, pp. 589-598.
18. Lowe D. Distinctive image features from scale-invariant keypoints. Internat. J. Comput. Vision 60 2 (2004) 91-110
19. Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K., 2007. Multi-probe LSH: Efficient indexing for high-dimensional similarity search. In: Proc. Internat. Conf. on Very Large DataBases, pp. 950-961.
20. Matei B., Shan Y., Sawhney H., Tan Y., Kumar R., Huber D., and Hebert M. Rapid object indexing using locality sensitive hashing and joint 3D-signature space estimation. IEEE Trans. Pattern Anal. Machine Intell. 28 7 (2006) 1111-1126
21. Mikolajczyk K., and Schmid C. Scale and affine invariant interest point detectors. Internat. J. Comput. Vision 60 1 (2004) 63-86
22. Muja, M., Lowe, D.G., 2009. Fast approximate nearest neighbors with automatic algorithm configuration. In: Internat. Computer Graphics Theory and Applications.
23. Nistér, D., Stewénius, H., 2006. Scalable recognition with a vocabulary tree. In: Proc. IEEE Conf. on Computer Vision and Pattern Recognition, pp. 2161-2168.
24. Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A., 2007. Object retrieval with large vocabularies and fast spatial matching. In: Proc. IEEE Conf. on Computer Vision and Pattern Recognition.
25. Shakhnarovich G., Darrell T., and Indyk P. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (2006), MIT Press Ch. 3
26. Sivic, J., Zisserman, A., 2003. Video-Google: A text retrieval approach to object matching in videos. In: Proc. IEEE Internat. Conf. on Computer Vision, pp. 1470-1477.
27. Terasawa K., and Tanaka Y. Spherical LSH for Approximate Nearest-Neighbor Search on Unit Hypersphere (2007), Springer pp. 27-38
28. Vardy A., and Be'ery Y. Maximum likelihood decoding of the leech lattice. IEEE Trans. Inform. Theory 39 4 (1993) 1435-1444
29. Zhang J., Marszalek M., Lazebnik S., and Schmid C. Local features and kernels for classification of texture and object categories: A comprehensive study. Internat. J. Comput. Vision 73 (2007) 213-238