# Lecture: Compressed Sensing (MM35)

## Organisation

**Preliminary Discussion:**in 2.103 (INF 205) at 11:15 on April 27th 2022**Target Audience:**Bachelor/Master in Mathematics, Master Scientific Computing and related fields**Time:**every Wednesday 11:15-12:45 (lecture); every Tuesday 14:15-15:45 (tutorial);**Place:**Lecture: seminar room 2.103 (INF 205), Exercise class: seminar room 2.103 (INF 205)**Lecturer:**Stefania Petra**Language:**English

## Registration

If you wish to attend the lecture and the exercises, please join Teams.
If you have not activated your UNI ID for Teams please use this form
https://it-service.uni-heidelberg.de/anfrage/teams_benutzer_freischalten

You can use this code for joining Teams: **dku3hil**

## Content

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.

## Prerequisites

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.

## Literature

- S. Foucart, H. Rauhut, A Mathematical Introduction to Compressive Sensing, Birkhäuser, 2013
- S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004
- M. Ledoux, The Concentration of Measure Phenomenon American Mathematical Society, 2005
- R. Schneider, W. Weil, Stochastic and Integral Geometry, Springer, 2008
- J.-L. Starck, F. Mutagh, J.M. Fadili, Sparse Image and Signal Processing, Cambridge University Press, 2010