mlsanityData to 7 Oct 2026

Age Estimation Based on Graph Convolutional Networks and Multi-head Attention Mechanisms

arXiv 2310.08064 ↗First posted 12 Oct 2023cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Age estimation technology is a part of facial recognition and has been applied to identity authentication. This technology achieves the development and application of a juvenile anti-addiction system by authenticating users in the game. Convolutional Neural Network (CNN) and Transformer algorithms are widely used in this application scenario. However, these two models cannot flexibly extract and model features of faces with irregular shapes, and they are ineffective in capturing key information. Furthermore, the above methods will contain a lot of background information while extracting features, which will interfere with the model. In consequence, it is easy to extract redundant information from images. In this paper, a new modeling idea is proposed to solve this problem, which can flexibly model irregular objects. The Graph Convolutional Network (GCN) is used to extract features from irregular face images effectively, and multi-head attention mechanisms are added to avoid redundant features and capture key region information in the image. This model can effectively improve the accuracy of age estimation and reduce the MAE error value to about 3.64, which is better than the effect of today's age estimation model, to improve the accuracy of face recognition and identity authentication.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 10 references that are in the map. First posted on arXiv 12 Oct 2023.

Builds on

3 of 10 references.

References · 3

  1. 2021FP-Age: Leveraging Face Parsing Attention for Facial Age Estimation in the Wildcited by 20
  2. 2021Brain Age Estimation From MRI Using Cascade Networks with Ranking Losscited by 17
  3. 2021Improving Face-Based Age Estimation with Attention-Based Dynamic Patch Fusioncited by 13

Built on by

Not cited yet.