Greedy Sampling of Graph Signals

by   Luiz F. O. Chamon, et al.

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.


page 1

page 2

page 3

page 4


Approximate Supermodularity Bounds for Experimental Design

This work provides performance guarantees for the greedy solution of exp...

Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation

We study the problem of sampling a bandlimited graph signal in the prese...

Sampling of graph signals via randomized local aggregations

Sampling of signals defined over the nodes of a graph is one of the cruc...

Bayesian Design of Sampling Set for Bandlimited Graph Signals

The design of sampling set (DoS) for bandlimited graph signals (GS) has ...

Sparse Sampling for Inverse Problems with Tensors

We consider the problem of designing sparse sampling strategies for mult...

Graph Normalized-LMP Algorithm for Signal Estimation Under Impulsive Noise

In this paper, we introduce an adaptive graph normalized least mean pth ...

Sampling and Reconstruction of Signals on Product Graphs

In this paper, we consider the problem of subsampling and reconstruction...

Please sign up or login with your details

Forgot password? Click here to reset