|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Compressive Sensing with Structured Random Matrices
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.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsPalaeolithic-Mesolithic Discussion Group, Department of Archaeology Martin Centre Research Seminar Series - 47st Annual Series of Lunchtime Lectures German Society Speaker Events
Other talksVibrating cables & flapping flags: classical fluid-solid instabilities or energy sources ? Free entropy dimension and the orthogonal free quantum groups Innovative statistical approaches for studies in anti-infective drug combination development The Role of G Proteins in Central Regulation of Energy & Glucose Metabolism Some exciting news from MUSE A solid state conceptualization of information transfer from gene to message to protein