Graph Signal Sampling Under Stochastic Priors
arXiv:2206.00382 · doi:10.1109/TSP.2023.3267990
Abstract
We propose a generalized sampling framework for stochastic graph signals. Stochastic graph signals are characterized by graph wide sense stationarity (GWSS) which is an extension of wide sense stationarity (WSS) for standard time-domain signals. In this paper, graph signals are assumed to satisfy the GWSS conditions and we study their sampling as well as recovery procedures. In generalized sampling, a correction filter is inserted between sampling and reconstruction operators to compensate for non-ideal measurements. We propose a design method for the correction filters to reduce the mean-squared error (MSE) between original and reconstructed graph signals. We derive the correction filters for two cases: The reconstruction filter is arbitrarily chosen or predefined. The proposed framework allows for arbitrary sampling methods, i.e., sampling in the vertex or graph frequency domain. We also show that the graph spectral response of the resulting correction filter parallels that for generalized sampling for WSS signals if sampling is performed in the graph frequency domain. Furthermore, we reveal the theoretical connection between the proposed and existing correction filters. The effectiveness of our approach is validated via experiments by comparing its MSE with existing approaches.
References in corpus (28)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Geometric deep learning: going beyond Euclidean data
- Discrete Signal Processing on Graphs: Sampling Theory
- Learning graphs from data: A signal representation perspective
- Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signals on Graphs: Uncertainty Principle and Sampling
- Sampling of graph signals with successive local aggregations
- GSPBOX: A toolbox for signal processing on graphs
- Stationary signal processing on graphs
- Stationary Graph Processes and Spectral Estimation
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- A Spectral Graph Uncertainty Principle
- Sampling Signals on Graphs: From Theory to Applications
- Greedy Sampling of Graph Signals
- Eigendecomposition-Free Sampling Set Selection for Graph Signals
- Reconstruction of Graph Signals through Percolation from Seeding Nodes
- Spectral Domain Sampling of Graph Signals
- Two-Channel Critically-Sampled Graph Filter Banks With Spectral Domain Sampling
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- A Sampling Theory Perspective of Graph-based Semi-supervised Learning
- A-Optimal Sampling and Robust Reconstruction for Graph Signals via Truncated Neumann Series
- Graph Signal Restoration Using Nested Deep Algorithm Unrolling
- Graph Signal Processing: Modulation, Convolution, and Sampling
- Multiresolution Representations for Piecewise-Smooth Signals on Graphs
- Wide-Sense Stationarity in Generalized Graph Signal Processing
- Unitary Shift Operators on a Graph
- Sampling and Recovery of Graph Signals based on Graph Neural Networks