The Noise Collector for sparse recovery in high dimensions
From MaRDI portal
Publication:5073060
DOI10.1073/pnas.1913995117zbMath1485.94042arXiv1908.04412OpenAlexW3023172980WikidataQ94561441 ScholiaQ94561441MaRDI QIDQ5073060
Miguel Moscoso, Alexei Novikov, Chrysoula Tsogka
Publication date: 5 May 2022
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04412
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The Adaptive Lasso and Its Oracle Properties
- Atomic Decomposition by Basis Pursuit
- Resolution Analysis of Imaging with $\ell_1$ Optimization
- Imaging Strong Localized Scatterers with Sparsity Promoting Optimization
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Compressed Remote Sensing of Sparse Objects
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- A differential equations approach to l 1 -minimization with applications to array imaging
- Decoding by Linear Programming
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Just relax: convex programming methods for identifying sparse signals in noise
- Superresolution via Sparsity Constraints
- High-Resolution Radar via Compressed Sensing
- High-Dimensional Probability
- Robust imaging of localized scatterers using the singular value decomposition and ℓ 1 minimization
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Imaging with highly incomplete and corrupted data
- Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Towards a Mathematical Theory of Super‐resolution
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
