SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval
2016 Β· Jian Zhang, Yuxin Peng
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 main contributions are as follows: (1) We propose a semi-supervised loss to jointly minimize the empiri
Authors
(none)
Tags
Stats
Related papers
- Unsupervised Semantic Deep Hashing (2018)10.48
- Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
- Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
- Semantic Hierarchy Preserving Deep Hashing For Large-scale Image Retrieval (2019)5.24
- Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
- Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00
- Deep Residual Hashing (2016)0.00
- Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59