Graph Signal Processing: Overview, Challenges and Applications

Abstract

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.

To appear, Proceedings of the IEEE

References in corpus (10)

• Discrete Signal Processing on Graphs
• Prediction and predictability of global epidemics: the role of the airline transportation network
• Stationary Graph Processes and Spectral Estimation
• Learning shape correspondence with anisotropic convolutional neural networks
• Spectral Domain Sampling of Graph Signals
• Spectral Projector-Based Graph Fourier Transforms
• Spectral bandits for smooth graph functions
• Multiresolution Representations for Piecewise-Smooth Signals on Graphs
• Localization bounds for the graph translation
• Functional Alignment with Anatomical Networks is Associated with Cognitive Flexibility

Cited by in corpus (5)

• Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations
• Blind Identification of Invertible Graph Filters with Multiple Sparse Inputs
• Blind Community Detection from Low-rank Excitations of a Graph Filter
• Local Frequency Interpretation and Non-Local Self-Similarity on Graph for Point Cloud Inpainting
• Free-breathing cardiac MRI using bandlimited manifold modelling