Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction
DOI10.1016/j.cam.2015.02.038zbMath1328.68284OpenAlexW2009291793MaRDI QIDQ2345681
Jiehua Zhu, Xiezhang Li, Edward Arroyo, Fangjun H. Arroyo
Publication date: 22 May 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.02.038
compressed sensing\(l_1\) greedy algorithmgeneralized \(l_1\) greedy algorithmreweighted \(l_1\) greedy algorithmreweighted \(l_1\)-minimization
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Numerical linear algebra (65F99)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A generalized \(l_1\) greedy algorithm for image reconstruction in CT
- Fast Implementation of ℓ 1-Greedy Algorithm
- Certifying the Restricted Isometry Property is Hard
- Uncertainty Principles and Signal Recovery
- Sparse Solutions of Underdetermined Linear Systems
- Decoding by Linear Programming
- Linear Inversion of Band-Limited Reflection Seismograms
- Signal Recovery and the Large Sieve
- Atomic Decomposition by Basis Pursuit
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems