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

  title={The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains},
  author={David I. Shuman and Sunil K. Narang and Pascal Frossard and Antonio Ortega and Pierre Vandergheynst},
  journal={IEEE Signal Processing Magazine},
In applications such as social, energy, transportation, sensor, and neuronal networks, high-dimensional data naturally reside on the vertices of weighted graphs. The emerging field of signal processing on graphs merges algebraic and spectral graph theoretic concepts with computational harmonic analysis to process such signals on graphs. In this tutorial overview, we outline the main challenges of the area, discuss different ways to define graph spectral domains, which are the analogs to the… 

Figures from this paper

Graph Signal Processing - Part I: Graphs, Graph Spectra, and Spectral Clustering

This work revisits graph topologies from a Data Analytics point of view, and establishes a taxonomy of graph networks through a linear algebraic formalism of graph topology (vertices, connections, directivity) which serves as a basis for spectral analysis of graphs.

Data Science with Graphs: A Signal Processing Perspective

This thesis considers five fundamental tasks on graphs from the perspective of graph signal processing: representation, sampling, recovery, detection and localization, and illustrates the power of the proposed tools on two real-world problems: fast resampling of 3D point clouds and mining of urban traffic data.

Signal Processing on Signed Graphs: Fundamentals and Potentials

GSP uses tools from linear algebra, (spectral) graph theory, computational harmonic analysis, and optimization theory to extend conventional signal processing concepts to data located on irregular domains that are characterized by graphs (networks).

A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs

This paper aims to elevate the notion of joint harmonic analysis to a full-fledged framework denoted as time-vertex signal processing, that links together the time-domain signal processing techniques with the new tools of graph signal processing.

Vertex-frequency graph signal processing: A comprehensive review

Distributed Graph Filters

This thesis proposes distributed graph filters that converge fast, even in the presence of dynamics, and sets the foundations of distributed scale-invariant analysis of graph signals.

Vertex-Frequency Graph Signal Processing: A review

A localized form of the graph Fourier transform is presented and an analogy with classical signal processing is established through the concept of local smoothness, which is subsequently related to the particular paradigm of signal smoothness on graphs.

A non-commutative viewpoint on graph signal processing

This article investigates a new approach to develop concepts of Fourier analysis for graphs that is inspired by the theory of non-commutative harmonic analysis, and is founded upon the representation theory ofnon-Abelian groups.

Discrete Signal Processing on Graphs: Frequency Analysis

A definition of total variation for graph signals that naturally leads to a frequency ordering on graphs is proposed and defines low-, high-, and band-pass graph signals and filters.



Multiscale Wavelets on Trees, Graphs and High Dimensional Data: Theory and Applications to Semi Supervised Learning

It is proved that in analogy to the Euclidean case, function smoothness with respect to a specific metric induced by the tree is equivalent to exponential rate of coefficient decay, that is, to approximate sparsity, which readily translate to simple practical algorithms for various learning tasks.

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.

Uncertainty principles for signals defined on graphs: Bounds and characterizations

  • Ameya AgaskarYue M. Lu
  • Computer Science, Mathematics
    2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2012
This paper describes the notions of “spread” in the graph and spectral domains, using the eigenvectors of the graph Laplacian as a surrogate Fourier basis and describes how to find signals that, among all signals with the same spectral spread, have the smallest graph spread about a given vertex.


Time series of graphs arise in a variety of applications, from the analysis of network traffic to time-dependent data sets to social networks. We introduce novel techniques for measuring distances

Diffusion-driven multiscale analysis on manifolds and graphs: top-down and bottom-up constructions

A novel multiscale construction is introduced, based on a top-down recursive partitioning induced by the eigenfunctions of the Laplacian, which yields associated local cosine packets on manifolds, generalizing local cosines in Euclidean spaces.

Multiscale methods for data on graphs and irregular multidimensional situations

Summary.  For regularly spaced one‐dimensional data, wavelet shrinkage has proven to be a compelling method for non‐parametric function estimation. We create three new multiscale methods that provide

Wavelets on Graphs via Spectral Graph Theory

Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data

This work proposes the construction of two-channel wavelet filter banks for analyzing functions defined on the vertices of any arbitrary finite weighted undirected graph, and proposes quadrature mirror filters for bipartite graph which cancel aliasing and lead to perfect reconstruction.

Graph wavelets for spatial traffic analysis

  • M. CrovellaE. Kolaczyk
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
A number of problems in network operations and engineering call for new methods of traffic analysis. While most existing traffic analysis methods are fundamentally temporal, there is a clear need for

Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing

A nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing, which leads to a family of simple and fast nonlinear processing methods based on the weighted -Laplace operator, parameterized by the degree of regularity, the graph structure and the graph weight function.