Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Discrete Signal Processing on Graphs: Sampling Theory
- Dynamical sampling
- Dynamical sampling: time-space trade-off
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Graph signal sampling and interpolation based on clusters and averages
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Kernel based reconstruction for generalized graph signal processing
- Learning Laplacian Matrix in Smooth Graph Signal Representations
- Quadrature formulas on combinatorial graphs
- Random sampling of bandlimited signals on graphs
- Reconstruction of Graph Signals Through Percolation from Seeding Nodes
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Signal Recovery on Graphs: Variation Minimization
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
This page was built for publication: Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934698)