Stable and Robust Sampling Strategies for Compressive Imaging
From MaRDI portal
Publication:4591952
Abstract: In many signal processing applications, one wishes to acquire images that are sparse in transform domains such as spatial finite differences or wavelets using frequency domain samples. For such applications, overwhelming empirical evidence suggests that superior image reconstruction can be obtained through variable density sampling strategies that concentrate on lower frequencies. The wavelet and Fourier transform domains are not incoherent because low-order wavelets and low-order frequencies are correlated, so compressive sensing theory does not immediately imply sampling strategies and reconstruction guarantees. In this paper we turn to a more refined notion of coherence -- the so-called local coherence -- measuring for each sensing vector separately how correlated it is to the sparsity basis. For Fourier measurements and Haar wavelet sparsity, the local coherence can be controlled and bounded explicitly, so for matrices comprised of frequencies sampled from a suitable inverse square power-law density, we can prove the restricted isometry property with near-optimal embedding dimensions. Consequently, the variable-density sampling strategy we provide allows for image reconstructions that are stable to sparsity defects and robust to measurement noise. Our results cover both reconstruction by -minimization and by total variation minimization. The local coherence framework developed in this paper should be of independent interest in sparse recovery problems more generally, as it implies that for optimal sparse recovery results, it suffices to have bounded emph{average} coherence from sensing basis to sparsity basis -- as opposed to bounded maximal coherence -- as long as the sampling strategy is adapted accordingly.
Cited in
(46)- Random sampling of bandlimited signals on graphs
- Compressed sensing with structured sparsity and structured acquisition
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
- Robust non-parametric regression via incoherent subspace projections
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Compressive isogeometric analysis
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Quantization of compressive samples with stable and robust recovery
- Compressive sampling and \(\ell_1\) minimization for SAR imaging with low sampling rate
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems
- The gap between the null space property and the restricted isometry property
- Breaking the coherence barrier: a new theory for compressed sensing
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- A novel compressed sensing scheme for photoacoustic tomography
- Compressive sensing with redundant dictionaries and structured measurements
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Cosparsity in Compressed Sensing
- A theoretical study of compressed solving for advection-diffusion-reaction problems
- Binary Codification Design for Compressive Imaging by Uniform Sensing
- Optimal compressive imaging of Fourier data
- Structured random measurements in signal processing
- _1-_2 minimization methods for signal and image reconstruction with impulsive noise removal
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Shearlet Enhanced Snapshot Compressive Imaging
- Model reduction for transport-dominated problems via online adaptive bases and adaptive sampling
- A compressive spectral collocation method for the diffusion equation under the restricted isometry property
- On the role of total variation in compressed sensing
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- On the generation of sampling schemes for magnetic resonance imaging
- Total variation reconstruction from quadratic measurements
- Importance sampling in signal processing applications
- Compressive time-of-flight 3D imaging using block-structured sensing matrices
- Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Embracing off-the-grid samples
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Enhanced total variation minimization for stable image reconstruction
- Sparse flow reconstruction methods to reduce the costs of analyzing large unsteady datasets
- Sampling in the analysis transform domain
This page was built for publication: Stable and Robust Sampling Strategies for Compressive Imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591952)
