Generalized sampling and infinite-dimensional compressed sensing
Duration: 59 mins 47 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Hansen, A
Thursday 24 March 2011, 16:00-17:00 |
---|
Created: | 2011-03-25 16:48 | ||||
---|---|---|---|---|---|
Collection: | Compressed Sensing LMS Series 2011 | ||||
Publisher: | Isaac Newton Institute | ||||
Copyright: | Hansen, A | ||||
Language: | eng (English) | ||||
Credits: |
|
Abstract: | We will discuss a generalization of the Shannon Sampling Theorem that allows for reconstruction of signals in arbitrary bases. Not only can one reconstruct in arbitrary bases, but this can also be done in a completely stable way. When extra information is available, such as sparsity or compressibility of the signal in a particular bases, one may reduce the number of samples dramatically. This is done via Compressed Sensing techniques, however, the usual finite-dimensional framework is not sufficient. To overcome this obstacle I'll introduce the concept of Infinite-Dimensional Compressed Sensing. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.84 Mbits/sec | 829.14 MB | View | Download | |
WebM | 640x360 | 809.72 kbits/sec | 354.16 MB | View | Download | |
Flash Video | 484x272 | 568.77 kbits/sec | 249.05 MB | View | Download | |
iPod Video | 480x270 | 506.27 kbits/sec | 221.68 MB | View | Download | |
MP3 | 44100 Hz | 125.02 kbits/sec | 54.55 MB | Listen | Download | |
Auto * | (Allows browser to choose a format it supports) |