Stable recovery of sparse signals with coherent tight frames via l_p-analysis approach
From MaRDI portal
Publication:5269879
Recommendations
- The restricted isometry property for signal recovery with coherent tight frames
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Stable signal recovery with dual frames via \(l_p\)-minimization for \(0 < p \leq 1\)
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
Cites work
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Optimal \(D\)-RIP bounds in compressed sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted isometry properties and nonconvex compressive sensing
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- The restricted isometry property and its implications for compressed sensing
Cited in
(13)- Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
- Iteratively reweighted algorithm for signals recovery with coherent tight frame
- scientific article; zbMATH DE number 7027997 (Why is no real title available?)
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- An analysis of noise folding for low-rank matrix recovery
- Stable signal recovery with dual frames via \(l_p\)-minimization for \(0 < p \leq 1\)
- The restricted isometry property for signal recovery with coherent tight frames
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Stability Analysis of $\ell _{0,\infty }$-Norm Based Convolutional Sparse Coding Using Stripe Coherence
- Compressed data separation via unconstrained l1-split analysis
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Stable recovery of signals with the high order D-RIP condition
This page was built for publication: Stable recovery of sparse signals with coherent tight frames via \(l_p\)-analysis approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269879)