The Group Loss for Deep Metric Learning

被引:36
作者
Elezi, Ismail [1 ]
Vascon, Sebastiano [1 ]
Torcinovich, Alessandro [1 ]
Pelillo, Marcello [1 ]
Leal-Taixe, Laura [2 ]
机构
[1] Ca Foscari Univ Venice, Venice, Italy
[2] Tech Univ Munich, Munich, Germany
来源
COMPUTER VISION - ECCV 2020, PT VII | 2020年 / 12352卷
关键词
Deep metric learning; Image retrieval; Image clustering;
D O I
10.1007/978-3-030-58571-6_17
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep metric learning has yielded impressive results in tasks such as clustering and image retrieval by leveraging neural networks to obtain highly discriminative feature embeddings, which can be used to group samples into different classes. Much research has been devoted to the design of smart loss functions or data mining strategies for training such networks. Most methods consider only pairs or triplets of samples within a mini-batch to compute the loss function, which is commonly based on the distance between embeddings. We propose Group Loss, a loss function based on a differentiable label-propagation method that enforces embedding similarity across all samples of a group while promoting, at the same time, low-density regions amongst data points belonging to different groups. Guided by the smoothness assumption that "similar objects should belong to the same group", the proposed loss trains the neural network for a classification task, enforcing a consistent labelling amongst samples within a class. We show state-of-the-art results on clustering and image retrieval on several datasets, and show the potential of our method when combined with other techniques such as ensembles. To facilitate further research, we make available the code and the models at https://github.com/dvl-tum/group_loss.
引用
收藏
页码:277 / 294
页数:18
相关论文
共 55 条
[1]   Deep Constrained Dominant Sets for Person Re-Identification [J].
Alemu, Leulseged Tesfaye ;
Pelillo, Marcello ;
Shah, Mubarak .
2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, :9854-9863
[2]  
Bergstra J, 2012, J MACH LEARN RES, V13, P281
[3]  
Bromley J., 1993, International Journal of Pattern Recognition and Artificial Intelligence, V7, P669, DOI 10.1142/S0218001493000339
[4]   Deep Metric Learning to Rank [J].
Cakir, Fatih ;
He, Kun ;
Xia, Xide ;
Kulis, Brian ;
Sclaroff, Stan .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :1861-1870
[5]   Learning a similarity metric discriminatively, with application to face verification [J].
Chopra, S ;
Hadsell, R ;
LeCun, Y .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :539-546
[6]   Deep Embedding Learning with Discriminative Sampling Policy [J].
Duan, Yueqi ;
Chen, Lei ;
Lu, Jiwen ;
Zhou, Jie .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :4959-4968
[7]  
Elezi I, 2018, INT C PATT RECOG, P1432, DOI 10.1109/ICPR.2018.8545524
[8]   Graph Transduction as a Noncooperative Game [J].
Erdem, Aykut ;
Pelillo, Marcello .
NEURAL COMPUTATION, 2012, 24 (03) :700-723
[9]   Deep Metric Learning with Hierarchical Triplet Loss [J].
Ge, Weifeng ;
Huang, Weilin ;
Dong, Dengke ;
Scott, Matthew R. .
COMPUTER VISION - ECCV 2018, PT VI, 2018, 11210 :272-288
[10]   Local Descriptors Optimized for Average Precision [J].
He, Kun ;
Lu, Yan ;
Sclaroff, Stan .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :596-605