Massoud Babaie-Zadeh
Computational Mechanics · 2008
A researcher in the Science corpus: 1 paper; trusts 15 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Computational Mechanics — 18 citations into it; #6,043 of 10,001 by trust here, #7,173 by citations
- Signal Processing — 10 citations into it; #4,550 of 7,572 by trust here, #5,570 by citations
- Computer Vision and Pattern Recognition — 7 citations into it; #13,751 of 21,575 by trust here, #17,757 by citations
- Computer Networks and Communications — 5 citations into it
Whom Massoud Babaie-Zadeh trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- David L. Donoho
- E.J. Candes
- Michael Elad
- Richard Baraniuk
- Stéphane Mallat
- Scott Shaobing Chen
- Mário A. T. Figueiredo
- Pau Bofill
- Terence Tao
- Justin K. Romberg
Who trusts Massoud Babaie-Zadeh overall
Papers from Massoud Babaie-Zadeh's perspective
Ordered by how strongly the researchers Massoud Babaie-Zadeh trusts endorse each paper. Same corpus, a different order for every researcher.
- Atomic Decomposition by Basis Pursuit
- Decoding by linear programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Matching pursuits with time-frequency dictionaries
- Stable recovery of sparse overcomplete representations in the presence of noise
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- An EM algorithm for wavelet-based image restoration
- Regression Shrinkage and Selection via the Lasso
- Why Simple Shrinkage Is Still Relevant for Redundant Representations? (IEEE Transactions on Information Theory)
Their papers
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm (2008) — 1,125 citations