Compressive Sensing with Structured Random Matrices

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

• Holger Rauhut (Aachen University)
• Thursday 09 March 2017, 15:00-16:00
• MR 14, CMS.

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

Compressive sensing predicts that sparse vectors can be recovered via efficient algorithms from what was previously believed to be incomplete information. Recovery methods include convex optimization approaches (l1-minimization). Provably optimal measurement process are described via Gaussian random matrices. In practice, however, more structure is required. We describe the state of the art on recovery results for several types of structured random measurement matrices, including random partial Fourier matrices and subsampled random convolutions.

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.