Emmanuel Candès

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Emmanuel Candès
Emmanuel Candès.jpg
Born (1970-04-27) 27 April 1970 (age 47)
Paris, France
Nationality French
Alma mater Stanford University
École Polytechnique
Known for Wavelet theory, Curvelets, Compressed sensing
Awards

Alfred P. Sloan Research Fellowship (2001)
James H. Wilkinson Prize in Numerical Analysis and Scientific Computing (2005)
Alan T. Waterman Award (2006)
Vasil A. Popov Prize (2001)
Information Theory Society Paper Award (2008)
George Pólya Prize (2010)
Collatz Prize (ICIAM) (2011)
Lagrange Prize in Continuous Optimization (2012)
Dannie Heineman Prize (2013)

MacArthur Genius Grant (2017)
Scientific career
Fields Statistician, Mathematician
Institutions Stanford University
California Institute of Technology
Doctoral advisor David Donoho

Emmanuel Jean Candès (born 27 April 1970) is a professor of mathematics, statistics, and electrical engineering (by courtesy) at Stanford University, where he is also the Barnum-Simons Chair in Mathematics and Statistics.

Academic biography[edit]

Candès earned a M.Sc. from the École Polytechnique in 1993.[1] He did his postgraduate studies at Stanford, where he earned a Ph.D. in statistics in 1998 under the supervision of David Donoho[1][2] and immediately joined the Stanford faculty as an assistant professor of statistics.[1] He moved to the California Institute of Technology in 2000,[1] where in 2006 he was named the Ronald and Maxine Linde Professor of Applied and Computational Mathematics. He returned to Stanford in 2009.

Research[edit]

Candès' early research concerned nonlinear approximation theory. In his Ph.D. thesis,[2] he developed generalizations of wavelets called curvelets and ridgelets that were able to capture higher order structures in signals. This work has had significant impact in image processing and multiscale analysis, and earned him the Popov prize in approximation theory in 2001.[3]

In 2006, Candès wrote a paper with Terence Tao[4] that kicked off the field of compressed sensing: the recovery of sparse signals from a few carefully constructed, and seemingly random measurements. Many researchers have since contributed to this field, which has brought us the idea of a camera that can record pictures while needing only one sensor,[5][6] and tools for designing distributed sensors that can communicate cheaply.

Awards and honors[edit]

In 2001 Candès received an Alfred P. Sloan Research Fellowship.[1] He was awarded the James H. Wilkinson Prize in Numerical Analysis and Scientific Computing in 2005.[1] In 2006, he received the Vasil A. Popov Prize[3] as well as the National Science Foundation's highest honor: the Alan T. Waterman Award for research described by the NSF as "nothing short of revolutionary".[7] In 2010 Candès and Terence Tao were awarded the George Pólya Prize. In 2011, Candès was awarded the ICIAM Collatz Prize[8] Candès has also received the Lagrange Prize in Continuous Optimization, awarded by the Mathematical Optimization Society (MOS) and the Society for Industrial and Applied Mathematics (SIAM). He was also presented with the Dannie Heineman Prize by the Academy of Sciences at Göttingen in 2013. In 2014 he was elected to the National Academy of Sciences.[9] In 2015 he will receive the George David Birkhoff Prize of the AMS / SIAM. He is also a fellow of SIAM.[10] In 2017 Candès received the MacArthur Fellowship for exploring the limits of signal recovery and matrix completion from incomplete data sets with implications for high-impact applications in multiple fields.[11] He was elected to the 2018 class of fellows of the American Mathematical Society.[12]

References[edit]

External links[edit]