Frames for compressed sensing using coherence
From MaRDI portal
Abstract: We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satisfied. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.
Recommendations
- scientific article; zbMATH DE number 7128825
- Compressed Sensing and Redundant Dictionaries
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed sensing with coherent and redundant dictionaries
Cites work
- An introduction to frames and Riesz bases
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property and its implications for compressed sensing
Cited in
(5)- Painless reconstruction from magnitudes of frame coefficients
- Coherence pattern-guided compressive sensing with unresolved grids
- Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
- scientific article; zbMATH DE number 7031437 (Why is no real title available?)
- On block coherence of frames
This page was built for publication: Frames for compressed sensing using coherence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618389)
