View in EDS

DAHP: Deep Attention-Guided Hashing With Pairwise Labels.

Saved in:
Bibliographic Details
Title: DAHP: Deep Attention-Guided Hashing With Pairwise Labels.
Authors: Li, Xue1 1547037202@qq.com, Yu, Jiong2 yujiong@xju.edu.cn, Wang, Yongqiang3 925968662@qq.com, Chen, Jia-Ying3 chenjiaying@stu.xju.edu.cn, Chang, Peng-Xiao1 changpengxiao@stu.xju.edu.cn, Li, Ziyang1 liziyang@stu.xju.edu.cn
Source: IEEE Transactions on Circuits & Systems for Video Technology. Mar2022, Vol. 32 Issue 3, p933-946. 14p.
Subject Terms: *PROBLEM solving, *IMAGE retrieval, BINARY codes, GENERATING functions, FEATURE extraction, CONTEXTUAL learning
Abstract: To address the problem of inadequate feature extraction and binary code discrete optimization faced by deep hashing methods using a relaxation-quantization strategy, a novel deep attention-guided hashing method with pairwise labels (DAHP) is proposed to enhance global feature fusion, better learn the contextual information of image features to effectively enhance the feature representation, and solve the problem of losing feature information in discrete optimization by optimizing the loss function. First, we introduce a new concept called the anchor hash code generation(AHCG) algorithm, we train the ResNet with the position attention and channel attention mechanisms with the anchor points in Hamming space as supervised information, we fit the binary code representing the picture to the vicinity of each anchor point, and finally, we use the optimized loss function to calculate the pairwise loss and the anchor loss, allowing the hash function to generate hash code with strong discriminative power. The experiments were conducted on four benchmark datasets, and the retrieval accuracy of the proposed method outperformed the retrieval accuracies of the state-of-the-art methods. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Circuits & Systems for Video Technology is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Business Source Index
Description
Abstract:To address the problem of inadequate feature extraction and binary code discrete optimization faced by deep hashing methods using a relaxation-quantization strategy, a novel deep attention-guided hashing method with pairwise labels (DAHP) is proposed to enhance global feature fusion, better learn the contextual information of image features to effectively enhance the feature representation, and solve the problem of losing feature information in discrete optimization by optimizing the loss function. First, we introduce a new concept called the anchor hash code generation(AHCG) algorithm, we train the ResNet with the position attention and channel attention mechanisms with the anchor points in Hamming space as supervised information, we fit the binary code representing the picture to the vicinity of each anchor point, and finally, we use the optimized loss function to calculate the pairwise loss and the anchor loss, allowing the hash function to generate hash code with strong discriminative power. The experiments were conducted on four benchmark datasets, and the retrieval accuracy of the proposed method outperformed the retrieval accuracies of the state-of-the-art methods. [ABSTRACT FROM AUTHOR]
ISSN:10518215
DOI:10.1109/TCSVT.2021.3070129