The exam is scheduled for 19.02 in room 4/209. Please find you assigned time slot below.
This lecture covers the basic mathematical concepts In Compressed Sensing (CS). CS is a new sampling theory that started 2006 with the work of Candes, Tao and Donoho CRT06, Don06 and quickly attracted the attention of mathematicians from several areas due to the solid mathematical background. The key idea in CS in order to address the big data problem is not to sample data that can be recovered afterwards. The CS theory is built on three pillars: sparsity, uniform random subsampling and concentration of measure. This lecture will provide an introduction to this basic concepts and will give an overview of the established compressed sensing theory. In addition, we will discuss sparse optimization algorithms and several applications. The main reference is FR13.
The content of the lecture is targeted at students of mathematics and scientific computing with a long-term interest in mathematical imaging, to prepare them for more advanced topics closer to research. In an effort to help students draw relationships between the theoretical concepts and practical applications, the course is accompanied by an optional programming project.
English or German, as the audience requests.
All proofs are elementary and only require knowledge from the mandatory undegraduate courses on analysis, linear algebra and probabilities. Basic tools from convex optimization will be provided.
If you wish to attend the lecture and the exercises, please sign up using MÜSLI.
You have to be logged in to access the files listed below.