Journal
IEEE ACCESS
Volume 8, Issue -, Pages 14278-14288Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.2966220
Keywords
Cross-modal retrieval; semi-supervised; graph regularization; subspace learning
Categories
Funding
- Shandong Provincial Key Research and Development Program [2016GGX101035, 2019GGX101004]
- Shandong Education Department Teaching Reform Project [Z2016M014, Z2016M016, Z2016Z013, M2018x197]
- China Scholarship Council [201809995006]
Ask authors/readers for more resources
Most of the existing cross-modal retrieval methods make use of labeled data to learn projection matrices for different modal data. These methods usually learn the original semantic space to bridge the heterogeneous gap, ignoring the rich semantic information contained in unlabeled data. Accordingly, a semantic consistency cross-modal retrieval with semi-supervised graph regularization (SCCMR) algorithm is proposed, which integrates the prediction of labels and the optimization of projection matrices into a unified framework to ensure that the solution obtained is globally optimal. At the same time, the method uses graph embedding to consider the nearest neighbors in the potential subspace of paired images and texts as well as images and texts with the same semantics. l(21)-norm constraint is applied to the projection matrices to select the discriminative features for different modal data. The results show that our method outperforms several advanced methods on four commonly used cross-modal retrieval datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available