using multiple losses for accurate facial age estimation
- URL: http://arxiv.org/abs/2106.09393v1
- Date: Thu, 17 Jun 2021 11:18:16 GMT
- Title: using multiple losses for accurate facial age estimation
- Authors: Yi Zhou, Heikki Huttunen, Tapio Elomaa
- Abstract summary: We propose a simple yet effective approach for age estimation, which improves the performance compared to classification-based methods.
We validate the Age-Granularity-Net framework on the CVPR Chalearn 2016 dataset, and extensive experiments show that the proposed approach can reduce the prediction error compared to any individual loss.
- Score: 6.851375622634309
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Age estimation is an essential challenge in computer vision. With the
advances of convolutional neural networks, the performance of age estimation
has been dramatically improved. Existing approaches usually treat age
estimation as a classification problem. However, the age labels are ambiguous,
thus make the classification task difficult. In this paper, we propose a simple
yet effective approach for age estimation, which improves the performance
compared to classification-based methods. The method combines four
classification losses and one regression loss representing different class
granularities together, and we name it as Age-Granularity-Net. We validate the
Age-Granularity-Net framework on the CVPR Chalearn 2016 dataset, and extensive
experiments show that the proposed approach can reduce the prediction error
compared to any individual loss. The source code link is
https://github.com/yipersevere/age-estimation.
Related papers
- Deep Imbalanced Regression via Hierarchical Classification Adjustment [50.19438850112964]
Regression tasks in computer vision are often formulated into classification by quantizing the target space into classes.
The majority of training samples lie in a head range of target values, while a minority of samples span a usually larger tail range.
We propose to construct hierarchical classifiers for solving imbalanced regression tasks.
Our novel hierarchical classification adjustment (HCA) for imbalanced regression shows superior results on three diverse tasks.
arXiv Detail & Related papers (2023-10-26T04:54:39Z) - Fine-grained Recognition with Learnable Semantic Data Augmentation [68.48892326854494]
Fine-grained image recognition is a longstanding computer vision challenge.
We propose diversifying the training data at the feature-level to alleviate the discriminative region loss problem.
Our method significantly improves the generalization performance on several popular classification networks.
arXiv Detail & Related papers (2023-09-01T11:15:50Z) - Noise-Tolerance GPU-based Age Estimation Using ResNet-50 [0.0]
We implement a deep residual neural network on the UTKFace data set.
We show that the performance of our implemented network is lower than 1.5% when injecting 15 dB noise to the input data.
arXiv Detail & Related papers (2023-04-26T16:38:41Z) - Adaptive Mean-Residue Loss for Robust Facial Age Estimation [7.667560350473354]
We propose a loss function for robust facial age estimation via distribution learning.
Experimental results in the datasets FG-NET and CLAP2016 have validated the effectiveness of the proposed loss.
arXiv Detail & Related papers (2022-03-31T16:28:34Z) - LAE : Long-tailed Age Estimation [52.5745217752147]
We first formulate a simple standard baseline and build a much strong one by collecting the tricks in pre-training, data augmentation, model architecture, and so on.
Compared with the standard baseline, the proposed one significantly decreases the estimation errors.
We propose a two-stage training method named Long-tailed Age Estimation (LAE), which decouples the learning procedure into representation learning and classification.
arXiv Detail & Related papers (2021-10-25T09:05:44Z) - FP-Age: Leveraging Face Parsing Attention for Facial Age Estimation in
the Wild [50.8865921538953]
We propose a method to explicitly incorporate facial semantics into age estimation.
We design a face parsing-based network to learn semantic information at different scales.
We show that our method consistently outperforms all existing age estimation methods.
arXiv Detail & Related papers (2021-06-21T14:31:32Z) - Hierarchical Attention-based Age Estimation and Bias Estimation [16.335191345543063]
We propose a novel deep-learning approach for age estimation based on face images.
Our scheme is shown to outperform contemporary schemes and provide a new state-of-the-art age estimation accuracy.
arXiv Detail & Related papers (2021-03-17T19:41:34Z) - Integrated Age Estimation Mechanism [14.66142603273126]
The proposed age estimation mechanism achieves a good tradeoff effect of age estimation.
The mechanism is a framework mechanism that can be used to construct different specific age estimation algorithms.
arXiv Detail & Related papers (2021-03-11T09:14:10Z) - Class-incremental Learning with Rectified Feature-Graph Preservation [24.098892115785066]
A central theme of this paper is to learn new classes that arrive in sequential phases over time.
We propose a weighted-Euclidean regularization for old knowledge preservation.
We show how it can work with binary cross-entropy to increase class separation for effective learning of new classes.
arXiv Detail & Related papers (2020-12-15T07:26:04Z) - Few-Shot Open-Set Recognition using Meta-Learning [72.15940446408824]
The problem of open-set recognition is considered.
A new oPen sEt mEta LEaRning (PEELER) algorithm is introduced.
arXiv Detail & Related papers (2020-05-27T23:49:26Z) - Equalization Loss for Long-Tailed Object Recognition [109.91045951333835]
State-of-the-art object detection methods still perform poorly on large vocabulary and long-tailed datasets.
We propose a simple but effective loss, named equalization loss, to tackle the problem of long-tailed rare categories.
Our method achieves AP gains of 4.1% and 4.8% for the rare and common categories on the challenging LVIS benchmark.
arXiv Detail & Related papers (2020-03-11T09:14:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.