The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
Abstract
We consider linear equations y= Φ x where y is a given vector in ℝnand Φ is a given n×m matrix with n<m≤ τ n, and we wish to solve for x∈ ℝm. We suppose that the columns of Φ are normalized to the unit 𝓁 2‐norm, and we place uniform measure on such Φ. We prove the existence of ρ = ρ(τ) > 0 so that for large n and for all Φ's except a negligible fraction, the following property holds:For every y having a representation y= Φ x0by a coefficient vector x0∈ ℝmwith fewer than ρ · n nonzeros, the solution x1of the 𝓁 1‐minimization problemis unique and equal to x0. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost‐spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices. © 2006 Wiley Periodicals, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Self-citationGreed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Entropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Self-citationExtremes and Related Properties of Random Sequences and Processes
Leadbetter, M. R., Lindgren, G., & Rootzén, H. (1983) · Springer Series in Statistics · doi:10.1007/978-1-4612-5449-2 · Cited by 2,873
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Self-citationUncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Self-citation
Cited by
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Image Super-Resolution Via Sparse Representation
Yang, J., Wright, J., Huang, T. S., & Ma, Y. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2050625 · Cited by 5,217
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Deep learning for visual understanding: A review
Guo, Y., Liu, Y., Oerlemans, A., Lao, S., Wu, S., & Lew, M. S. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.09.116 · Cited by 2,504
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Self-citationSparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
Sparse representation or collaborative representation: Which helps face recognition?
Zhang, L., Yang, M., & Feng, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126277 · Cited by 1,952
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Sparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J.-L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173241 · Cited by 1,509
Self-citationImage super-resolution as sparse representation of raw image patches
Yang, J., Wright, J., Huang, T., & Ma, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587647 · Cited by 1,475
Anomaly Detection with Robust Deep Autoencoders
Zhou, C., & Paffenroth, R. C. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098052 · Cited by 1,436
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Elhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
Mohimani, H., Babaie-Zadeh, M., & Jutten, C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007606 · Cited by 1,091
MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning
Ravishankar, S., & Bresler, Y. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2090538 · Cited by 1,059
Extensions of compressed sensing
Tsaig, Y., & Donoho, D. L. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.029 · Cited by 947
Self-citationAn Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
Wipf, D. P., & Rao, B. D. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894265 · Cited by 911
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning
Zhang, Z., & Rao, B. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2159773 · Cited by 868
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
Self-citationTheoretical Results on Sparse Representations of Multiple-Measurement Vectors
Chen, J., & Huo, X. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881263 · Cited by 810
Rank-Sparsity Incoherence for Matrix Decomposition
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2011) · SIAM Journal on Optimization · doi:10.1137/090761793 · Cited by 686
Least Squares After Model Selection in High-Dimensional Sparse Models
Belloni, A., & Chernozhukov, V. (2009) · SSRN Electronic Journal · doi:10.2139/ssrn.1582594 · Cited by 683
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Best subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Self-citationLearning with $\ell ^{1}$-graph for image analysis
Cheng, B., Yang, J., Yan, S., Fu, Y., & Huang, T. S. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038764 · Cited by 602
Restricted isometry properties and nonconvex compressive sensing
Chartrand, R., & Staneva, V. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/3/035020 · Cited by 597
Robust sparse coding for face recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995393 · Cited by 589
A Fast Alternating Direction Method for TVL1-L2 Signal Reconstruction From Partial Fourier Data
Yang, J., Zhang, Y., & Yin, W. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042333 · Cited by 571
Accelerated NMR Spectroscopy by Using Compressed Sensing
Kazimierczuk, K., & Orekhov, V. Y. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.201100370 · Cited by 550
Compressed Sensing and Redundant Dictionaries
Rauhut, H., Schnass, K., & Vandergheynst, P. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920190 · Cited by 541
A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications
Rani, M., Dhok, S. B., & Deshmukh, R. B. (2018) · IEEE Access · doi:10.1109/access.2018.2793851 · Cited by 530
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
The lasso problem and uniqueness
Tibshirani, R. J. (2013) · Electronic Journal of Statistics · doi:10.1214/13-ejs815 · Cited by 507
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
Joint covariate selection and joint subspace selection for multiple classification problems
Obozinski, G., Taskar, B., & Jordan, M. I. (2010) · Statistics and Computing · doi:10.1007/s11222-008-9111-x · Cited by 451
SparseNet: Coordinate Descent With Nonconvex Penalties
Mazumder, R., Friedman, J. H., & Hastie, T. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm09738 · Cited by 449
Iterative Reweighted $\ell_1$ and $\ell_2$ Methods for Finding Sparse Solutions
Wipf, D., & Nagarajan, S. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042413 · Cited by 448
Sparse Representation for Target Detection in Hyperspectral Imagery
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2113170 · Cited by 428
Deep learning for undersampled MRI reconstruction
Hyun, C. M., Kim, H. P., Lee, S. M., Lee, S., & Seo, J. K. (2018) · Physics in Medicine & Biology · doi:10.1088/1361-6560/aac71a · Cited by 428
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Haupt, J., Bajwa, W. U., Raz, G., & Nowak, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2070191 · Cited by 424
Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032816 · Cited by 420
Statistical challenges of high-dimensional data
Johnstone, I. M., & Titterington, D. M. (2009) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2009.0159 · Cited by 417
High-dimensional generalized linear models and the lasso
van de Geer, S. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000929 · Cited by 414
Random Projections of Smooth Manifolds
Baraniuk, R. G., & Wakin, M. B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-007-9011-z · Cited by 404
Statistical learning and selective inference
Taylor, J., & Tibshirani, R. J. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1507583112 · Cited by 398
A Generalized Iterated Shrinkage Algorithm for Non-convex Sparse Coding
Zuo, W., Meng, D., Zhang, L., Feng, X., & Zhang, D. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.34 · Cited by 396
Latent variable graphical model selection via convex optimization
Chandrasekaran, V., Parrilo, P. A., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/11-aos949 · Cited by 377
High-dimensional variable selection
Wasserman, L., & Roeder, K. (2009) · The Annals of Statistics · doi:10.1214/08-aos646 · Cited by 373
Bayesian Saliency via Low and Mid Level Cues
Xie, Y., Lu, H., & Yang, M.-H. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2216276 · Cited by 367
Visual Classification With Multitask Joint Sparse Representation
Yuan, X.-T., Liu, X., & Yan, S. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2205006 · Cited by 364
Satellite Image Classification via Two-Layer Sparse Coding With Biased Image Representation
Dai, D., & Yang, W. (2011) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2010.2055033 · Cited by 362
Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications
Gao, S., Tsang, I. W.-H., & Chia, L.-T. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.63 · Cited by 357
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Eldar, Y. C., & Rauhut, H. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034789 · Cited by 356
Supervised translation-invariant sparse coding
Yang, J., Yu, K., & Huang, T. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539958 · Cited by 355
Wavelets, Ridgelets, and Curvelets for Poisson Noise Removal
Zhang, B., Fadili, J. M., & Starck, J. L. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924386 · Cited by 349
Koltchinskii, V. (2011) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-22147-7 · Cited by 346
Learning Sparsifying Transforms
Ravishankar, S., & Bresler, Y. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226449 · Cited by 344
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Sheng, G., Yang, W., Xu, T., & Sun, H. (2012) · International Journal of Remote Sensing · doi:10.1080/01431161.2011.608740 · Cited by 309
Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
Lu, C., Tang, J., Yan, S., & Lin, Z. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2511584 · Cited by 307
Dense Error Correction Via $\ell^1$-Minimization
Wright, J., & Ma, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048473 · Cited by 305
Latent Variable Bayesian Models for Promoting Sparsity
Wipf, D. P., Rao, B. D., & Nagarajan, S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162174 · Cited by 305
New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
Krahmer, F., & Ward, R. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100810447 · Cited by 290
Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
Chepuri, S. P., & Leus, G. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2379662 · Cited by 288
Sparse coding based visual tracking: Review and experimental comparison
Zhang, S., Yao, H., Sun, X., & Lu, X. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2012.10.006 · Cited by 284
Kang, H., Zhang, A., Cai, T. T., & Small, D. S. (2016) · Journal of the American Statistical Association · doi:10.1080/01621459.2014.994705 · Cited by 265
Reproducible Research in Computational Harmonic Analysis
Donoho, D. L., Maleki, A., Rahman, I. U., Shahram, M., & Stodden, V. (2009) · Computing in Science & Engineering · doi:10.1109/mcse.2009.15 · Cited by 274
Self-citationSampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
Blumensath, T., & Davies, M. E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2013003 · Cited by 269
Blind motion deblurring from a single image using sparse approximation
Cai, J.-F., Ji, H., Liu, C., & Shen, Z. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206743 · Cited by 264
Zhi, R., Flierl, M., Ruan, Q., & Kleijn, W. B. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2044788 · Cited by 260
Regularized Robust Coding for Face Recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235849 · Cited by 259
Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
Peng, X., Yu, Z., Yi, Z., & Tang, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536752 · Cited by 257
A note on the complexity of L p minimization
Ge, D., Jiang, X., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0470-2 · Cited by 254
Transfer learning for image classification with sparse prototype representations
Quattoni, A., Collins, M., & Darrell, T. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587637 · Cited by 252
Reconstructing cortical current density by exploring sparseness in the transform domain
Ding, L. (2009) · Physics in Medicine and Biology · doi:10.1088/0031-9155/54/9/006 · Cited by 99
Inference of complex biological networks: distinguishability issues and optimization-based solutions
Szederkényi, G., Banga, J. R., & Alonso, A. A. (2011) · BMC Systems Biology · doi:10.1186/1752-0509-5-177 · Cited by 78
Space–time event sparse penalization for magneto-/electroencephalography
Bolstad, A., Veen, B. V., & Nowak, R. (2009) · NeuroImage · doi:10.1016/j.neuroimage.2009.01.056 · Cited by 71
Emerging data technology in structural health monitoring: compressive sensing technology
Bao, Y., Li, H., & Ou, J. (2014) · Journal of Civil Structural Health Monitoring · doi:10.1007/s13349-013-0064-1 · Cited by 43
Representer Theorems for Sparsity-Promoting $\ell _{1}$ Regularization
Unser, M., Fageot, J., & Gupta, H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2590421 · Cited by 36
Detective-Dee: A Non-Intrusive In Situ Anomaly Detection and Fault Localization Framework
Man, Y., Li, S., Xia, W., Li, Y., Yu, B., Long, Y., & Pan, Y. (2023) · 2023 42nd International Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds60354.2023.00032 · Cited by 5
Blind Deconvolution with Non-local Similarity and $l_0$ Sparsity for Noisy Image
Ren, W., Tian, J., & Tang, Y. (2016) · IEEE Signal Processing Letters · doi:10.1109/lsp.2016.2530855 · Cited by 2
Metadata
- Authors
- Donoho, D. L.
- Venue
- Communications on Pure and Applied Mathematics
- Publisher
- Wiley
- Published
- 2006-03-23
- Volume
- 59
- Issue
- 6
- Pages
- 797-829
- ISSN
- 0010-3640 (ISSN-L)
- 1097-0312
- OpenAlex
- W2050834445
- Cited by
- 2,490
- References
- 27
- FWCI
- 99.58
- 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.