Sampling and Recovery of Graph Signals
Not on the map. Why?
Abstract (arXiv)
The aim of this chapter is to give an overview of the recent advances related to sampling and recovery of signals defined over graphs. First, we illustrate the conditions for perfect recovery of bandlimited graph signals from samples collected over a selected set of vertexes. Then, we describe some sampling design criteria proposed in the literature to mitigate the effect of noise and model mismatching when performing graph signal recovery. Finally, we illustrate algorithms and optimal sampling strategies for adaptive recovery and tracking of dynamic graph signals, where both sampling set and signal values are allowed to vary with time. Numerical simulations carried out over both synthetic and real data illustrate the potential advantages of graph signal processing methods for sampling, interpolation, and tracking of signals observed over irregular domains such as, e.g., technological or biological networks.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Dec 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 1; 2026: 1.
5 papers.
- 2021Temporal Graph Signal Decompositioncited by 8
- 2022Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphscited by 8
- 2024Sampling and Uniqueness Sets in Graphon Signal Processingcited by 5
- 2025Topological Dictionary Learningcited by 4
- 2026Sheaf-theoretic Signal Processing on Graphs: Spectral Theory, Filtering, and Samplingcited by 0
- 2026Sheaf-theoretic Signal Processing on Graphs: Spectral Theory, Filtering, and Sampling2 Aug 2026
- 2025Topological Dictionary Learning14 Mar 2025
- 2024Sampling and Uniqueness Sets in Graphon Signal Processing11 Jan 2024
- 2022Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs15 Dec 2022
- 2021Temporal Graph Signal Decomposition25 Jun 2021