Central similarity consistency hashing for asymmetric image retrieval
Open Access
- 1 August 2024
- journal article
- research article
- Published by Tsinghua University Press in Computational Visual Media
- Vol. 10 (4) , 725-740
Abstract
Asymmetric image retrieval methods have drawn much attention due to their effectiveness in resource-constrained scenarios. They try to learn two models in an asymmetric paradigm, i.e., a small model for the query side and a large model for the gallery. However, we empirically find that the mutual training scheme (learning with each other) will inevitably degrade the performance of the large gallery model, due to the negative effects exerted by the small query one. In this paper, we propose Central Similarity Consistency Hashing (CSCH), which simultaneously learns a small query model and a large gallery model in a mutually promoted manner, ensuring both high retrieval accuracy and efficiency on the query side. To achieve this, we first introduce heuristically generated hash centers as the common learning target for both two models. Instead of randomly assigning each hash center to its corresponding category, we introduce the Hungarian algorithm to optimally match each of them by aligning the Hamming similarity of hash centers to the semantic similarity of their classes. Furthermore, we introduce the instance-level consistency loss, which enables the explicit knowledge transfer from the gallery model to the query one, without the sacrifice of gallery performance. Guided by the unified learning of hash centers and the distilled knowledge from gallery model, the query model can be gradually aligned to the Hamming space of the gallery model in a decoupled manner. Extensive experiments demonstrate the superiority of our CSCH method compared with current state-of-the-art deep hashing methods. The open-source code is available at https://github.com/dubanx/CSCH.Keywords
This publication has 12 references indexed in Scilit:
- Attack is the Best Defense: Towards Preemptive-Protection Person Re-Identification2022
- Salience-Guided Iterative Asymmetric Mutual Hashing for Fast Person Re-IdentificationIEEE Transactions on Image Processing, 2021
- Binary Neural Network Hashing for Image Retrieval2021
- Asymmetric Deep Hashing for Efficient Hash Code Compression2020
- Supervised Online Hashing via Hadamard Codebook Learning2018
- Deep Asymmetric Pairwise Hashing2017
- Deep Video HashingIEEE Transactions on Multimedia, 2016
- Bit-Scalable Deep Hashing With Regularized Similarity Learning for Image Retrieval and Person Re-IdentificationIEEE Transactions on Image Processing, 2015
- Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image RetrievalIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955