Differences
This shows you the differences between two versions of the page.
|
teaching:ft1920:vl:cs [2020/01/14 14:07] ipa [Lecture Notes] |
teaching:ft1920:vl:cs [2021/03/02 13:28] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Lecture: Compressed Sensing (MM35) ====== | ||
| - | |||
| - | ===== Organisation ===== | ||
| - | |||
| - | * **Preliminary Discussion:** in SR 6 (INF 205) at 11:15 on October 16th 2019 | ||
| - | * **Target Audience:** Bachelor/Master in Mathematics, Master Scientific Computing and related fields | ||
| - | * **Time:** every Wednesday 11:15-12:45 (lecture); every Friday 11:15-12:45 (tutorial); | ||
| - | * **Place:** Lecture: seminar room SR 6 (INF 205), Exercise class: seminar room SR 5 (INF 205) | ||
| - | * **Lecturer:** [[https://www.stpetra.com|Stefania Petra]] | ||
| - | * **Language:** English | ||
| - | |||
| - | ===== 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 | ||
| - | [[http://people.ee.duke.edu/~lcarin/01580791.pdf|CRT06]], [[http://ieeexplore.ieee.org/document/1614066/|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 [[http://www.springer.com/de/book/9780817649470|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 | ||
| - | |||
| - | ===== Registration ===== | ||
| - | |||
| - | If you wish to attend the lecture and the exercises, please sign up using [[https://muesli.mathi.uni-heidelberg.de/|MÜSLI]]. | ||
| - | |||
| - | <color #ed1c24>You have to be logged in to access the files listed below.</color> | ||
| - | |||
| - | ===== Lecture Notes ===== | ||
| - | * Week 1 {{ :teaching:ft1920:vl:cs:files:introcs_wt2019_20.pdf |Introduction slides}} {{ :teaching:ft1920:vl:cs:files:introduction.pdf |Introduction}} | ||
| - | * Week 2 {{ :teaching:ft1920:vl:vectorspacessparsity.pdf |Vector spaces; Sparsity, compressibility;}} | ||
| - | * Week 3 {{ :teaching:ft1920:vl:cs:files:spark.pdf |Uniqueness of l0-minimization; Spark; Discrete tomography }} {{ :teaching:ft1920:vl:cs:files:spark-tomo-matrix.pdf |Slides: Worst vs average case recovery in discrete tomography}} | ||
| - | * Week 4 {{ :teaching:ft1920:vl:cs:files:l0-lp-minimization.pdf |Instance optimality; NP-hardness; lp-Minimization}} {{ :teaching:ft1920:vl:cs:files:l0-np-hardness.pdf |Slides NP-hardness}} | ||
| - | * Week 5 {{ :teaching:ft1920:vl:cs:files:nsp.pdf |(Stable/robust) null space property}} | ||
| - | * Week 6 {{ :teaching:ft1920:vl:cs:files:co-part1.pdf |Elements of convex analysis (part 1)}} | ||
| - | * Week 7 {{ :teaching:ft1920:vl:cs:files:co-summary-part2.pdf |Elements of convex analysis (part 2)}} | ||
| - | * Week 8 {{ :teaching:ft1920:vl:cs:files:dualcertificates.pdf |Dual certificates}} | ||
| - | * Week 9 {{ :teaching:ft1920:vl:cs:files:furtheruniquenessconditions.pdf |Projected crosspolytope; Further uniqueness/stability conditions}} | ||
| - | * Week 10 {{ :teaching:ft1920:vl:cs:files:rip.pdf |Restricted isometry property}} | ||
| - | * Week 11 {{ :teaching:ft1920:vl:cs:files:coherence.pdf |Coherence}} | ||
| - | * Week 12 No lecture! | ||