## Sparse Signal Processing, Applications and Algorithms (summer semester)This course focusses on the applications and algorithmic aspects of the compressed sensing in real-world problems. It consists of a series of seminars to be presented by us and by the students. Although there are many interesting papers on the applications of compressed sensing, we have tried to select only those that provide fundamental insights into the compressed sensing problem and are easy to be read and be presented by the students. The first 4 weeks of the course will be covered by us. This will give the students enough time to read the paper and prepare their presentations. A tentative plan and a list of topics covered during the course is as follows: The Convex geometry of linear inverse problems by V. Chandrasekaranm, B. Recht, P. A. Parrilo, and A. S. Willsky. Kashin Splitting Theorem ‘‘A simple proof of Kashin's decomposition theorem’’ by S. Foucart. ‘‘The widths of certain finite-dimensional sets and classes of smooth functions’’ by B.S. Kashin, Izv. Akad. Nauk SSSR (Ser. Mat.), 41 (2) (1977), 334– 351, English transl.: Math. USSR-Izv., 11 (2) (1977), 317–333.
Low-complexity measurement and recovery RIP matrices with many 0's (sparse matrices) Expander graphs and -RIP ‘‘Efficient and Robust Compressed Sensing using Optimized Expander Graphs’’ by S. Jafarpour, W. Xu, B. Hassibi, R. Calderbank.
Recovery of individual signals Recovery guarantees for -minimization via dual certificate. Applications in line spectral denoising ‘‘Atomic norm denoising with applications to line spectral estimation’’ by B. N. Bhaskar, G. Tang, and B. Recht.
Other recovery algorithms Weighted -norm minimization
Further details: CommIT-TUB-website and ISIS/Moodle@TU-Berlin |