Terence Tao
University of California, Los Angeles
4 papers in the Anchorcite directory, published between 2005 and 2006, cited 36,624 times in total.
ORCID profileResearch topics
- Sparse and Compressive Sensing Techniques · 4 papers
- Numerical methods in inverse problems · 4 papers
- Mathematical Analysis and Transform Methods · 4 papers
Frequent co-authors
- Emmanuel J. Candès · 4 papers
- Justin K. Romberg · 1 paper
- Justin Romberg · 1 paper
Papers
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory · 2006 · 15,628 citations
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f/spl isin/C/sup N/ and a randomly chosen set of frequencies /spl Omega/. Is it possible to reconstruct f from the partial knowledge…
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory · 2005 · 7,141 citations
This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e is an arbitrary…
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics · 2006 · 7,039 citations
Abstract Suppose we wish to recover a vector x 0 ∈ ℝ 𝓂 (e.g., a digital signal or image) from incomplete and contaminated observations y = A x 0 + e ; A is an 𝓃 × 𝓂 matrix with…
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory · 2006 · 6,816 citations
Suppose we are given a vector $f$ in a class ${\cal F} \subset{\BBR}^N$ , e.g., a class of digital signals or digital images. How many linear measurements do we need to make about $f$ to be able to recover $f$…
Metadata from OpenAlex (CC0).