Recovery of signals under the condition on RIC and ROC via prior support information
From MaRDI portal
Publication:1713645
DOI10.1016/j.acha.2018.02.003zbMath1405.94023arXiv1603.03465MaRDI QIDQ1713645
Publication date: 25 January 2019
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03465
compressed sensing; restricted isometry property; sparse signal recovery; restricted orthogonality constant; weighted \(l_1\) minimization
90C59: Approximation methods and heuristics in mathematical programming
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A15: Information theory (general)
Related Items
One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method, Recovery analysis for block ℓp − ℓ1 minimization with prior support information, Robust recovery of signals with partially known support information using weighted BPDN, Robust signal recovery for ℓ 1–2 minimization via prior support information, Weighted $\ell_p$-Minimization for Sparse Signal Recovery under Arbitrary Support Prior, Sparse reconstruction via the mixture optimization model with iterative support estimate, Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization, Local recovery bounds for prior support constrained compressed sensing, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
Cites Work
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- The restricted isometry property and its implications for compressed sensing
- A short note on compressed sensing with partially known signal support
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Time Invariant Error Bounds for Modified-CS-Based Sparse Signal Sequence Recovery
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- Uncertainty principles and ideal atomic decomposition
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- Shifting Inequality and Recovery of Sparse Signals
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- The Sample Complexity of Weighted<?Pub _newline ?>Sparse Approximation
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Recovering Compressively Sampled Signals Using Partial Support Information
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Neighborliness of randomly projected simplices in high dimensions
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing