CVJul 3, 2020

Learning Expectation of Label Distribution for Facial Age and Attractiveness Estimation

arXiv:2007.01771v217 citations
AI Analysis

This work addresses computational efficiency and model optimization for facial attribute estimation, offering a practical solution for applications like biometrics or social media, though it is incremental as it builds on existing DLDL frameworks.

The paper tackles the inconsistency between training objectives and evaluation metrics in facial age and attractiveness estimation by proposing a lightweight network that learns facial attribute distribution and regresses attribute value, achieving state-of-the-art results with 36× fewer parameters and 3× faster inference speed.

Facial attributes (\eg, age and attractiveness) estimation performance has been greatly improved by using convolutional neural networks. However, existing methods have an inconsistency between the training objectives and the evaluation metric, so they may be suboptimal. In addition, these methods always adopt image classification or face recognition models with a large amount of parameters, which carry expensive computation cost and storage overhead. In this paper, we firstly analyze the essential relationship between two state-of-the-art methods (Ranking-CNN and DLDL) and show that the Ranking method is in fact learning label distribution implicitly. This result thus firstly unifies two existing popular state-of-the-art methods into the DLDL framework. Second, in order to alleviate the inconsistency and reduce resource consumption, we design a lightweight network architecture and propose a unified framework which can jointly learn facial attribute distribution and regress attribute value. The effectiveness of our approach has been demonstrated on both facial age and attractiveness estimation tasks. Our method achieves new state-of-the-art results using the single model with 36$\times$ fewer parameters and 3$\times$ faster inference speed on facial age/attractiveness estimation. Moreover, our method can achieve comparable results as the state-of-the-art even though the number of parameters is further reduced to 0.9M (3.8MB disk storage).

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes