Iterative Algorithms in Compressive Sensing

Add to your list(s) Download to your calendar using vCal

• Simon Foucart (Drexel University)
• Tuesday 19 March 2013, 15:00-16:00
• MR 14, CMS.

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

Over the past few years, $\ell_1$-minimization has become the most popular method to recover sparse vectors from incomplete linear measurements. However, simpler iterative algorithms such as Iterative Hard Thresholding present the same theoretical guarantees when the measurement matrix satisfies the restricted isometry property. In this talk, I will focus on iterative algorithms that converge in a finite number of iterations proportional to the sparsity level. This fact was observed only recently for (weak) Orthogonal Matching Pursuit. I will also demonstrate a similar result for Hard Thresholding Pursuit. Advantages of the latter algorithm will be recalled along the way.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• Applied and Computational Analysis
• CMS Events
• DAMTP info aggregator
• Featured lists
• Interested Talks
• MR 14, CMS
• My seminars
• Type the title of a new list here
• bld31

Note that ex-directory lists are not shown.