Data-oriented locality sensitive hashing

MM'10 - Proceedings of the ACM Multimedia 2010 International Conference

Volumn , Issue , 2010, Pages 1131-1134

  Zhang, Wei ^a,b   Gao, Ke ^a   Zhang, Yong Dong ^a   Li, Jin Tao ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

approximate nearest neighbor search; data oriented locality sensitive hashing; similarity search

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR SEARCH; DIRECTED METHODS; EUCLIDEAN; EXISTING METHOD; HASH TABLE; HIGH-DIMENSIONAL INDEX; LOCALITY SENSITIVE HASHING; MEMORY CONSUMPTION; MEMORY COST; MULTIMEDIA APPLICATIONS; PROJECT DATA; QUERY EXPANSION; SIMILARITY SEARCH;

HASH FUNCTIONS; QUERY PROCESSING;

IMAGE RETRIEVAL;

EID: 78650986484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1873951.1874168     Document Type: Conference Paper

References (8)

1. Andoni, A. and Indyk, P. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. CACM, 51, 1 (2008), 117-122.
2. Datar, M., Immorlica, N., Indyk, P. and Mirrokni, V. Locality-sensitive hashing scheme based on p-stable distributions. SCG '2004.ACM Press.
3. Lv, Q., Josephson, W., Wang, Z., Charikar, M. and Li, K. Multi-probe LSH: efficient indexing for high-dimensional similarity search. VLDB, 2007.
4. Joly, A. and Buisson, O. A posteriori multi-probe locality sensitive hashing. In MM, 2008.
5. Poullot, S., Buisson, O. and Crucianu, M. Z-grid-based probabilistic retrieval for scaling up content-based copy detection. CIVR, 2007.
6. Zezula, P., Amato, G., Dohnal, V. and Batko, M. Similarity Search: The metric space approach. Advances in Database Systems, 32, (2006).
7. D. Nistér and H. Stewénius. Scalable recognition with a vocabulary tree. CVPR. 2(2006), 2161-2168.
8. Mikolajczyk, K., Tuytelaars, T., Schmid, et al. A comparison of affine region detectors. IJCV, 65, 1(2005), 43-72.