Bayesian Design of Sampling Set for Bandlimited Graph Signals

Abstract

The design of sampling set (DoS) for bandlimited graph signals (GS) has been extensively studied in recent years, but few of them exploit the benefits of the stochastic prior of GS. In this work, we introduce the optimization framework for Bayesian DoS of bandlimited GS. We also illustrate how the choice of different sampling sets affects the estimation error and how the prior knowledge influences the result of DoS compared with the non-Bayesian DoS by the aid of analyzing Gershgorin discs of error metric matrix. Finally, based on our analysis, we propose a heuristic algorithm for DoS to avoid solving the optimization problem directly.

arXiv commentAccepted by GloalSIP2019

References in corpus (8)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Discrete Signal Processing on Graphs: Sampling Theory
• Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
• Stationary signal processing on graphs
• Stationary Graph Processes and Spectral Estimation
• Greedy Sampling of Graph Signals
• Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
• Eigendecomposition-Free Sampling Set Selection for Graph Signals