A mathematical introduction to compressive sensing S Foucart, H Rauhut Birkhäuser, 2013 | 3651* | 2013 |
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0< q⩽ 1 S Foucart, MJ Lai Applied and Computational Harmonic Analysis 26 (3), 395-407, 2009 | 902 | 2009 |
Hard thresholding pursuit: an algorithm for compressive sensing S Foucart SIAM Journal on numerical analysis 49 (6), 2543-2563, 2011 | 561 | 2011 |
Nonlinear Approximation and (Deep) Networks I Daubechies, R DeVore, S Foucart, B Hanin, G Petrova Constructive Approximation 55 (1), 127-172, 2022 | 273 | 2022 |
A note on guaranteed sparse recovery via ℓ1-minimization S Foucart Applied and Computational Harmonic Analysis 29 (1), 97-103, 2010 | 261 | 2010 |
Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants S Foucart Approximation Theory XIII: San Antonio 2010, 65-77, 2012 | 178 | 2012 |
The Gelfand widths of ℓp-balls for 0< p≤ 1 S Foucart, A Pajor, H Rauhut, T Ullrich Journal of Complexity 26 (6), 629-640, 2010 | 149 | 2010 |
Exponential decay of reconstruction error from binary measurements of sparse signals RG Baraniuk, S Foucart, D Needell, Y Plan, M Wootters IEEE Transactions on Information Theory 63 (6), 3368-3385, 2017 | 138 | 2017 |
Stability and robustness of ℓ1-minimizations with Weibull matrices and redundant dictionaries S Foucart Linear Algebra and its Applications 441, 4-21, 2012 | 78 | 2012 |
Sparse recovery by means of nonnegative least squares S Foucart, D Koslicki IEEE Signal Processing Letters 21 (4), 498-502, 2014 | 75 | 2014 |
Hard thresholding pursuit algorithms: number of iterations JL Bouchot, S Foucart, P Hitczenko Applied and computational harmonic analysis 41 (2), 412-435, 2016 | 64 | 2016 |
On the exact constant in the Jackson–Stechkin inequality for the uniform metric S Foucart, Y Kryakin, A Shadrin Constructive approximation 29 (2), 157-179, 2009 | 61 | 2009 |
Quikr: a Method for Rapid Reconstruction of Bacterial Communities via Compressive Sensing D Koslicki, S Foucart, G Rosen Bioinformatics 29 (17), 2096-2102, 2013 | 59 | 2013 |
WGSQuikr: fast whole-genome shotgun metagenomic classification D Koslicki, S Foucart, G Rosen PloS one 9 (3), e91784, 2014 | 52 | 2014 |
Stability and robustness of weak orthogonal matching pursuits S Foucart Recent Advances in Harmonic Analysis and Applications: In Honor of …, 2012 | 46 | 2012 |
Flavors of compressive sensing S Foucart Approximation Theory XV: San Antonio 2016 15, 61-104, 2017 | 41 | 2017 |
Recovering jointly sparse vectors via hard thresholding pursuit S Foucart Proc. SampTA 2011, 2011 | 37 | 2011 |
One-bit compressive sensing of dictionary-sparse signals R Baraniuk, S Foucart, D Needell, Y Plan, M Wootters Information and Inference: A Journal of the IMA 7 (1), 83-104, 2018 | 34 | 2018 |
Weighted matrix completion from non-random, non-uniform sampling patterns S Foucart, D Needell, R Pathak, Y Plan, M Wootters IEEE Transactions on Information Theory 67 (2), 1264-1290, 2020 | 30 | 2020 |
Sparse recovery with pre-Gaussian random matrices S Foucart, MJ Lai Studia Math 200 (1), 91-102, 2010 | 27 | 2010 |