Transfer Adversarial Hashing For Hamming Space Retrieval

Abstract

Hashing is widely applied to large-scale image retrieval due to the storage and retrieval efficiency. Existing work on deep hashing assumes that the database in the target domain is identically distributed with the training set in the source domain. This paper relaxes this assumption to a transfer retrieval setting, which allows the database and the training set to come from different but relevant domains. However, the transfer retrieval setting will introduce two technical difficulties: first, the hash model trained on the source domain cannot work well on the target domain due to the large distribution gap; second, the domain gap makes it difficult to concentrate the database points to be within a small Hamming ball. As a consequence, transfer retrieval performance within Hamming Radius 2 degrades significantly in existing hashing methods. This paper presents Transfer Adversarial Hashing (TAH), a new hybrid deep architecture that incorporates a pairwise \(t\)-distribution cross-entro

Stats

• citations13
• S2 citations—
• github stars0
• HF likes0
• heat score8.60
• arxiv keycao2017transfer

Related papers

• Asymmetric Transfer Hashing With Adaptive Bipartite Graph Learning (2022)8.82
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Targeted Attack For Deep Hashing Based Retrieval (2020)13.65
• Query-adaptive Image Retrieval By Deep Weighted Hashing (2016)12.68
• Deep Hash Distillation For Image Retrieval (2021)11.29
• Transhash: Transformer-based Hamming Hashing For Efficient Image Retrieval (2021)13.44
• Unsupervised Multi-criteria Adversarial Detection In Deep Image Retrieval (2023)0.00
• Semantic-aware Adversarial Training For Reliable Deep Hashing Retrieval (2023)13.49