Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization

DOI10.1016/j.acha.2017.10.004zbMath1422.94018OpenAlexW2766178683MaRDI QIDQ2330928

Rui Zhang, Song Li

Publication date: 23 October 2019

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

Full work available at URL: https://doi.org/10.1016/j.acha.2017.10.004

zbMATH Keywords

compressed sensinglow-rank matrix recoverytight frame\(\ell_p\) minimizationoptimal restricted isometry property

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Multidimensional problems (41A63) Random matrices (algebraic aspects) (15B52) Information theory (general) (94A15)

Related Items (23)

Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization ⋮ On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery ⋮ Random Sampling and Reconstruction of Sparse Time- and Band-Limited Signals ⋮ A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ The null space property of the weighted ℓr − ℓ1 minimization ⋮ Analysis non-sparse recovery for relaxed ALASSO ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ Nonconvex \(\ell_p-\alpha\ell_q\) minimization method and \(p\)-RIP condition for stable recovery of approximately \(k\)-sparse signals ⋮ \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ On sparse recovery algorithms in unions of orthonormal bases ⋮ Robust recovery of signals with partially known support information using weighted BPDN ⋮ Low-rank matrix recovery via regularized nuclear norm minimization ⋮ ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal ⋮ New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods ⋮ The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization ⋮ A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization ⋮ Weighted $\ell_p$-Minimization for Sparse Signal Recovery under Arbitrary Support Prior ⋮ An analysis of noise folding for low-rank matrix recovery ⋮ Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information

Cites Work

• A mathematical introduction to compressive sensing
• The bounds of restricted isometry constants for low rank matrices recovery
• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Perturbations of measurement matrices and dictionaries in compressed sensing
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Compressed sensing with coherent and redundant dictionaries
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
• The restricted isometry property and its implications for compressed sensing
• Sparse recovery by non-convex optimization - instance optimality
• 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 simple proof of the restricted isometry property for random matrices
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Optimal \(D\)-RIP bounds in compressed sensing
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• Restricted isometry properties and nonconvex compressive sensing
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• New Bounds for Restricted Isometry Constants With Coherent Tight Frames
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• 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

This page was built for publication: Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization