Action Recognition with Kernel-based Graph Convolutional Networks
- URL: http://arxiv.org/abs/2012.14186v1
- Date: Mon, 28 Dec 2020 11:02:51 GMT
- Title: Action Recognition with Kernel-based Graph Convolutional Networks
- Authors: Hichem Sahbi
- Abstract summary: Learning graph convolutional networks (GCNs) aims at generalizing deep learning to arbitrary non-regular domains.
We introduce a novel GCN framework that achieves spatial graph convolution in a reproducing kernel Hilbert space (RKHS)
The particularity of our GCN model also resides in its ability to achieve convolutions without explicitly realigning nodes in the receptive fields of the learned graph filters with those of the input graphs.
- Score: 14.924672048447338
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Learning graph convolutional networks (GCNs) is an emerging field which aims
at generalizing deep learning to arbitrary non-regular domains. Most of the
existing GCNs follow a neighborhood aggregation scheme, where the
representation of a node is recursively obtained by aggregating its neighboring
node representations using averaging or sorting operations. However, these
operations are either ill-posed or weak to be discriminant or increase the
number of training parameters and thereby the computational complexity and the
risk of overfitting. In this paper, we introduce a novel GCN framework that
achieves spatial graph convolution in a reproducing kernel Hilbert space
(RKHS). The latter makes it possible to design, via implicit kernel
representations, convolutional graph filters in a high dimensional and more
discriminating space without increasing the number of training parameters. The
particularity of our GCN model also resides in its ability to achieve
convolutions without explicitly realigning nodes in the receptive fields of the
learned graph filters with those of the input graphs, thereby making
convolutions permutation agnostic and well defined. Experiments conducted on
the challenging task of skeleton-based action recognition show the superiority
of the proposed method against different baselines as well as the related work.
Related papers
- Scalable Graph Compressed Convolutions [68.85227170390864]
We propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution.
Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning.
arXiv Detail & Related papers (2024-07-26T03:14:13Z) - Efficient Graph Similarity Computation with Alignment Regularization [7.143879014059894]
Graph similarity computation (GSC) is a learning-based prediction task using Graph Neural Networks (GNNs)
We show that high-quality learning can be attained with a simple yet powerful regularization technique, which we call the Alignment Regularization (AReg)
In the inference stage, the graph-level representations learned by the GNN encoder are directly used to compute the similarity score without using AReg again to speed up inference.
arXiv Detail & Related papers (2024-06-21T07:37:28Z) - Degree-based stratification of nodes in Graph Neural Networks [66.17149106033126]
We modify the Graph Neural Network (GNN) architecture so that the weight matrices are learned, separately, for the nodes in each group.
This simple-to-implement modification seems to improve performance across datasets and GNN methods.
arXiv Detail & Related papers (2023-12-16T14:09:23Z) - Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural
Networks [52.566735716983956]
We propose a graph gradual pruning framework termed CGP to dynamically prune GNNs.
Unlike LTH-based methods, the proposed CGP approach requires no re-training, which significantly reduces the computation costs.
Our proposed strategy greatly improves both training and inference efficiency while matching or even exceeding the accuracy of existing methods.
arXiv Detail & Related papers (2022-07-18T14:23:31Z) - A Variational Edge Partition Model for Supervised Graph Representation
Learning [51.30365677476971]
This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities.
We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs.
A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
arXiv Detail & Related papers (2022-02-07T14:37:50Z) - Learning Connectivity with Graph Convolutional Networks for
Skeleton-based Action Recognition [14.924672048447338]
We introduce a novel framework for graph convolutional networks that learns the topological properties of graphs.
The design principle of our method is based on the optimization of a constrained objective function.
Experiments conducted on the challenging task of skeleton-based action recognition shows the superiority of the proposed method.
arXiv Detail & Related papers (2021-12-06T19:43:26Z) - Spectral-Spatial Global Graph Reasoning for Hyperspectral Image
Classification [50.899576891296235]
Convolutional neural networks have been widely applied to hyperspectral image classification.
Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
arXiv Detail & Related papers (2021-06-26T06:24:51Z) - Non-Recursive Graph Convolutional Networks [33.459371861932574]
We propose a novel architecture named Non-Recursive Graph Convolutional Network (NRGCN) to improve both the training efficiency and the learning performance of GCNs.
NRGCN represents different hops of neighbors for each node based on inner-layer aggregation and layer-independent sampling.
In this way, each node can be directly represented by concatenating the information extracted independently from each hop of its neighbors.
arXiv Detail & Related papers (2021-05-09T08:12:18Z) - Skeleton-based Hand-Gesture Recognition with Lightweight Graph
Convolutional Networks [14.924672048447338]
Graph convolutional networks (GCNs) aim at extending deep learning to arbitrary irregular domains, such as graphs.
We introduce a novel method that learns the topology of input graphs as a part of GCN design.
Experiments conducted on the challenging task of skeleton-based hand-gesture recognition show the high effectiveness of the learned GCNs.
arXiv Detail & Related papers (2021-04-09T09:06:53Z) - Infinitely Wide Graph Convolutional Networks: Semi-supervised Learning
via Gaussian Processes [144.6048446370369]
Graph convolutional neural networks(GCNs) have recently demonstrated promising results on graph-based semi-supervised classification.
We propose a GP regression model via GCNs(GPGC) for graph-based semi-supervised learning.
We conduct extensive experiments to evaluate GPGC and demonstrate that it outperforms other state-of-the-art methods.
arXiv Detail & Related papers (2020-02-26T10:02:32Z)
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.