Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
From MaRDI portal
Publication:6591729
DOI10.1142/s0219691324500176zbMath1546.41018MaRDI QIDQ6591729
Chen, Wengu, Ning Bi, Xizhe Xie
Publication date: 22 August 2024
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
sparse recoverycompressed sensingrestricted isometry propertynull space property\(\ell_{1-2}\)-analysis
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Approximation with constraints (41A29)
Cites Work
- Recovery of sparsest signals via \(\ell^q \)-minimization
- New bounds for RIC 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\)
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Compressed sensing with coherent and redundant dictionaries
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals
- 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\)
- Fast L1-L2 minimization via a proximal operator
- On the grouping effect of the \(l_{1-2}\) models
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Optimal \(D\)-RIP bounds in compressed sensing
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Atomic Decomposition by Basis Pursuit
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Ten Lectures on Wavelets
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- Matching pursuits with time-frequency dictionaries
- A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- 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: Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis