Results 1 to 10 of about 1,759 (223)
Distributed Fast Supervised Discrete Hashing [PDF]
Hash-based learning has attracted considerable attention due to its fast retrieval speed and low computational cost for the large-scale database. Compared with unsupervised hashing, supervised hashing achieves higher retrieval accuracy generally by leveraging supervised information.
Shukai Duan, Feng Chen
exaly +4 more sources
Distributed Supervised Discrete Hashing With Relaxation [PDF]
The data-dependent hash methods are becoming more and more attractive because they perform well in fast retrieval and storing high-dimensional data. Most existing supervised hashes are centralized, such as supervised discrete hashing (SDH) and supervised discrete hashing with relaxation (SDHR).
Rui Hu +3 more
openaire +4 more sources
Deep Discrete Supervised Hashing [PDF]
Hashing has been widely used for large-scale search due to its low storage cost and fast query speed. By using supervised information, supervised hashing can significantly outperform unsupervised hashing. Recently, discrete supervised hashing and deep hashing are two representative progresses in supervised hashing. On one hand, hashing is essentially a
Qing-Yuan Jiang, Wu-Jun Li
exaly +5 more sources
Supervised Discrete Hashing With Relaxation [PDF]
Data-dependent hashing has recently attracted attention due to being able to support efficient retrieval and storage of high-dimensional data such as documents, images, and videos. In this paper, we propose a novel learning-based hashing method called "Supervised Discrete Hashing with Relaxation" (SDHR) based on "Supervised Discrete Hashing" (SDH). SDH
Dacheng Tao, Jie Gui, Tongliang Liu
exaly +5 more sources
Fast Supervised Discrete Hashing [PDF]
Learning-based hashing algorithms are ``hot topics" because they can greatly increase the scale at which existing methods operate. In this paper, we propose a new learning-based hashing method called ``fast supervised discrete hashing" (FSDH) based on ``supervised discrete hashing" (SDH).
Dacheng Tao, Jie Gui, Tongliang Liu
exaly +5 more sources
Weakly-Supervised Online Hashing [PDF]
Accepted by ICME ...
Yu-Wei Zhan +5 more
openaire +4 more sources
Supervised Incremental Hashing [PDF]
We propose an incremental strategy for learning hash functions with kernels for large-scale image search. Our method is based on a two-stage classification framework that treats binary codes as intermediate variables between the feature space and the semantic space.
Bahadir Ozdemir +2 more
openaire +3 more sources
This paper has been withdrawn by the authour.
Fumin Shen +3 more
openaire +5 more sources
Self-supervised Bernoulli Autoencoders for Semi-supervised Hashing [PDF]
Semantic hashing is an emerging technique for large-scale similarity search based on representing high-dimensional data using similarity-preserving binary codes used for efficient indexing and search. It has recently been shown that variational autoencoders, with Bernoulli latent representations parametrized by neural nets, can be successfully trained ...
Ricardo Ñanculef +4 more
openaire +4 more sources
Supervised Short-Length Hashing [PDF]
Hashing can compress high-dimensional data into compact binary codes, while preserving the similarity, to facilitate efficient retrieval and storage. However, when retrieving using an extremely short length hash code learned by the existing methods, the performance cannot be guaranteed because of severe information loss.
Xingbo Liu +5 more
openaire +2 more sources

