Design of Sampling Set for Bandlimited Graph Signal Estimation
arXiv:1711.07345
Abstract
It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard. We formularize the problem as the experimental design of a linear regression model if we allow multiple measurements on a single node. By relaxing it to a convex optimization problem, we get the proportion of sample for each node given the budget of total sample size. Then, we use a probabilistic quantization to get the number of each node to be sampled. Moreover, we analyze how the sample size influences whether our object function is well-defined by perturbation analysis. Finally, we demonstrate the performance of the proposed approach through various numerical experiments.
arXiv commentGlobalSIP 2017
References in corpus (9)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- 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
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs