SSDH: Semi-supervised Deep Hashing for Large Scale Image Retrieval
Jian Zhang, and Yuxin Peng

TL;DR
This paper introduces SSDH, a semi-supervised deep hashing method that effectively combines semantic similarity and data structure preservation for large-scale image retrieval, outperforming existing methods.
Contribution
The paper presents the first deep hashing network that jointly learns hash codes and features in a semi-supervised manner, utilizing an online graph construction for improved neighbor capture.
Findings
Outperforms state-of-the-art hashing methods on five datasets.
Effectively preserves semantic similarity and data structures.
Leverages both labeled and unlabeled data during training.
Abstract
Hashing methods have been widely used for efficient similarity retrieval on large scale image database. Traditional hashing methods learn hash functions to generate binary codes from hand-crafted features, which achieve limited accuracy since the hand-crafted features cannot optimally represent the image content and preserve the semantic similarity. Recently, several deep hashing methods have shown better performance because the deep architectures generate more discriminative feature representations. However, these deep hashing methods are mainly designed for supervised scenarios, which only exploit the semantic similarity information, but ignore the underlying data structures. In this paper, we propose the semi-supervised deep hashing (SSDH) approach, to perform more effective hash function learning by simultaneously preserving semantic similarity and underlying data structures. The…
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.
