Deep Residual Hashing
2016 · Sailesh Conjeti, Abhijit Guha Roy, Amin Katouzian, et al.
Abstract
Hashing aims at generating highly compact similarity preserving code words which are well suited for large-scale image retrieval tasks. Most existing hashing methods first encode the images as a vector of hand-crafted features followed by a separate binarization step to generate hash codes. This two-stage process may produce sub-optimal encoding. In this paper, for the first time, we propose a deep architecture for supervised hashing through residual learning, termed Deep Residual Hashing (DRH), for an end-to-end simultaneous representation learning and hash coding. The DRH model constitutes four key elements: (1) a sub-network with multiple stacked residual blocks; (2) hashing layer for binarization; (3) supervised retrieval loss function based on neighbourhood component analysis for similarity preserving embedding; and (4) hashing related losses and regularisation to control the quantization error and improve the quality of hash coding. We present results of extensive experiments o
Authors
(none)
Tags
Stats
Related papers
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24
- Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
- Deep Reinforcement Learning For Image Hashing (2018)12.25
- Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
- Deep Supervised Discrete Hashing (2017)0.00
- Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
- Unsupervised Semantic Deep Hashing (2018)10.48