Adapted variable density subsampling for compressed sensing
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- A Probabilistic and RIPless Theory of Compressed Sensing
- An Analysis of Block Sampling Strategies in Compressed Sensing
- Asymptotic Theory of Rejective Sampling with Varying Probabilities from a Finite Population
- Breaking the coherence barrier: a new theory for compressed sensing
- Compressed sensing
- Compressed Sensing and Parallel Acquisition
- Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class
- Compressed sensing with structured sparsity and structured acquisition
- Compressive imaging: structure, sampling, learning. With contributions by Vegard Antun
- Compressive sensing and structured random matrices
- NESTA: A fast and accurate first-order method for sparse recovery
- On oracle-type local recovery guarantees in compressed sensing
- On some extensions of Bernstein's inequality for self-adjoint operators
- On Sparse Representations in Arbitrary Redundant Bases
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Smooth minimization of non-smooth functions
- Stable recovery of sparse overcomplete representations in the presence of noise
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- User-friendly tail bounds for sums of random matrices
- Variable density sampling with continuous trajectories
- Über eine Modifikation der Ungleichung von Tschebyscheff und über die Abweichung der Laplaceschen Formel.
This page was built for publication: Adapted variable density subsampling for compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962872)
