A Novel Facial Expression Recognition Algorithm Based on LBP and Improved ResNet

LBP is an excellent method that effectively describes the local texture of an image. It is not only computationally simple, but also has a good effect, and thus is widely applied in the field of facial expression recognition. However, the original LBP method suffers from weaknesses of poor feature description and generalization ability. To overcome the above mentioned shortcomings, a novel facial expression recognition algorithm that combines improved ResNet model and LBP feature extraction method (LBP-ResNet) is proposed in this paper. First, the gradient boosting decision tree algorithm is adopted to locate the key facial points, cropping the facial region images to reduce the interference from non-expression areas. Secondly, the facial image size is normalized to extract the LBP feature maps, and data augmentation is performed through affine transformation. These feature maps are then input into an improved ResNet network, which introduces squeeze and excitation attention modules and replaces the original ReLu static function with DyReLu dynamic function to enhance the features of key facial points. Finally, the LBP-ResNet algorithm is compared with several representative algorithms on CK+ and JAFFE datasets. Experimental results demonstrate that the proposed algorithm shows a better performance in facial expression recognition accuracy and generalization ability.

Authors

Institutions

Publication Details

Published
2024-11-22
DOI
https://doi.org/10.1145/3725949.3725968
Citations
1
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Facial Expression Recognition Algorithm Based on LBP and Improved ResNet

Tao Chen, Jia Han, Jianhui Zhong, Fang Dong et al.
1 citations
Face and Expression Recognition
0.25
article

A Novel Facial Expression Recognition Algorithm Based on LBP and Improved ResNet

Tao Chen, Jia Han, Jianhui Zhong, Fang Dong, Wenfeng Wang
article en
1 citations

Abstract

LBP is an excellent method that effectively describes the local texture of an image. It is not only computationally simple, but also has a good effect, and thus is widely applied in the field of facial expression recognition. However, the original LBP method suffers from weaknesses of poor feature description and generalization ability. To overcome the above mentioned shortcomings, a novel facial expression recognition algorithm that combines improved ResNet model and LBP feature extraction method (LBP-ResNet) is proposed in this paper. First, the gradient boosting decision tree algorithm is adopted to locate the key facial points, cropping the facial region images to reduce the interference from non-expression areas. Secondly, the facial image size is normalized to extract the LBP feature maps, and data augmentation is performed through affine transformation. These feature maps are then input into an improved ResNet network, which introduces squeeze and excitation attention modules and replaces the original ReLu static function with DyReLu dynamic function to enhance the features of key facial points. Finally, the LBP-ResNet algorithm is compared with several representative algorithms on CK+ and JAFFE datasets. Experimental results demonstrate that the proposed algorithm shows a better performance in facial expression recognition accuracy and generalization ability.

Jiangxi University of Water Resources and Electric Power (CN)
Openalex Percentile: Top 41%
Face and Expression Recognition
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.