|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM255499809 |
003 |
DE-627 |
005 |
20231224174626.0 |
007 |
cr uuu---uuuuu |
008 |
231224s2016 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TPAMI.2015.2505311
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0851.xml
|
035 |
|
|
|a (DE-627)NLM255499809
|
035 |
|
|
|a (NLM)26660704
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Wang, Kaiye
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Joint Feature Selection and Subspace Learning for Cross-Modal Retrieval
|
264 |
|
1 |
|c 2016
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 06.06.2017
|
500 |
|
|
|a Date Revised 06.06.2017
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a Cross-modal retrieval has recently drawn much attention due to the widespread existence of multimodal data. It takes one type of data as the query to retrieve relevant data objects of another type, and generally involves two basic problems: the measure of relevance and coupled feature selection. Most previous methods just focus on solving the first problem. In this paper, we aim to deal with both problems in a novel joint learning framework. To address the first problem, we learn projection matrices to map multimodal data into a common subspace, in which the similarity between different modalities of data can be measured. In the learning procedure, the l21-norm penalties are imposed on the projection matrices separately to solve the second problem, which selects relevant and discriminative features from different feature spaces simultaneously. A multimodal graph regularization term is further imposed on the projected data,which preserves the inter-modality and intra-modality similarity relationships.An iterative algorithm is presented to solve the proposed joint learning problem, along with its convergence analysis. Experimental results on cross-modal retrieval tasks demonstrate that the proposed method outperforms the state-of-the-art subspace approaches
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a He, Ran
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Wang, Liang
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Wang, Wei
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Tan, Tieniu
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 38(2016), 10 vom: 10. Okt., Seite 2010-23
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
773 |
1 |
8 |
|g volume:38
|g year:2016
|g number:10
|g day:10
|g month:10
|g pages:2010-23
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2015.2505311
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 38
|j 2016
|e 10
|b 10
|c 10
|h 2010-23
|