Greedy Sampling of Graph Signals
arXiv:1704.01223 · doi:10.1109/TSP.2017.2755586
Abstract
Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a sampling set non-trivial and hard to analyze. Indeed, though conditions for graph signal interpolation from noiseless samples exist, they do not lead to a unique sampling set. The presence of noise makes choosing among these sampling sets a hard combinatorial problem. Although greedy sampling schemes are commonly used in practice, they have no performance guarantee. This work takes a twofold approach to address this issue. First, universal performance bounds are derived for the Bayesian estimation of graph signals from noisy samples. In contrast to currently available bounds, they are not restricted to specific sampling schemes and hold for any sampling sets. Second, this paper provides near-optimal guarantees for greedy sampling by introducing the concept of approximate submodularity and updating the classical greedy bound. It then provides explicit bounds on the approximate supermodularity of the interpolation mean-square error showing that it can be optimized with worst-case guarantees using greedy search even though it is not supermodular. Simulations illustrate the derived bound for different graph models and show an application of graph signal sampling to reduce the complexity of kernel principal component analysis.
14 pages, 14 figures. Accepted for publication on IEEE Transactions on Signal Processing
References in corpus (4)
Cited by in corpus (33)
- Graph Learning: A Survey
- Fast Resampling of 3D Point Clouds via Graphs
- Sampling Signals on Graphs: From Theory to Applications
- Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
- Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment
- Low-complexity Graph Sampling with Noise and Signal Reconstruction via Neumann Series
- Graphon Signal Processing
- Localized Linear Regression in Networked Data
- A-Optimal Sampling and Robust Reconstruction for Graph Signals via Truncated Neumann Series
- Graph Signal Sampling Under Stochastic Priors
- Controllability of Bandlimited Graph Processes Over Random Time Varying Graphs
- Sampling of graph signals via randomized local aggregations
- Graph-signal Reconstruction and Blind Deconvolution for Structured Inputs
- Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift
- Observing and Tracking Bandlimited Graph Processes
- Graph Signal Processing: Modulation, Convolution, and Sampling
- Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach
- On the Duality between Network Flows and Network Lasso
- Task-Based Graph Signal Compression
- On the Supermodularity of Active Graph-based Semi-supervised Learning with Stieltjes Matrix Regularization
- A Bayesian Perspective on Uncertainty Quantification for Estimated Graph Signals
- Robust recovery of bandlimited graph signals via randomized dynamical sampling
- Optimal Sampling for Dynamic Complex Networks with Graph-Bandlimited Initialization
- Bayesian Design of Sampling Set for Bandlimited Graph Signals
- On Critical Sampling of Time-Vertex Graph Signals
- Neural Network Approximation of Graph Fourier Transforms for Sparse Sampling of Networked Flow Dynamics
- Recursive Prediction of Graph Signals with Incoming Nodes
- Sampling Policy Design for Tracking Time-Varying Graph Signals with Adaptive Budget Allocation
- Reconstruction-Cognizant Graph Sampling using Gershgorin Disc Alignment
- A Novel Scheme for Support Identification and Iterative Sampling of Bandlimited Graph Signals
- Fast sensor placement by enlarging principle submatrix for large-scale linear inverse problems
- Joint Forecasting and Interpolation of Graph Signals Using Deep Learning
- Estimating Network Processes via Blind Identification of Multiple Graph Filters