Joint and Individual Feature Fusion Hashing for Multi-modal Retrieval

被引:5
作者
Yu, Jun [1 ]
Zheng, Yukun [2 ]
Wang, Yinglin [2 ]
Li, Zuhe [1 ]
Zhu, Liang [1 ]
机构
[1] Zhengzhou Univ Light Ind, Coll Comp & Commun Engn, Zhengzhou, Peoples R China
[2] Zhengzhou Univ Light Ind, Int Educ Coll, Zhengzhou, Peoples R China
关键词
Multi-modal hashing; Feature fusion; Multi-modal retrieval; Binary codes;
D O I
10.1007/s12559-022-10086-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Unsupervised multi-modal hashing has received considerable attention in large-scale multimedia retrieval areas since its low storage and high search speed. Existing unsupervised multi-modal hashing methods usually aim to mine the complementary information and the structural information for different modalities and preserve them in low-dimensional discrete space. The main limitations are two folds: (1) The shared semantic properties and the specific-modality information between multi-modal data are not explored simultaneously, which limits the improvement of retrieval accuracy. (2) Most multi-modal hashing methods with rough fusion manners cause greatly the information loss. In this paper, we present an unsupervised Joint and Individual Feature Fusion Hashing (JIFFH) that jointly performs the unified feature learning and individual feature learning. A two-layer fusion architecture with an adaptive weighting scheme is adopted to fuse effectively the common semantic properties and the specific-modality data information. The experimental results on three public multi-modal datasets show that our proposed method is better than state-of-the-art unsupervised multi-modal hashing methods. In conclusion, the proposed JIFFH method is very effective to learn discriminative hash codes and can boost retrieval performance.
引用
收藏
页码:1053 / 1064
页数:12
相关论文
共 29 条
[1]  
Chua TS, 2009, P C IM VID RETR, P1
[2]   Supervised discrete cross-modal hashing based on kernel discriminant analysis [J].
Fang, Yixian ;
Ren, Yuwei .
PATTERN RECOGNITION, 2020, 98
[3]   Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval [J].
Gong, Yunchao ;
Lazebnik, Svetlana ;
Gordo, Albert ;
Perronnin, Florent .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (12) :2916-2929
[4]  
Huiskes M.J., 2008, P 1 ACM INT C MULT I
[5]   Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding [J].
Ji, Rongrong ;
Liu, Hong ;
Cao, Liujuan ;
Liu, Di ;
Wu, Yongjian ;
Huang, Feiyue .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (11) :5411-5420
[6]  
Kishida K., 2005, Property of average precision and its generalization: An examination of evaluation indicator for information retrieval experiments
[7]   Neighborhood Preserving Hashing for Scalable Video Retrieval [J].
Li, Shuyan ;
Chen, Zhixiang ;
Lu, Jiwen ;
Li, Xiu ;
Zhou, Jie .
2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, :8211-8220
[8]   Similarity-Preserving Linkage Hashing for Online Image Retrieval [J].
Lin, Mingbao ;
Ji, Rongrong ;
Chen, Shen ;
Sun, Xiaoshuai ;
Lin, Chia-Wen .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2020, 29 :5289-5300
[9]   Microsoft COCO: Common Objects in Context [J].
Lin, Tsung-Yi ;
Maire, Michael ;
Belongie, Serge ;
Hays, James ;
Perona, Pietro ;
Ramanan, Deva ;
Dollar, Piotr ;
Zitnick, C. Lawrence .
COMPUTER VISION - ECCV 2014, PT V, 2014, 8693 :740-755
[10]   Multiview Alignment Hashing for Efficient Image Search [J].
Liu, Li ;
Yu, Mengyang ;
Shao, Ling .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2015, 24 (03) :956-966