University of Cambridge > Talks.cam > Applied and Computational Analysis > Compressive Sensing with Structured Random Matrices

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Compressive Sensing with Structured Random Matrices

Download to your calendar using vCal

  • UserHolger Rauhut (Aachen University)
  • ClockThursday 09 March 2017, 15:00-16:00
  • HouseMR 14, CMS.

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 lists

Webinar & FW11, Computer Laboratory, William Gates Building. Henry Wellcome Building Seminar Room Epigenetics, Stem Cells, and Trophoblast

Other talks

Title TBC Machine Politics? Computers and AI in the History of Political Thought Title tbc Computation of free boundary minimal surfaces via extremal Steklov eigenvalues Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Formalising mathematics and spectral geometry in Lean
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity