Estimation of q for \ell _{q}-minimization in signal recovery with tight frame
From MaRDI portal
Publication:6498644
Cites work
- Atomic Decomposition by Basis Pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Frames and bases. An introductory course
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- Iteratively reweighted algorithm for signals recovery with coherent tight frame
- On sparse reconstruction from Fourier and Gaussian measurements
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Optimal D-RIP bounds in compressed sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Provable Compressed Sensing With Generative Priors via Langevin Dynamics
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Approximate Solutions to Linear Systems
- Stable signal recovery from incomplete and inaccurate measurements
- The null space property for sparse recovery from multiple measurement vectors
This page was built for publication: Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498644)
