University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Linear and one-bit compressive sensing with subsampled random convolutions

Linear and one-bit compressive sensing with subsampled random convolutions

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

If you have a question about this talk, please contact info@newton.ac.uk.

ASCW03 - Approximation, sampling, and compression in high dimensional problems

Compressive sensing predicts that sparse vectors can recovered from incomplete linear measurements with efficient algorithms in a stable way. While many theoretical results work with Gaussian random measurement matrices, practical applications usually demand for structure. The talk covers the particular case of structured random measurements defined via convolution with a random vector and subsampling (deterministic or random as well). We will give an overview on the corresponding theory and will cover also recent results concerning recovery from one-bit measurements arising in quantized compressive sensing.
Based on joint works with Felix Krahmer, Shahar Mendelson, Sjoerd Dirksen and Hans-Christian Jung.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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