GCF: Graph Convolutional Networks for Facial Expression Recognition

• URL: http://arxiv.org/abs/2407.02361v1
• Date: Tue, 2 Jul 2024 15:27:33 GMT
• Title: GCF: Graph Convolutional Networks for Facial Expression Recognition
• Abstract summary: We propose Graph Convolutional Networks (CNNs) for Facial Expression Recognition (FER) GCF integrates CNNs for feature extraction, using either custom architectures or pretrained models. We evaluate GCF on benchmark datasets including CK+, JAFFE, and FERG.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Facial Expression Recognition (FER) is vital for understanding interpersonal communication. However, existing classification methods often face challenges such as vulnerability to noise, imbalanced datasets, overfitting, and generalization issues. In this paper, we propose GCF, a novel approach that utilizes Graph Convolutional Networks for FER. GCF integrates Convolutional Neural Networks (CNNs) for feature extraction, using either custom architectures or pretrained models. The extracted visual features are then represented on a graph, enhancing local CNN features with global features via a Graph Convolutional Neural Network layer. We evaluate GCF on benchmark datasets including CK+, JAFFE, and FERG. The results show that GCF significantly improves performance over state-of-the-art methods. For example, GCF enhances the accuracy of ResNet18 from 92% to 98% on CK+, from 66% to 89% on JAFFE, and from 94% to 100% on FERG. Similarly, GCF improves the accuracy of VGG16 from 89% to 97% on CK+, from 72% to 92% on JAFFE, and from 96% to 99.49% on FERG. We provide a comprehensive analysis of our approach, demonstrating its effectiveness in capturing nuanced facial expressions. By integrating graph convolutions with CNNs, GCF significantly advances FER, offering improved accuracy and robustness in real-world applications.

Related papers

• Graph Neural Networks for Misinformation Detection: Performance-Efficiency Trade-offs [9.754051234251827]
  We benchmark graph neural networks (GNNs) against non-graph-based machine learning methods.<n>All models use identical TF-IDF features to isolate the impact of relational structure.<n>GNNs consistently outperform non-graph baselines across all datasets.
  arXiv  Detail & Related papers  (2026-04-09T11:48:00Z)
• Enhancing Federated Graph Learning via Adaptive Fusion of Structural and Node Characteristics [26.619187557486708]
  Federated Graph Learning (FGL) has demonstrated the advantage of training a global Graph Neural Network (GNN) model across distributed clients.<n>We propose a novel FGL framework, named FedGCF, which aims to simultaneously extract and fuse structural properties and node features.
  arXiv  Detail & Related papers  (2024-12-25T09:20:06Z)
• Is Graph Convolution Always Beneficial For Every Feature? [14.15740180531667]
  Topological Feature Informativeness (TFI) is a novel metric to distinguish between GNN-favored and GNN-disfavored features. We propose a simple yet effective Graph Feature Selection (GFS) method, which processes GNN-favored and GNN-disfavored features separately.
  arXiv  Detail & Related papers  (2024-11-12T09:28:55Z)
• FourierKAN-GCF: Fourier Kolmogorov-Arnold Network -- An Effective and Efficient Feature Transformation for Graph Collaborative Filtering [16.894095429454598]
  We propose a simple and effective graph-based recommendation model called FourierKAN-GCF. We employ message dropout and node dropout strategies to improve the representation power and robustness of the model.
  arXiv  Detail & Related papers  (2024-06-03T06:36:04Z)
• How Does Message Passing Improve Collaborative Filtering? [49.019075781827034]
  Collaborative filtering (CF) has exhibited prominent results for recommender systems and been broadly utilized for real-world applications. Message passing helps CF methods in a manner akin to its benefits for graph-based learning tasks in general. We present Test-time Aggregation for CF, a test-time augmentation framework that only conducts message passing once at inference time.
  arXiv  Detail & Related papers  (2024-03-27T18:53:04Z)
• Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
  We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs) In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together. Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
  arXiv  Detail & Related papers  (2023-12-19T18:00:15Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Adaptive Graph-Based Feature Normalization for Facial Expression Recognition [1.2246649738388389]
  We propose an Adaptive Graph-based Feature Normalization (AGFN) method to protect Facial Expression Recognition models from data uncertainties. Our method outperforms state-of-the-art works with accuracies of 91.84% and 91.11% on benchmark datasets.
  arXiv  Detail & Related papers  (2022-07-22T14:57:56Z)
• TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernels [141.29156234353133]
  State-of-the-art convex learning methods can perform far worse than their centralized counterparts when clients have dissimilar data distributions. We show this disparity can largely be attributed to challenges presented by non-NISTity. We propose a Train-Convexify neural network (TCT) procedure to sidestep this issue.
  arXiv  Detail & Related papers  (2022-07-13T16:58:22Z)
• SCGC : Self-Supervised Contrastive Graph Clustering [1.1470070927586016]
  Graph clustering discovers groups or communities within networks. Deep learning methods such as autoencoders cannot incorporate rich structural information. We propose Self-Supervised Contrastive Graph Clustering (SCGC)
  arXiv  Detail & Related papers  (2022-04-27T01:38:46Z)
• How Powerful is Graph Convolution for Recommendation? [21.850817998277158]
  Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms for collaborative filtering (CF) In this paper, we endeavor to obtain a better understanding of GCN-based CF methods via the lens of graph signal processing.
  arXiv  Detail & Related papers  (2021-08-17T11:38:18Z)
• VOLO: Vision Outlooker for Visual Recognition [148.12522298731807]
  Vision transformers (ViTs) have shown great potential of self-attention based models in ImageNet classification. We introduce a novel outlook attention and present a simple and general architecture, termed Vision Outlooker (VOLO) Unlike self-attention that focuses on global dependency modeling at a coarse level, the outlook attention efficiently encodes finer-level features and contexts into tokens. Experiments show that our VOLO achieves 87.1% top-1 accuracy on ImageNet-1K classification, which is the first model exceeding 87% accuracy on this competitive benchmark.
  arXiv  Detail & Related papers  (2021-06-24T15:46:54Z)
• Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
  We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training. FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
  arXiv  Detail & Related papers  (2020-10-19T21:51:47Z)

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.