Emmanuel J. Candès
California Institute of Technology
8 papers in the Anchorcite directory, published between 2005 and 2011, cited 64,747 times in total.
ORCID profileResearch topics
- Sparse and Compressive Sensing Techniques · 8 papers
- Mathematical Analysis and Transform Methods · 5 papers
- Numerical methods in inverse problems · 4 papers
- Matrix Theory and Algorithms · 2 papers
- Distributed Sensor Networks and Detection Algorithms · 1 paper
- Image and Signal Denoising Methods · 1 paper
Frequent co-authors
- Terence Tao · 4 papers
- Justin K. Romberg · 1 paper
- Michael B. Wakin · 1 paper
- Xiaodong Li · 1 paper
- Yi Ma · 1 paper
- John N. Wright · 1 paper
- Justin Romberg · 1 paper
- Jian‐Feng Cai · 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…
- An Introduction To Compressive SamplingIEEE Signal Processing Magazine · 2008 · 10,188 citations
Conventional approaches to sampling signals or images follow Shannon's theorem: the sampling rate must be at least twice the maximum frequency present in the signal (Nyquist rate). In the field of data conversion, standard analog-to-digital converter (ADC) technology implements the…
- 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…
- Robust principal component analysis?Journal of the ACM · 2011 · 7,063 citations
This article is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is…
- 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$…
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization · 2010 · 5,892 citations
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem and arises in…
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics · 2009 · 4,980 citations
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and…
Metadata from OpenAlex (CC0).