Abstract:

Locality sensitive hashing (LSH) is quite popular in high dimensional data indexing.The Hash function in the original LSH algorithm is generated based on pstable distribution.So the number of hash tables must be increased in order to improve the performance of the algorithm,which however leads to a high space complexity.An improved LSH (ILSH) algorithm is proposed,which does not require the labeled samples but only uses the distribution of data to construct the projection direction.The experimental results show that ILSH can greatly save the memory without degrading its retrieval performance.

Key words: high data indexing;LSH indexing;image retrieval;Gist feature