SurveyCompressedSensing_Revision教材.pdfVIP

GAMM-Mitteilungen, 28 August 2012 Theory and Applications of Compressed Sensing Gitta Kutyniok ∗ Technische Universit¨at Berlin Institut f¨ur Mathematik Straße des 17. Juni 136 10623 Berlin Germany Received XXXX, revised XXXX, accepted XXXX Published online XXXX Key words Dimension reduction, frames, greedy algorithms, ill-posed inverse problems, ℓ1 minimization, random matrices, sparse approximation, sparse recovery MSC (2000) 94A12, 65F22, 94A20, 68U10, 90C25, 15B52 Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that high-dimensional signals, which allow a sparse representation by a suitable basis or, more generally, a frame, can be recovered from what was previously considered highly incomplete linear measurements by using efficient algorithms. This article shall serve as an introduction to and a survey about compressed sensing. Copyright line will be provided by the publisher 1 Introduction The area of compressed sensing was initiated in 2006 by two groundbreaking papers, namely [18] by Donoho and [11] by Cand`es, Romberg, and Tao. Nowadays, after only 6 years, an abundance of theoretical aspects of compressed sensing are explored in more than 1000 articles. Moreover, this methodology is to date extensively utilized by applied mathemati- cians, computer scientists, and engineers for a variety of applications in astronomy, biology, medicine, radar, and seismology, to name a few.