An Efficient Regenerated Cross-Modal Hashing: Improving Existing Hash Codes with the Arbitrary Length
- 29 April 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PP (01628828) , 1-18
Abstract
In recent years, numerous hashing techniques have been developed to boost efficient cross-modal retrieval. Once a retrieval model is deployed, the hash code length is fixed to achieve optimal performance. To address different retrieval scenarios while maintaining retrieval accuracy, a common approach is to redesign and retrain the original model with different hash code length. However, this retraining process can increase the training load and may lead to worse results. To tackle these challenges, we present Regenerated Cross-Modal Hashing (RCMH), a novel cross-modal hashing framework designed to improve the quality of existing hash codes and convert them to arbitrary lengths with high efficiency. First, we clip or pad the existing hash codes to initialize them with the target length, under the supervision of the similarity matrix generated by the augmented label information. Second, we introduce a linear-nonlinear competitive reconstruction approach to reduce the semantic gaps and further capture the deeper relationships from linear image features and nonlinear text features. In this way, each pair of samples is compared and selected to obtain reconstructed binary codes that can preserve the modality-specific properties. Finally, to reduce the training costs caused by iterations of variables, the regenerate hashing term is utilized to regenerate final hash codes with the reconstructed binary codes while preserving the information from the existing hash codes without iterative optimization. Notably, RCMH can be integrated with existing state-of-the-art (SOTA) methods with robustness, helping them to adjust the hash code length and achieve better retrieval performance. Extensive experiments on several public datasets show that RCMH outperforms SOTA methods across various evaluation metrics. The code is available at https://github.com/kaihang-jiang/RCMH.git.Keywords
Funding Information
- Laboratory for Artificial Intelligence in Design
- InnoHK Initiative of the Innovation and Technology Commission of the Hong Kong Special Administrative Region Government
- National Natural Science Foundation of China (61772141)
This publication has 75 references indexed in Scilit:
- Discrete online cross-modal hashing with consistency preservationPattern Recognition, 2024
- Robust online hashing with label semantic enhancement for cross-modal retrievalPattern Recognition, 2023
- Attention-Aware Deep Adversarial Hashing for Cross-Modal Retrieval2018
- Self-Supervised Adversarial Hashing Networks for Cross-Modal Retrieval2018
- Generalized Semantic Preserving Hashing for N-Label Cross-Modal Retrieval2017
- Deep Cross-Modal Hashing2017
- Supervised Discrete Hashing2015
- Semantics-preserving hashing for cross-view retrieval2015
- Collective Matrix Factorization Hashing for Multimodal Data2014
- Microsoft COCO: Common Objects in Context2014