Generalized Sampling and Infinite-Dimensional Compressed Sensing

44 mins 43 secs,  620.20 MB,  MPEG-4 Video  640x360,  29.97 fps,  44100 Hz,  1.84 Mbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Hansen, A (University of Cambridge)
Friday 26 August 2011, 14:45-15:30
 
Created: 2011-08-31 12:51
Collection: Inverse Problems
Publisher: Isaac Newton Institute
Copyright: Hansen, A
Language: eng (English)
Credits:
Author:  Hansen, A
Director:  Steve Greenham
 
Abstract: I will discuss a generalization of the Shannon Sampling Theorem that allows for reconstruction of signals in arbitrary bases (and frames). 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 basis, 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 620.20 MB View Download
WebM 640x360    747.92 kbits/sec 244.59 MB View Download
Flash Video 484x272    568.77 kbits/sec 186.28 MB View Download
iPod Video 480x270    506.28 kbits/sec 165.82 MB View Download
MP3 44100 Hz 125.02 kbits/sec 40.75 MB Listen Download
Auto (Allows browser to choose a format it supports)