Command Palette
Search for a command to run...
Weiyang Liu; Yandong Wen; Zhiding Yu; Ming Li; Bhiksha Raj; Le Song

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.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| face-identification-on-megaface | SphereFace (3-patch ensemble) | Accuracy: 75.766% |
| face-identification-on-megaface | SphereFace (single model) | Accuracy: 72.729% |
| face-identification-on-trillion-pairs-dataset | A-Softmax | Accuracy: 43.89 |
| face-verification-on-ck | SphereFace | Accuracy: 93.80 |
| face-verification-on-megaface | SphereFace (3-patch ensemble) | Accuracy: 89.142% |
| face-verification-on-megaface | SphereFace (single model) | Accuracy: 85.561% |
| face-verification-on-trillion-pairs-dataset | A-Softmax | Accuracy: 43.76 |
| face-verification-on-youtube-faces-db | SphereFace | Accuracy: 95.0% |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.