Deep Discrete Supervised Hashing
Qing-Yuan Jiang, Xue Cui, Wu-Jun Li

TL;DR
This paper introduces DDSH, a novel deep hashing method that directly uses supervised information to guide both discrete code learning and deep feature learning, improving image retrieval accuracy.
Contribution
DDSH is the first deep hashing framework to simultaneously guide discrete coding and deep feature learning with supervised information.
Findings
DDSH outperforms state-of-the-art baselines on three datasets.
Direct guidance of both procedures improves retrieval accuracy.
Enhanced feedback between coding and feature learning boosts performance.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
