Deep Self-adaptive Hashing For Image Retrieval
2021 · Qinghong Lin, Xiaojun Chen, Qin Zhang, et al.
Abstract
Hashing technology has been widely used in image retrieval due to its computational and storage efficiency. Recently, deep unsupervised hashing methods have attracted increasing attention due to the high cost of human annotations in the real world and the superiority of deep learning technology. However, most deep unsupervised hashing methods usually pre-compute a similarity matrix to model the pairwise relationship in the pre-trained feature space. Then this similarity matrix would be used to guide hash learning, in which most of the data pairs are treated equivalently. The above process is confronted with the following defects: 1) The pre-computed similarity matrix is inalterable and disconnected from the hash learning process, which cannot explore the underlying semantic information. 2) The informative data pairs may be buried by the large number of less-informative data pairs. To solve the aforementioned problems, we propose a Deep Self-Adaptive Hashing (DSAH) model to adaptively c
Authors
(none)
Tags
Stats
Related papers
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
- Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
- Unsupervised Semantic Deep Hashing (2018)10.48
- Deep Hashing: A Joint Approach For Image Signature Learning (2016)5.24
- Improved Deep Classwise Hashing With Centers Similarity Learning For Image Retrieval (2021)5.84
- Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00
- Object Detection Based Deep Unsupervised Hashing (2018)6.34