University of Cambridge > Talks.cam > Applied and Computational Analysis > Iterative Algorithms in Compressive Sensing

  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

Iterative Algorithms in Compressive Sensing

Download to your calendar using vCal

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb .

Over the past few years, $\ell_1$-minimization has become the most popular method to recover sparse vectors from incomplete linear measurements. However, simpler iterative algorithms such as Iterative Hard Thresholding present the same theoretical guarantees when the measurement matrix satisfies the restricted isometry property. In this talk, I will focus on iterative algorithms that converge in a finite number of iterations proportional to the sparsity level. This fact was observed only recently for (weak) Orthogonal Matching Pursuit. I will also demonstrate a similar result for Hard Thresholding Pursuit. Advantages of the latter algorithm will be recalled along the way.

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

The obesity epidemic: Discussing the global health crisis CRASSH and CRP, Alison Richard Building, West Road, University of Cambridge https://zoom.us/j/98188045146

Other talks

Nationalising Oil and Knowledge in Iran: Labour, Decolonisation and Colonial Modernity, 1933–51 Title to be confirmed External Seminar - Michael Raissig TBC Title TBC "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. The rise of local cartography in Europe, 12th-14th century
 

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