A posteriori multi-Probe locality sensitive hashing

MM'08 - Proceedings of the 2008 ACM International Conference on Multimedia, with co-located Symposium and Workshops

Volumn , Issue , 2008, Pages 209-218

  Joly, Alexis ^a   Buisson, Olivier ^b  

^a INRIA ROCQUENCOURT   (France)

^b INA   (France)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

CONTENT-BASED SEARCH; DATA SETS; HASH TABLE; HIGH-DIMENSIONAL; INDEXING TECHNIQUES; LOCALITY SENSITIVE HASHING; MULTIMEDIA DATA; MULTIPROBES; NEAREST NEIGHBORS; PERFORMANCE; POSTERIORI; PRIOR KNOWLEDGE; QUERY RESULTS; SIMILARITY SEARCH; SPACE AND TIME; THEORY; VISUAL FEATURE;

IMAGE RETRIEVAL; METHOD OF MOMENTS; MULTIMEDIA SYSTEMS; PROBES; QUALITY ASSURANCE; QUALITY FUNCTION DEPLOYMENT; SPACE PROBES; TOTAL QUALITY MANAGEMENT;

QUALITY CONTROL;

EID: 70350660774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1459359.1459388     Document Type: Conference Paper

References (22)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of ACM, 51(1), 2008.
2. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In Proc. of conf. on Machine learning, pages 97-104, New York, NY, USA, 2006.
3. M. Casey and M. Slaney. Song intersection by approximate nearest neighbour search. In In Proc. Int. Symp. on Music Information Retrieval, pages 2161-2168, 2006.
4. P. Ciaccia and M. Patella. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proc. of Int. Conf. on Data Engineering, pages 244-255, 2000.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. of Int. Conf. on Very Large Data Bases, pages 426-435, 1997.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proc. of Symposium on Computational geometry, pages 253-262, 2004.
7. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. Abbadi. Approximate nearest neighbor searching in multimedia databases. In ICDE, pages 503-511, 2001.
8. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of ACM SIGMOD Conf. of Management of Data, pages 47-57, 1984.
9. M. E. Houle and J. Sakuma. Fast approximate similarity search in extremely high-dimensional data sets. In Proc. of the Int. Conf. on Data Engineering, pages 619-630, 2005.
10. H. Jegou, L. Amsaleg, C. Schmid, and P. Gros. Query-adaptative locality sensitive hashing. In International Conference on Acoustics, Speech, and Signal Processing. IEEE, 2008. to appear.
11. A. Joly. New local descriptors based on dissociated dipoles. In CIVR '07: Proceedings of the 6th ACM international conference on Image and video retrieval, pages 573-580, 2007.
12. A. Joly, O. Buisson, and C. Frélicot. Content-based copy retrieval using distortion-based probabilistic similarity search. IEEE Trans. on Multimedia, 9(2):293-306, 2007.
13. N. Katayama and S. Satoh. The sr-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pages 369-380, 1997.
14. Y. Ke, R. Sukthankar, and L. Huston. Efficient near-duplicate detection and sub-image retrieval. In Proc. of ACM Int. Conf. on Multimedia, 2004.
15. C. Li, E. Chang, M. Garcia-Molina, and G. Wiederhold. Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. on Knowledge and Data Engineering, 14(4):792-808, 2002.
16. D. G. Lowe. Object recognition from local scale-invariant features. In Proc. of Int. Conf. on Computer Vision, pages 1150-1157, 1999.
17. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe lsh: efficient indexing for high-dimensional similarity search. In Proc. of Conf. on Very Large Data Bases, pages 253-262, 2007.
18. M.-B. Matei, S. M.-Y. Shan, M.-H. S. Sawhney, S. M.-Y. Tan, M.-R. Kumar, M.-D. Huber, and M.-M. Hebert. Rapid object indexing using locality sensitive hashing and joint 3d-signature space estimation. IEEE Trans. Pattern Anal. Mach. Intell., 28(7):1111-1126, 2006.
19. R. Panigrahy. Entropy based nearest neighbor search in high dimensions. In Proc. of annual ACM-SIAM symposium on Discrete algorithm, pages 1186-1195, 2006.
20. S. Poullot, O. Buisson, and M. Crucianu. Z-grid-based probabilistic retrieval for scaling up content-based copy detection. In CIVR '07: Proceedings of the 6th ACM international conference on Image and video retrieval,pages 348-355, 2007.
21. R. Weber, H. J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of Int. Conf. on Very Large Data Bases, pages 194-205, 1998.
22. P. Zezula, P. Savino, G. Amato, and F. Rabitti. Approximate similarity retrieval with m-trees. Very Large Data Bases Journal, 7(4):275-293, 1998.