Random sampling of bandlimited signals on graphs

Abstract : We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure, and its performance depends on a parameter called the graph coherence. On the contrary, the second strategy is adaptive but yields optimal results. Indeed, no more than O(k log(k)) measurements are sufficient to ensure an accurate and stable recovery of all k-bandlimited signals. This second strategy is based on a careful choice of the sampling distribution, which can be estimated quickly. Then, we propose a computationally efficient decoder to reconstruct k-bandlimited signals from their samples. We prove that it yields accurate reconstructions and that it is also stable to noise. Finally, we conduct several experiments to test these techniques. [Code available at http://grsamplingbox.gforge.inria.fr/]
Document type :
Journal articles
Complete list of metadatas

Cited literature [64 references]  Display  Hide  Download

https://hal.inria.fr/hal-01229578
Contributor : Gilles Puy <>
Submitted on : Wednesday, July 27, 2016 - 6:10:15 PM
Last modification on : Thursday, February 7, 2019 - 5:11:10 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Gilles Puy, Nicolas Tremblay, Rémi Gribonval, Pierre Vandergheynst. Random sampling of bandlimited signals on graphs. Applied and Computational Harmonic Analysis, Elsevier, 2016, ⟨10.1016/j.acha.2016.05.005⟩. ⟨hal-01229578v3⟩

Share

Metrics

Record views

1168

Files downloads

1093