Thomas Blumensath

Computational Mechanics · 2008–2020

A researcher in the Science corpus: 6 papers; trusts 52 researchers and is trusted by 108 researchers here, as inferred from the citation graph.

Subfields

• Computational Mechanics — 50 citations into it; #232 of 10,001 by trust here, #642 by citations
• Mechanics of Materials — 47 citations into it
• Computer Vision and Pattern Recognition — 29 citations into it; #4,263 of 21,575 by trust here, #8,021 by citations
• Civil and Structural Engineering — 26 citations into it
• Biomedical Engineering — 22 citations into it; #152 of 10,734 by trust here, #2,547 by citations
• Mechanical Engineering — 21 citations into it
• Signal Processing — 17 citations into it; #618 of 7,572 by trust here, #1,433 by citations
• Applied Mathematics — 15 citations into it

Whom Thomas Blumensath trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Joel A. Tropp
2. E.J. Candes
3. David L. Donoho
4. Justin K. Romberg
5. Stéphane Mallat
6. Deanna Needell
7. Scott Shaobing Chen
8. Terence Tao
9. Gerald A. Edgar
10. Wei Dai

Who trusts Thomas Blumensath overall

1. Marco F. Duarte
2. Yonina C. Eldar
3. Simon Foucart
4. M. Davies
5. Richard Baraniuk
6. Guoyin Li
7. Ron Rubinstein
8. Dimitris J. Bertsimas
9. Hédy Attouch
10. Justin K. Romberg

Papers from Thomas Blumensath's perspective

Ordered by how strongly the researchers Thomas Blumensath trusts endorse each paper. Same corpus, a different order for every researcher.

1. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
2. Atomic Decomposition by Basis Pursuit
3. Decoding by linear programming
4. Stable signal recovery from incomplete and inaccurate measurements
5. Regression Shrinkage and Selection via the Lasso
6. Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
7. Matching pursuits with time-frequency dictionaries
8. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
9. A wavelet tour of signal processing
10. Greed is good: algorithmic results for sparse approximation (IEEE Transactions on Information Theory)

Their papers

• Iterative Thresholding for Sparse Approximations (2008) — 1,343 citations
• Iterative Hard Thresholding for Compressed Sensing (2008) — 2,526 citations
• Gradient Pursuits (2008) — 507 citations
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces (2009) — 316 citations
• Successes and challenges in non-destructive testing of aircraft composite structures (2020) — 249 citations
• Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance (2010) — 503 citations