Is simhash achilles?

Authors:
Qixia Jiang;Yan Zhang;Liner Yang;Maosong Sun
Affiliations:
State Key Laboratory on Intelligent Technology and Systems, Tsinghua University, Beijing, China;State Key Laboratory on Intelligent Technology and Systems, Tsinghua University, Beijing, China;State Key Laboratory on Intelligent Technology and Systems, Tsinghua University, Beijing, China;State Key Laboratory on Intelligent Technology and Systems, Tsinghua University, Beijing, China
Venue:
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Year:
2011

Citing 11
Cited 0

K-d trees for semidynamic point sets

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Similarity estimation techniques from rounding algorithms

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Gray Scale and Rotation Invariant Texture Classification with Local Binary Patterns

ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part I
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Support Vector Data Description

Machine Learning
LSH forest: self-tuning indexes for similarity search

WWW '05 Proceedings of the 14th international conference on World Wide Web
Detecting near-duplicates for web crawling

Proceedings of the 16th international conference on World Wide Web
Principles of hash-based text retrieval

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Multi-probe LSH: efficient indexing for high-dimensional similarity search

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Semantic hashing

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simhash generates compact binary codes for the input data thus improves the search efficiency. Most recent works on Simhash are designed to speed-up the search, generate high-quality descriptors, etc. However, few works discuss in what situations Simhash can be directly applied. This paper proposes a novel method to quantitatively analyze this question. Our method is based on Support Vector Data Description (SVDD), which tries to find a tighten sphere to cover most points. Using the geometry relation between the unit sphere and the SVDD sphere, we give a quantitative analysis on in what situations Simhash is feasible. We also extend the basic Simhash to handle those unfeasible cases. To reduce the complexity, an approximation algorithm is proposed, which is easy for implementation. We evaluate our method on synthetic data and a real-world image dataset. Most results show that our method outperforms the basic Simhash significantly.