Deep Discrete Supervised Hashing
2017 · Qing-Yuan Jiang, Xue Cui, Wu-Jun Li
Abstract
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 discrete optimization problem. Hence, utilizing supervised information to directly guide discrete (binary) coding procedure can avoid sub-optimal solution and improve the accuracy. On the other hand, deep hashing, which integrates deep feature learning and hash-code learning into an end-to-end architecture, can enhance the feedback between feature learning and hash-code learning. The key in discrete supervised hashing is to adopt supervised information to directly guide the discrete coding procedure in hashing. The key in deep hashing is to adopt the supervised information to directly guide the deep feature learning procedure. However, t
Authors
(none)
Tags
Stats
Related papers
- Deep Supervised Discrete Hashing (2017)0.00
- Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
- How Should We Evaluate Supervised Hashing? (2016)12.68
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
- Unsupervised Semantic Deep Hashing (2018)10.48
- Supervised Deep Hashing For Hierarchical Labeled Data (2017)8.09
- Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24