Scalable Similarity-Consistent Deep Metric Learning for Face Recognition

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the development of deep learning, deep metric learning (DML) has achieved great improvements in face recognition. Specifically, the widely used softmax losses in the training process often bring large intra-class variations, and feature normalization is only exploited in the testing process to compute the pair similarities. To bridge the gap, we impose the intra-class cosine similarity between the features and weight vectors in softmax loss larger than a margin in the training step and extend it from four aspects. First, we explore the effect of a hard sample mining strategy. To alleviate the human labor of adjusting the margin hyper-parameter, a self-Adaptive margin updating strategy is proposed. Then, a normalized version is given to take full advantage of the cosine similarity constraint. Furthermore, we enhance the former constraints to consider the intra-class and inter-class constraints simultaneously in the exponential feature projection space. The extensive experiments on the labeled face in the wild (LFW), youtube faces (YTF), and IARPA Janus benchmark A (IJB-A) datasets demonstrate that the proposed methods outperform the mainstream DML methods and approach the state-of-The-Art performance.

Cite

CITATION STYLE

APA

Wu, B., & Wu, H. (2019). Scalable Similarity-Consistent Deep Metric Learning for Face Recognition. IEEE Access, 7, 104759–104768. https://doi.org/10.1109/ACCESS.2019.2931913

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free