The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Enhancing Sparsity by Reweighted l(1) Minimization
Open accessAbstract
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we study a novel method for sparse signal recovery that in many situations outperforms L1 minimization in the sense that substantially fewer measurements are needed for exact recovery. The algorithm consists of solving a sequence of weighted L1-minimization problems where the weights used for the next iteration are computed from the value of the current solution. We present a series of experiments demonstrating the remarkable performance and broad applicability of this algorithm in the areas of sparse signal recovery, statistical estimation, error correction and image processing. Interestingly, superior gains are also achieved when our method is applied to recover signals with assumed near-sparsity in overcomplete representations--not by reweighting the L1 norm of the coefficient sequence as is common, but by reweighting the L1 norm of the transformed object. An immediate consequence is the possibility of highly efficient data acquisition protocols by improving on a technique known as compressed sensing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Robust regression using iteratively reweighted least-squares.
Holland, P. W., & Welsch, R. E. (1977) · Communications in Statistics - Theory and Methods · doi:10.1080/03610927708827533 · Cited by 2,115
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Cited by
Comparing Measures of Sparsity
Hurley, N., & Rickard, S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2027527 · Cited by 757
Sparse LMS for system identification
Chen, Y., Gu, Y., & Hero, A. O. (2009) · 2009 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2009.4960286 · Cited by 650
Non-parametric seismic data recovery with curvelet frames
Herrmann, F. J., & Hennenfent, G. (2008) · Geophysical Journal International · doi:10.1111/j.1365-246x.2007.03698.x · Cited by 552
An efficient algorithm for compressed MR imaging using total variation and wavelets
Ma, S., Yin, W., Zhang, Y., & Chakraborty, A. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587391 · Cited by 334
SLOPE—Adaptive variable selection via convex optimization
Bogdan, M., van den Berg, E., Sabatti, C., Su, W., & Candès, E. J. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas842 · Cited by 277
Metadata
- Authors
- Candes, E. J., Wakin, M. B., & Boyd, S. P.
- Publisher
- Defense Technical Information Center
- Published
- 2008-07-01
- OpenAlex
- W2951396542
- Cited by
- 197
- References
- 3
- Type
- report
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Enhancing Sparsity by Reweighted l(1) Minimization. https://app.cochat.ai/papers/10.21236/ada528514
- The paper
- Candes, E. J., Wakin, M. B., & Boyd, S. P. (2008). Enhancing Sparsity by Reweighted l(1) Minimization. https://doi.org/10.21236/ada528514
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.