A mathematical introduction to compressive sensing S Foucart, H Rauhut Birkhäuser, New York, NY, 2013 | 3688* | 2013 |
Compressed sensing and redundant dictionaries H Rauhut, K Schnass, P Vandergheynst IEEE Transactions on Information Theory 54 (5), 2210-2219, 2008 | 718 | 2008 |
Compressive sensing and structured random matrices H Rauhut Theoretical foundations and numerical methods for sparse recovery 9 (1), 92, 2010 | 716 | 2010 |
Compressive Sensing. M Fornasier, H Rauhut Handbook of mathematical methods in imaging 1, 187-229, 2015 | 394 | 2015 |
Average case analysis of multichannel sparse recovery using convex relaxation YC Eldar, H Rauhut IEEE Transactions on Information Theory 56 (1), 505-519, 2009 | 370 | 2009 |
Compressive estimation of doubly selective channels in multicarrier systems: Leakage effects and sparsity-enhancing processing G Taubock, F Hlawatsch, D Eiwen, H Rauhut IEEE Journal of selected topics in signal processing 4 (2), 255-271, 2010 | 329 | 2010 |
Low-rank matrix recovery via iteratively reweighted least squares minimization M Fornasier, H Rauhut, R Ward SIAM Journal on Optimization 21 (4), 1614-1640, 2011 | 274 | 2011 |
Recovery algorithms for vector-valued data with joint sparsity constraints M Fornasier, H Rauhut SIAM Journal on Numerical Analysis 46 (2), 577-613, 2008 | 268 | 2008 |
Suprema of chaos processes and the restricted isometry property F Krahmer, S Mendelson, H Rauhut Communications on Pure and Applied Mathematics 67 (11), 1877-1904, 2014 | 263 | 2014 |
Iterative thresholding algorithms M Fornasier, H Rauhut Applied and Computational Harmonic Analysis 25 (2), 187-208, 2008 | 252 | 2008 |
Sparse Legendre expansions via ℓ1-minimization H Rauhut, R Ward Journal of approximation theory 164 (5), 517-533, 2012 | 250 | 2012 |
Restricted isometries for partial random circulant matrices H Rauhut, J Romberg, JA Tropp Applied and Computational Harmonic Analysis 32 (2), 242-254, 2012 | 247 | 2012 |
Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms R Gribonval, H Rauhut, K Schnass, P Vandergheynst Journal of Fourier analysis and Applications 14, 655-687, 2008 | 224 | 2008 |
Low rank matrix recovery from rank one measurements R Kueng, H Rauhut, U Terstiege Applied and Computational Harmonic Analysis 42 (1), 88-116, 2017 | 219 | 2017 |
Random sampling of sparse trigonometric polynomials, II. Orthogonal matching pursuit versus basis pursuit S Kunis, H Rauhut Foundations of Computational Mathematics 8, 737-763, 2008 | 213 | 2008 |
Circulant and Toeplitz matrices in compressed sensing H Rauhut arXiv preprint arXiv:0902.4394, 2009 | 192 | 2009 |
Low rank tensor recovery via iterative hard thresholding H Rauhut, R Schneider, Ž Stojanac Linear Algebra and its Applications 523, 220-262, 2017 | 190 | 2017 |
Continuous frames, function spaces, and the discretization problem M Fornasier, H Rauhut Journal of Fourier Analysis and Applications 11, 245-287, 2005 | 179 | 2005 |
Interpolation via weighted ℓ1 minimization H Rauhut, R Ward Applied and Computational Harmonic Analysis 40 (2), 321-351, 2016 | 173 | 2016 |
Random sampling of sparse trigonometric polynomials H Rauhut Applied and Computational Harmonic Analysis 22 (1), 16-42, 2007 | 165 | 2007 |