Recovery of signals under the condition on RIC and ROC via prior support information
DOI10.1016/J.ACHA.2018.02.003zbMATH Open1405.94023arXiv1603.03465OpenAlexW2963753032MaRDI QIDQ1713645FDOQ1713645
Authors: Yaling Li, Wengu Chen
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
Recommendations
- Robust signal recovery for \(\ell_{1-2}\) minimization via prior support information
- Recovery analysis for block \(\ell_p-\ell_1\) minimization with prior support information
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
- Weighted \(\ell_p\)-minimization for sparse signal recovery under arbitrary support prior
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
compressed sensingrestricted isometry propertysparse signal recoveryrestricted orthogonality constantweighted \(l_1\) minimization
Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)
Cites Work
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Decoding by Linear Programming
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Uncertainty principles and ideal atomic decomposition
- Neighborliness of randomly projected simplices in high dimensions
- Iteratively reweighted least squares minimization for sparse recovery
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- The restricted isometry property and its implications for compressed sensing
- Recovering Compressively Sampled Signals Using Partial Support Information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Shifting Inequality and Recovery of Sparse Signals
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- A short note on compressed sensing with partially known signal support
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- Time Invariant Error Bounds for Modified-CS-Based Sparse Signal Sequence Recovery
- The Sample Complexity of Weighted<?Pub _newline ?>Sparse Approximation
Cited In (10)
- Local recovery bounds for prior support constrained compressed sensing
- Recovery analysis for block ℓp − ℓ1 minimization with prior support information
- Robust signal recovery for ℓ 1–2 minimization via prior support information
- Robust recovery of signals with partially known support information using weighted BPDN
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
- One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method
- Weighted $\ell_p$-Minimization for Sparse Signal Recovery under Arbitrary Support Prior
- New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
This page was built for publication: Recovery of signals under the condition on RIC and ROC via prior support information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713645)