Linear and one-bit compressive sensing with subsampled random convolutions
Duration: 50 mins 54 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Rauhut, H
Tuesday 18th June 2019 - 14:20 to 15:10 |
|---|
| Created: | 2019-06-19 09:02 |
|---|---|
| Collection: | Approximation, sampling, and compression in high dimensional problems |
| Publisher: | Isaac Newton Institute |
| Copyright: | Rauhut, H |
| Language: | eng (English) |
| Abstract: | 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 740.60 MB | View | Download | |
| WebM | 640x360 | 510.05 kbits/sec | 190.21 MB | View | Download | |
| iPod Video | 480x270 | 522.16 kbits/sec | 194.67 MB | View | Download | |
| MP3 | 44100 Hz | 249.79 kbits/sec | 93.22 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||