|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 listsCambridge Energy Conference Cambridge Festival of Ideas 2015 Engineers Without Borders Panel Talks
Other talksSpace Weather and Satellites A geometric approach to constructing conformal nets Cellulose-based helical micro/nano filaments and films Black and British Migration Presentation: Challenge 4. Making Decisions Using Uncertain Forecasts Postgraduate Diploma in Entrepreneurship webinar