Stable recovery of sparse signals via \(\ell_p\)-minimization

DOI10.1016/j.acha.2014.06.003zbMath1345.94020arXiv1406.4328OpenAlexW2033585806MaRDI QIDQ466983

Fumin Zhu, Dongfang Li, Jinming Wen

Publication date: 3 November 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.4328

zbMATH Keywords

compressed sensingsparse signal recoveryrestricted isometry constant\(l_p\)-minimization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (19)

Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence ⋮ Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization ⋮ Performance analysis for unconstrained analysis based approaches* ⋮ The null space property of the weighted ℓr − ℓ1 minimization ⋮ A wonderful triangle in compressed sensing ⋮ Binary generalized orthogonal matching pursuit ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ Repeated Minimizers of $p$-Frame Energies ⋮ Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ ⋮ Binary sparse signal recovery with binary matching pursuit ^* ⋮ One-bit compressed sensing via ℓ _p (0 < p < 1)-minimization method ⋮ ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal ⋮ Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization ⋮ Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit ⋮ A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization ⋮ Stable recovery of sparse signals with coherent tight frames via lp-analysis approach

Cites Work

• Recovery of sparsest signals via \(\ell^q \)-minimization
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• The restricted isometry property and its implications for compressed sensing
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Iteratively reweighted least squares minimization for sparse recovery
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Stable recovery of sparse signals via \(\ell_p\)-minimization