Stationary Signal Processing on Graphs

DOI10.1109/TSP.2017.2690388MaRDI QIDQ4628064zbMATH OpenOpenAlexFDO

Authors Nathanaël Perraudin, P. Vandergheynst

Publication date 6 March 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.02522

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or networks. In this paper, we generalize the traditional concept of wide sense stationarity to signals defined over the vertices of arbitrary weighted undirected graphs. We show that stationarity is expressed through the graph localization operator reminiscent of translation. We prove that stationary graph signals are characterized by a well-defined Power Spectral Density that can be efficiently estimated even for large graphs. We leverage this new concept to derive Wiener-type estimation procedures of noisy and partially observed signals and illustrate the performance of this new model for denoising and regression.

Cited in

(15)

• Localized Fourier analysis for graph signal processing
• Propagation on multi-relational graphs for node regression
• Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
• scientific article; zbMATH DE number 4199579 (Why is no real title available?)
• Discrete Signal Processing on Graphs
• Extending Classical Multirate Signal Processing Theory to Graphs—Part I: Fundamentals
• On the dual geometry of Laplacian eigenfunctions
• Signal Processing on Simplicial Complexes
• Data Analytics on Graphs Part II: Signals on Graphs
• Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
• A class of doubly stochastic shift operators for random graph signals and their boundedness
• Continuous-time random walks and temporal networks
• Extreme values of the Fiedler vector on trees
• The optimal causal linear predictor is not Turing computable
• Barron space for graph convolutional neural networks

This page was built for publication: Stationary Signal Processing on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628064)