Coherence pattern-guided compressive sensing with unresolved grids
From MaRDI portal
algorithmband exclusionbasis pursuitcoherence band exclusioncompressed sensingcontinuum imaging problemdynamic rangegridding erroriterative hard thresholdingLassolocal optimizationmodel mismatchnoise stabilityorthogonal matching pursuitradar and medical imagingregularizationresolutionsparsitysubspace pursuit
Abstract: Highly coherent sensing matrices arise in discretization of continuum imaging problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold. Algorithms based on techniques of band exclusion (BE) and local optimization (LO) are proposed to deal with such coherent sensing matrices. These techniques are embedded in the existing compressed sensing algorithms such as Orthogonal Matching Pursuit (OMP), Subspace Pursuit (SP), Iterative Hard Thresholding (IHT), Basis Pursuit (BP) and Lasso, and result in the modified algorithms BLOOMP, BLOSP, BLOIHT, BP-BLOT and Lasso-BLOT, respectively. Under appropriate conditions, it is proved that BLOOMP can reconstruct sparse, widely separated objects up to one Rayleigh length in the Bottleneck distance {em independent} of the grid spacing. One of the most distinguishing attributes of BLOOMP is its capability of dealing with large dynamic ranges. The BLO-based algorithms are systematically tested with respect to four performance metrics: dynamic range, noise stability, sparsity and resolution. With respect to dynamic range and noise stability, BLOOMP is the best performer. With respect to sparsity, BLOOMP is the best performer for high dynamic range while for dynamic range near unity BP-BLOT and Lasso-BLOT with the optimized regularization parameter have the best performance. In the noiseless case, BP-BLOT has the highest resolving power up to certain dynamic range. The algorithms BLOSP and BLOIHT are good alternatives to BLOOMP and BP/Lasso-BLOT: they are faster than both BLOOMP and BP/Lasso-BLOT and shares, to a lesser degree, BLOOMP's amazing attribute with respect to dynamic range. Detailed comparisons with existing algorithms such as Spectral Iterative Hard Thresholding (SIHT) and the frame-adapted BP are given.
Recommendations
- Compressed sensing with coherent and redundant dictionaries
- Cosparsity in Compressed Sensing
- Frames for compressed sensing using coherence
- Breaking the coherence barrier: a new theory for compressed sensing
- Guaranteed sparse signal recovery with highly coherent sensing matrices
- An unbiased approach to compressed sensing
- Sparsity and incoherence in compressive sampling
- Compressed sensing with structured sparsity and structured acquisition
- Compressed sensing
- Compressed sensing
Cited in
(42)- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Fast L1-L2 minimization via a proximal operator
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- BLOOMP
- IDENT: identifying differential equations with numerical time evolution
- A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference
- Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain
- Spectral compressive sensing
- Sensor calibration for off-the-grid spectral estimation
- Greedy signal space methods for incoherence and beyond
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- Stable super-resolution limit and smallest singular value of restricted Fourier matrices
- Approximate super-resolution of positive measures in all dimensions
- A novel regularization based on the error function for sparse recovery
- The geometry of off-the-grid compressed sensing
- Resolution analysis of imaging with _1 optimization
- Synthetic aperture imaging of direction- and frequency-dependent reflectivities
- Adventures in compressive sensing based MIMO radar
- Global testing against sparse alternatives in time-frequency analysis
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Coherent imaging without phases
- Point source super-resolution via non-convex \(L_1\) based methods
- Super-resolution from noisy data
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- _1-_2 minimization methods for signal and image reconstruction with impulsive noise removal
- A three-operator splitting algorithm for nonconvex sparsity regularization
- The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
- The Noise Collector for sparse recovery in high dimensions
- Generalized sampling and infinite-dimensional compressed sensing
- A Scale-Invariant Approach for Sparse Signal Recovery
- Imaging with highly incomplete and corrupted data
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Towards a Mathematical Theory of Super‐resolution
- A note on spike localization for line spectrum estimation
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
- Sorted \(L_1/L_2\) minimization for sparse signal recovery
- Sparse recovery: the square of _1/_2 norms
- Sparse identification of nonlocal interaction kernels in nonlinear gradient flow equations via partial inversion
- Analysis of sparse MIMO radar
- Exact support recovery for sparse spikes deconvolution
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
This page was built for publication: Coherence pattern-guided compressive sensing with unresolved grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912267)
