Random sampling of bandlimited signals on graphs
From MaRDI portal
Publication:1690709
DOI10.1016/j.acha.2016.05.005zbMath1391.94367arXiv1511.05118OpenAlexW2179147795MaRDI QIDQ1690709
Rémi Gribonval, Gilles Puy, Pierre Vandergheynst, Nicolas Tremblay
Publication date: 12 January 2018
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05118
Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15) Sampling theory in information and communication theory (94A20)
Related Items
Approximation theorems on graphs, Graph signal sampling and interpolation based on clusters and averages, Unnamed Item, Graph signal interpolation with positive definite graph basis functions, Data Analytics on Graphs Part II: Signals on Graphs, Overview of the topical collection: harmonic analysis on combinatorial graphs, Sampling and reconstruction of concentrated reproducing kernel signals in mixed Lebesgue spaces, Random sampling in multi-window quasi shift-invariant spaces, Approximating Spectral Clustering via Sampling: A Review, A low discrepancy sequence on graphs, Unnamed Item, Localized Fourier analysis for graph signal processing, Spatio–Spectral Limiting on Redundant Cubes: A Case Study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Sampling, filtering and sparse approximations on combinatorial graphs
- Wavelets on graphs via spectral graph theory
- User-friendly tail bounds for sums of random matrices
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing with structured sparsity and structured acquisition
- Mysteries around the graph Laplacian eigenvalue 4
- Active Learning
- Efficient estimation of eigenvalue counts in an interval
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- An Analysis of Block Sampling Strategies in Compressed Sensing
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Randomized Algorithms for Matrices and Data
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Sampling algorithms for l2 regression and applications
- Relative-Error $CUR$ Matrix Decompositions
- Reconstruction Algorithms in Irregular Sampling
- A Novel Sampling Theorem on the Sphere
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Downsampling of Signals on Graphs Via Maximum Spanning Trees
- Stable and Robust Sampling Strategies for Compressive Imaging
- A Multiscale Pyramid Transform for Graph Signals
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Subgraph-Based Filterbanks for Graph Signals
- Sampling-50 years after Shannon
- Sparsity and incoherence in compressive sampling
- A Spectral Graph Uncertainty Principle
- Networks
