Learning Robust Embedding Representation With Hybrid Loss for Classification and Verification

被引:3
作者
Huang, Haozhi [1 ]
Liang, Yanyan [1 ]
机构
[1] Macau Univ Sci & Technol, Fac Informat Technol, Macau 999078, Peoples R China
关键词
Embedding; metric learning; classification; verification; person re-identification; MARGIN SOFTMAX;
D O I
10.1109/ACCESS.2019.2894652
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a method of building an embedding representation via deep metric learning, which works well in both classification and verification problems. The embedding is built via a proposed hybrid loss, which consists of a softmax loss and a Euclidean-metric loss. The hybrid loss explores the tradeoff, balancing the discriminativeness and invariance. In deep metric learning, a softmax loss is proposed for classification and a Euclidean-metric loss is responsible for verification. We apply the proposed loss and the softmax loss to the well-known deep models, such as VGG-16 and ResNet-50, respectively. In addition, the performances are evaluated by two datasets (CIFAR and Market1501), in which the CIFAR is for classification and the Market1501 is for verification. The results indicate that the embedding learned from the proposed loss does improve the performance on both the classification and verification tasks.
引用
收藏
页码:13643 / 13652
页数:10
相关论文
共 38 条
[1]   Face description with local binary patterns:: Application to face recognition [J].
Ahonen, Timo ;
Hadid, Abdenour ;
Pietikainen, Matti .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (12) :2037-2041
[2]  
[Anonymous], FEATURE INCAY REPRES
[3]  
[Anonymous], PROC CVPR IEEE
[4]  
[Anonymous], 2017, COMMUN ACM, DOI DOI 10.1145/3065386
[5]  
[Anonymous], 2015, PREPRINT
[6]  
[Anonymous], 2016, JOURNAL OF LATEX CLA
[7]  
[Anonymous], PROC CVPR IEEE
[8]  
[Anonymous], 2017, L2 CONSTRAINED SOFTM
[9]  
[Anonymous], ACM T MULT COMP
[10]   NEURAL NETWORKS FOR FINGERPRINT RECOGNITION [J].
BALDI, P ;
CHAUVIN, Y .
NEURAL COMPUTATION, 1993, 5 (03) :402-418