paper-with-me

홈 › Papers

Rescuing Deep Hashing from Dead Bits Problem

2021-02-01 · Shu Zhao, Dayan Wu, Yucan Zhou, Bo Li, Weiping Wang

Deep hashing methods have shown great retrieval accuracy and efficiency in large-scale image retrieval. How to optimize discrete hash bits is always the focus in deep hashing methods. A common strategy in these methods is to adopt an activation function, e.g. $\operatorname{sigmoid}(\cdot)$ or $\operatorname{tanh}(\cdot)$, and minimize a quantization loss to approximate discrete values. However, this paradigm may make more and more hash bits stuck into the wrong saturated area of the activation functions and never escaped. We call this problem "Dead Bits Problem~(DBP)". Besides, the existing quantization loss will aggravate DBP as well. In this paper, we propose a simple but effective gradient amplifier which acts before activation functions to alleviate DBP. Moreover, we devise an error-aware quantization loss to further alleviate DBP. It avoids the negative effect of quantization loss based on the similarity between two images. The proposed gradient amplifier and error-aware quantization loss are compatible with a variety of deep hashing methods. Experimental results on three datasets demonstrate the efficiency of the proposed gradient amplifier and the error-aware quantization loss.

📄 PDF Abstract BibTeX arXiv:2102.00648

Code (0)

등록된 구현이 없습니다.

Tasks

Deep HashingImage RetrievalQuantizationRetrieval

Similar Papers 제목 키워드 기반

Hash Bit Selection: A Unified Solution for Selection Problems in Hashing

2013-06-01 · CVPR 2013 6 · Xianglong Liu, Junfeng He, Bo Lang, Shih-Fu Chang

Recent years have witnessed the active development of hashing techniques for nearest neighbor search over big datasets. However, to apply hashing techniques successfully, there are several important issues remaining open…

Bayesian Supervised Hashing

2017-07-01 · CVPR 2017 7 · Zihao Hu, Junxuan Chen, Hongtao Lu, Tongzhen Zhang

Among learning based hashing methods, supervised hashing seeks compact binary representation of the training data to preserve semantic similarities. Recent years have witnessed various problem formulations and optimizati…

Unsupervised Few-Bits Semantic Hashing with Implicit Topics Modeling

2020-11-01 · Findings of the Association for Computational Linguistics 2020 · Fanghua Ye, Jarana Manotumruksa, Emine Yilmaz

Semantic hashing is a powerful paradigm for representing texts as compact binary hash codes. The explosion of short text data has spurred the demand of few-bits hashing. However, the performance of existing semantic hash…

b-Bit Minwise Hashing for Estimating Three-Way Similarities

2010-12-01 · NeurIPS 2010 12 · Ping Li, Arnd Konig, Wenhao Gui

Computing two-way and multi-way set similarities is a fundamental problem. This study focuses on estimating 3-way resemblance (Jaccard similarity) using b-bit minwise hashing. While traditional minwise hashing methods st…

Neurons Merging Layer: Towards Progressive Redundancy Reduction for Deep Supervised Hashing

2018-09-07 · Chaoyou Fu, Liangchen Song, Xiang Wu, Guoli Wang 외

Deep supervised hashing has become an active topic in information retrieval. It generates hashing bits by the output neurons of a deep hashing network. During binary discretization, there often exists much redundancy bet…

Deep HashingInformation RetrievalRetrieval