Mis-classified Vector Guided Softmax Loss for Face Recognition
文献类型:会议论文
作者 | Xiaobo Wang3; Shifeng Zhang1,2; Shuo Wang3; Tianyu Fu3; Hailin Shi3; Tao Mei3; Wang, Shuo; Zhang, Shifeng![]() ![]() ![]() |
出版日期 | 2020 |
会议日期 | 2020-02 |
会议地点 | 美国纽约 |
英文摘要 | Face recognition has witnessed significant progress due to the advances of deep convolutional neural networks (CNNs), the central task of which is how to improve the feature discrimination. To this end, several margin-based (\textit{e.g.}, angular, additive and additive angular margins) softmax loss functions have been proposed to increase the feature margin between different classes. However, despite great achievements have been made, they mainly suffer from three issues: 1) Obviously, they ignore the importance of informative features mining for discriminative learning; 2) They encourage the feature margin only from the ground truth class, without realizing the discriminability from other non-ground truth classes; 3) The feature margin between different classes is set to be same and fixed, which may not adapt the situations very well. To cope with these issues, this paper develops a novel loss function, which adaptively emphasizes the mis-classified feature vectors to guide the discriminative feature learning. Thus we can address all the above issues and achieve more discriminative face features. To the best of our knowledge, this is the first attempt to inherit the advantages of feature margin and feature mining into a unified loss function. Experimental results on several benchmarks have demonstrated the effectiveness of our method over state-of-the-art alternatives. |
源URL | [http://ir.ia.ac.cn/handle/173211/39045] ![]() |
专题 | 自动化研究所_模式识别国家重点实验室_生物识别与安全技术研究中心 |
作者单位 | 1.University of Chinese Academy of Sciences 2.Institute of Automation Chinese Academy of Sciences 3.JD |
推荐引用方式 GB/T 7714 | Xiaobo Wang,Shifeng Zhang,Shuo Wang,et al. Mis-classified Vector Guided Softmax Loss for Face Recognition[C]. 见:. 美国纽约. 2020-02. |
入库方式: OAI收割
来源:自动化研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。