University of Cambridge > Talks.cam > Applied and Computational Analysis > Compressive Sensing with Structured Random Matrices

Compressive Sensing with Structured Random Matrices

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

  • UserHolger Rauhut (Aachen University)
  • ClockThursday 09 March 2017, 15:00-16:00
  • HouseMR 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity