Hierarchical Consensus Hashing for Cross-Modal Retrieval

被引:66
作者
Sun, Yuan [1 ]
Ren, Zhenwen [2 ]
Hu, Peng [1 ]
Peng, Dezhong [1 ,3 ]
Wang, Xu [1 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610044, Peoples R China
[2] Southwest Univ Sci & Technol, Dept Natl Def Sci & Technol, Mianyang 621010, Peoples R China
[3] Sichuan Zhiqian Technol Co Ltd, Chengdu 610041, Peoples R China
基金
中国国家自然科学基金;
关键词
Consensus learning; cross-modal retrieval; hierarchical hashing; learning to hash; ROBUST;
D O I
10.1109/TMM.2023.3272169
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cross-modal hashing (CMH) has gained much attention due to its effectiveness and efficiency in facilitating efficient retrieval between different modalities. Whereas, most existing methods unconsciously ignore the hierarchical structural information of the data, and often learn a single-layer hash function to directly transform cross-modal data into common low-dimensional hash codes in one step. This sudden drop of dimension and the huge semantic gap can cause the discriminative information loss. To this end, we adopt a coarse-to-fine progressive mechanism and propose a novel Hierarchical Consensus Cross-Modal Hashing (HCCH). Specifically, to mitigate the loss of important discriminative information, we propose a coarse-to-fine hierarchical hashing scheme that utilizes a two-layer hash function to refine the beneficial discriminative information gradually. And then, the $\ell _{2,1}$-norm is imposed on the layer-wise hash function to alleviate the effects of redundant and corrupted features. Finally, we present consensus learning to effectively encode data into a consensus space in such a progressive way, thereby reducing the semantic gap progressively. Through extensive contrast experiments with some advanced CMH methods, the effectiveness and efficiency of our HCCH method are demonstrated on four benchmark datasets.
引用
收藏
页码:824 / 836
页数:13
相关论文
共 46 条
[1]   Enhanced Discrete Multi-Modal Hashing: More Constraints Yet Less Time to Learn [J].
Chen, Yong ;
Zhang, Hui ;
Tian, Zhibao ;
Wang, Jun ;
Zhang, Dell ;
Li, Xuelong .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (03) :1177-1190
[2]   Unsupervised Contrastive Cross-Modal Hashing [J].
Hu, Peng ;
Zhu, Hongyuan ;
Lin, Jie ;
Peng, Dezhong ;
Zhao, Yin-Ping ;
Peng, Xi .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (03) :3877-3889
[3]   Joint Versus Independent Multiview Hashing for Cross-View Retrieval [J].
Hu, Peng ;
Peng, Xi ;
Zhu, Hongyuan ;
Lin, Jie ;
Zhen, Liangli ;
Peng, Dezhong .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (10) :4982-4993
[4]   Separated Variational Hashing Networks for Cross-Modal Retrieval [J].
Hu, Peng ;
Wang, Xu ;
Zhen, Liangli ;
Peng, Dezhong .
PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA (MM'19), 2019, :1721-1729
[5]   Discrete Latent Factor Model for Cross-Modal Hashing [J].
Jiang, Qing-Yuan ;
Li, Wu-Jun .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2019, 28 (07) :3490-3501
[6]   Deep Cross-Modal Hashing [J].
Jiang, Qing-Yuan ;
Li, Wu-Jun .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :3270-3278
[7]   Unsupervised Discrete Hashing With Affinity Similarity [J].
Jin, Sheng ;
Yao, Hongxun ;
Zhou, Qin ;
Liu, Yao ;
Huang, Jianqiang ;
Hua, Xiansheng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2021, 30 :6130-6141
[8]   Self-Supervised Adversarial Hashing Networks for Cross-Modal Retrieval [J].
Li, Chao ;
Deng, Cheng ;
Li, Ning ;
Liu, Wei ;
Gao, Xinbo ;
Tao, Dacheng .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :4242-4251
[9]   Supervised Robust Discrete Multimodal Hashing for Cross-Media Retrieval [J].
Li, Chuan-Xiang ;
Yan, Ting-Kun ;
Luo, Xin ;
Nie, Liqiang ;
Xu, Xin-Shun .
IEEE TRANSACTIONS ON MULTIMEDIA, 2019, 21 (11) :2863-2877
[10]   Adaptive Label Correlation Based Asymmetric Discrete Hashing for Cross-Modal Retrieval [J].
Li, Huaxiong ;
Zhang, Chao ;
Jia, Xiuyi ;
Gao, Yang ;
Chen, Chunlin .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (02) :1185-1199