New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization
From MaRDI portal
Publication:2312513
DOI10.1007/s00034-017-0691-6zbMath1411.94018OpenAlexW2766283423MaRDI QIDQ2312513
Li Xiao, Haiye Huo, Wen-chang Sun
Publication date: 17 July 2019
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0691-6
compressed sensingrestricted isometry propertynull space propertyweighted \(l_1\) minimizationweighted sparsity
Related Items (3)
Sufficient conditions on stable reconstruction of weighted problem ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ Stable recovery of weighted sparse signals from phaseless measurements via weighted l1 minimization
Cites Work
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- A mathematical introduction to compressive sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Perturbations of measurement matrices and dictionaries in compressed sensing
- The null space property for sparse recovery from multiple measurement vectors
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On support sizes of restricted isometry constants
- Interpolation via weighted \(\ell_{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- Recovery of signals under the condition on RIC and ROC via prior support information
- A short note on compressed sensing with partially known signal support
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- The Exact Recovery of Sparse Signals Via Orthogonal Matching Pursuit
- Optimal Choice of Weights for Sparse Recovery With Prior Information
- Compressed sensing and best 𝑘-term approximation
- Decoding by Linear Programming
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information
- The Sample Complexity of Weighted<?Pub _newline ?>Sparse Approximation
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Compressed sensing: a survey
- Approximation of high-dimensional parametric PDEs
- Recovering Compressively Sampled Signals Using Partial Support Information
- New Bounds for Restricted Isometry Constants
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Compressed Data Separation With Redundant Dictionaries
- Compressed Sensing With Prior Information: Strategies, Geometry, and Bounds
- Compressed sensing
This page was built for publication: New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization