Inferring Graph Signal Translations as Invariant Transformations for Classification Tasks

  title={Inferring Graph Signal Translations as Invariant Transformations for Classification Tasks},
  author={Raphael Baena and Lucas Drumetz and Vincent Gripon},
  journal={2021 29th European Signal Processing Conference (EUSIPCO)},
The field of Graph Signal Processing (GSP) has proposed tools to generalize harmonic analysis to complex domains represented through graphs. Among these tools are translations, which are required to define many others. Most works propose to define translations using solely the graph structure (i.e. edges). Such a problem is ill-posed in general as a graph conveys information about neighborhood but not about directions. In this paper, we propose to infer translations as edge-constrained… 

Figures from this paper



The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.

A neighborhood-preserving translation operator on graphs

In this paper, we introduce translation operators on graphs. Contrary to spectrally-defined translations in the framework of graph signal processing, our operators mimic neighborhood-preserving

A windowed graph Fourier transform

This paper defines generalized translation and modulation operators for signals on graphs, and uses these operators to adapt the classical windowed Fourier transform to the graph setting, enabling vertex-frequency analysis.


This work proposes MotifNet, a graph CNN capable of dealing with directed graphs by exploiting local graph motifs, and presents experimental evidence showing the advantage of the approach on real data.

Graph Signal Processing: Overview, Challenges, and Applications

An overview of core ideas in GSP and their connection to conventional digital signal processing are provided, along with a brief historical perspective to highlight how concepts recently developed build on top of prior research in other areas.

Semi-Supervised Classification with Graph Convolutional Networks

A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.

Learning local receptive fields and their weight sharing scheme on graphs

A simple and generic layer formulation is proposed that extends the properties of convolutional layers to any domain that can be described by a graph and makes it possible to learn the weights of the filter as well as a scheme that controls how they are shared across the graph.

Discrete Signal Processing on Graphs

This paper extends to signals on graphs DSP and its basic tenets, including filters, convolution, z-transform, impulse response, spectral representation, Fourier transform, frequency response, and illustrates DSP on graphs by classifying blogs, linear predicting and compressing data from irregularly located weather stations, or predicting behavior of customers of a mobile service provider.

Attention Based Pruning for Shift Networks

Shift Attention Layers are introduced, which extend SLs by using an attention mechanism that learns which shifts are the best at the same time the network function is trained, and are able to outperform vanilla SLs on various object recognition benchmarks while significantly reducing the number of float operations and parameters for the inference.

Wavelets on Graphs via Spectral Graph Theory