K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The Journal of Machine Learning Research
Fast Pose Estimation with Parameter-Sensitive Hashing
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cover trees for nearest neighbor
ICML '06 Proceedings of the 23rd international conference on Machine learning
Training linear SVMs in linear time
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-probe LSH: efficient indexing for high-dimensional similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
International Journal of Approximate Reasoning
Self-taught hashing for fast similarity search
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Scalable similarity search with optimized kernel hashing
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Data-oriented locality sensitive hashing
Proceedings of the international conference on Multimedia
Exploiting the entire feature space with sparsity for automatic image annotation
MM '11 Proceedings of the 19th ACM international conference on Multimedia
A Multimedia Retrieval Framework Based on Semi-Supervised Ranking and Relevance Feedback
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Multimedia
Hi-index | 0.08 |
Among the existing hashing methods, spectral hashing (SpH) and self-taught hashing (STH) are considered as the state-of-the-art works. However, two such methods still have some drawbacks. For example, when generating the extension of out-of-sample, SpH makes assumption that data follows uniform distribution but it is impractical. As to STH, its hash functions are obtained by training SVM classifier bit-by-bit, which will lead to ten-fold increase in training time. Moreover, they both suffer overfitting issue. To conquer those drawbacks, we propose a new hashing method, also called LS_SPH, which adopts a unified objective function to obtain the binary embeddings of training objects and hash functions for predicting hash code of test object. Integrating two such processes together will bring in two advantages: (1) It can highly decrease the time complexity of offline stage for training hash codes and hash function due to not requiring extra time for learning hash function. (2) The overfitting issue can be successfully avoided because the empirical loss function associated with hash function is served as the regularization item in objective function in this method. The extensive experiments show that the LS_SPH is superior to the state-of-the-art hashing methods such as SpH and STH on the whole.