University of Cambridge > Talks.cam > Numerical Analysis > Compressive sensing principles and iterative sparse recovery for inverse and ill-posed problems

Compressive sensing principles and iterative sparse recovery for inverse and ill-posed problems

Add to your list(s) Download to your calendar using vCal

  • UserGerd Teschke (TU Braunschweig)
  • ClockTuesday 09 November 2010, 15:00-16:00
  • HouseCMS, MR14.

If you have a question about this talk, please contact Dr Shadrin.

Note that this NA seminar is on Tuesday

In this talk we shall be concerned with compressive sampling strategies and sparse recovery principles for linear inverse and ill-posed problems. As the main result, we provide compressed measurement models for ill-posed problems and recovery accuracy estimates for sparse approximations of the solution of the underlying inverse problem. The main ingredients are variational formulations that allow the treatment of ill-posed operator equations in the context of compressively sampled data. In particular, we rely on Tikhonov variational and constrained optimization formulations. One essential difference to the classical compressed sensing framework is the incorporation of joint sparsity measures allowing the treatment of infinite dimensional reconstruction spaces. The theoretical results are furnished with a number of numerical experiments.

This talk is part of the Numerical Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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