End-to-end cross-modality retrieval with CCA projections and pairwise ranking loss

被引:26
作者
Dorfer, Matthias [1 ]
Schlueter, Jan [2 ]
Vall, Andreu [1 ]
Korzeniowski, Filip [1 ]
Widmer, Gerhard [1 ,2 ]
机构
[1] Johannes Kepler Univ Linz, Dept Computat Percept, A-4040 Linz, Austria
[2] Austrian Res Inst Artificial Intelligence, A-1010 Vienna, Austria
关键词
Cross-modality retrieval; Canonical correlation analysis; Ranking loss; Neural network; Joint embedding space;
D O I
10.1007/s13735-018-0151-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Cross-modality retrieval encompasses retrieval tasks where the fetched items are of a different type than the search query, e. g., retrieving pictures relevant to a given text query. The state-of-the-art approach to cross-modality retrieval relies on learning a joint embedding space of the two modalities, where items from either modality are retrieved using nearest-neighbor search. In this work, we introduce a neural network layer based on canonical correlation analysis (CCA) that learns better embedding spaces by analytically computing projections that maximize correlation. In contrast to previous approaches, the CCA layer allows us to combine existing objectives for embedding space learning, such as pairwise ranking losses, with the optimal projections of CCA. We show the effectiveness of our approach for cross-modality retrieval on three different scenarios (text-to-image, audio-sheet-music and zero-shot retrieval), surpassing both Deep CCA and a multi-view network using freely learned projections optimized by a pairwise ranking loss, especially when little training data is available (the code for all three methods is released at: https:// github. com/ CPJKU/ cca_layer).
引用
收藏
页码:117 / 128
页数:12
相关论文
共 31 条
[1]  
Abadi M., 2015, PREPRINT
[2]  
Andrienko G., 2013, Introduction, P1
[3]  
[Anonymous], 2016, P IEEE C COMP VIS PA
[4]  
[Anonymous], 2010, CALTECH UCSD BIRDS
[5]  
[Anonymous], MATRIX COOKBOOKK NOV
[6]  
[Anonymous], 2009, CVPR09
[7]  
[Anonymous], 2015, INT C MACHINE LEARN, DOI DOI 10.5555/3045118.3045167
[8]  
[Anonymous], 2014, P BRIT MACH VIS C 20
[9]  
[Anonymous], P 17 INT SOC MUS INF
[10]  
[Anonymous], ARXIV E PRINTS