SphereFace: Deep Hypersphere Embedding for Face Recognition
read the original abstract
This paper addresses deep face recognition (FR) problem under open-set protocol, where ideal face features are expected to have smaller maximal intra-class distance than minimal inter-class distance under a suitably chosen metric space. However, few existing algorithms can effectively achieve this criterion. To this end, we propose the angular softmax (A-Softmax) loss that enables convolutional neural networks (CNNs) to learn angularly discriminative features. Geometrically, A-Softmax loss can be viewed as imposing discriminative constraints on a hypersphere manifold, which intrinsically matches the prior that faces also lie on a manifold. Moreover, the size of angular margin can be quantitatively adjusted by a parameter $m$. We further derive specific $m$ to approximate the ideal feature criterion. Extensive analysis and experiments on Labeled Face in the Wild (LFW), Youtube Faces (YTF) and MegaFace Challenge show the superiority of A-Softmax loss in FR tasks. The code has also been made publicly available.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
PoLAR: Factorizing Extent and Mode in Latent Actions for Robot Policy Learning
PoLAR imposes radial structure on latent actions in hyperbolic space to factorize extent and mode, improving robot policy performance over baselines.
-
Adaptive Calibration for Fair and Performant Facial Recognition
Adaptive Calibration maps cosine similarities to probabilities using local context, improving accuracy and fairness in facial recognition without demographic metadata.
-
Find the Differences: Differential Morphing Attack Detection vs Face Recognition
Face recognition systems can be repurposed for morphing attack detection using a new threshold that bounds vulnerability even to unknown morph types.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.