The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Atomic Decomposition by Basis Pursuit
Abstract
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed, including the method of frames (MOF), Matching pursuit (MP), and, for special dictionaries, the best orthogonal basis (BOB). Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP, and BOB, including better sparsity and superresolution. BP has interesting relations to ideas in areas as diverse as ill-posed problems, in abstract harmonic analysis, total variation denoising, and multiscale edge denoising. BP in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked successfully only because of recent advances in linear programming by interior-point methods. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate-gradient solver.
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
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Wedgelets: nearly minimax estimation of edges
Donoho, D. L. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031261 · Cited by 638
Self-citation
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Self-citationCandes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
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
Self-citationA sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Challenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
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
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
Feng, Z., Liang, M., & Chu, F. (2013) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2013.01.017 · Cited by 998
Genome-wide association analysis by lasso penalized logistic regression
Wu, T. T., Chen, Y. F., Hastie, T., Sobel, E., & Lange, K. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp041 · Cited by 785
Wedgelets: nearly minimax estimation of edges
Donoho, D. L. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031261 · Cited by 638
Self-citationHe, L., Li, J., Liu, C., & Li, S. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2765364 · Cited by 630
A significance test for the lasso
Lockhart, R., Taylor, J., Tibshirani, R. J., & Tibshirani, R. (2014) · The Annals of Statistics · doi:10.1214/13-aos1175 · Cited by 541
High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity
Loh, P.-L., & Wainwright, M. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1018 · Cited by 529
Matrix Completion Methods for Causal Panel Data Models
Athey, S., Bayati, M., Doudchenko, N., Imbens, G., & Khosravi, K. (2018) · doi:10.3386/w25132 · Cited by 497
Pattern discovery and cancer gene identification in integrated cancer genomic data
Mo, Q., Wang, S., Seshan, V. E., Olshen, A. B., Schultz, N., Sander, C., Powers, R. S., Ladanyi, M., & Shen, R. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1208949110 · Cited by 474
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Analog-to-Information Conversion via Random Demodulation
Kirolos, S., Laska, J., Wakin, M., Duarte, M., Baron, D., Ragheb, T., Massoud, Y., & Baraniuk, R. (2006) · 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software · doi:10.1109/dcas.2006.321036 · Cited by 393
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Chen, X., Xu, F., & Ye, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090761471 · Cited by 288
Time-frequency mixed-norm estimates: Sparse M/EEG imaging with non-stationary source activations
Gramfort, A., Strohmeier, D., Haueisen, J., Hämäläinen, M. S., & Kowalski, M. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2012.12.051 · Cited by 234
Combining sparsity and rotational invariance in EEG/MEG source reconstruction
Haufe, S., Nikulin, V. V., Ziehe, A., Müller, K.-R., & Nolte, G. (2008) · NeuroImage · doi:10.1016/j.neuroimage.2008.04.246 · Cited by 130
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Zhou, H., Chen, J., Dong, G., & Wang, R. (2016) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2015.11.022 · Cited by 131
Yang, Y., & Nagarajaiah, S. (2014) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2013.09.009 · Cited by 101
HIERARCHICAL SPARSE BAYESIAN LEARNING FOR STRUCUTRAL HEALTH MONITORING WITH INCOMPLETE MODAL DATA
Huang, Y., & Beck, J. L. (2015) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2015011808 · Cited by 87
A generalized Dantzig selector with shrinkage tuning
James, G. M., & Radchenko, P. (2009) · Biometrika · doi:10.1093/biomet/asp013 · Cited by 67
Adaptive Multivariate Data Compression in Smart Metering Internet of Things
Chowdhury, M. R., Tripathi, S., & De, S. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2981382 · Cited by 62
Jiang, H., Dai, X., Gao, D. W., Zhang, J. J., Zhang, Y., & Muljadi, E. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2552229 · Cited by 56
An Equivalence between the Lasso and Support Vector Machines
Jaggi, M. (2013) · arXiv · doi:10.48550/arxiv.1303.1152 · Cited by 35
“For example, in the setting known as sparse recovery , the goal is to approximately recover a sparse solution x using instances A, b (consisting of only a small number of rows), where b is interpreted as a noisy or corrupted measurement of Ax , see e.g. (Chen et al., 2001; Porat & Strauss, 2012).”
MethodDeep learning on sparse manifolds for faster object segmentation
Nascimento, J. C., & Carneiro, G. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2725582 · Cited by 17
Sparsity-Aware Learning and Compressed Sensing: An Overview
Theodoridis, S., Kopsinis, Y., & Slavakis, K. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-396502-8.00023-1 · Cited by 14
Metadata
- Authors
- Chen, S. S., Donoho, D. L., & Saunders, M. A.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1998-01
- Volume
- 20
- Issue
- 1
- Pages
- 33-61
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1986931325
- Cited by
- 6,845
- References
- 2
- FWCI
- 42.51
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.
