University of Cambridge > > Continuous optimization for imaging

Continuous optimization for imaging

Add to your list(s) Send you e-mail reminders

This series of lectures will cover recent optimisation techniques for imaging. The specificities many imaging problems are

- their size (usually “large” but not “huge”),

- the structure of the data, on a 2 or 3D grid, which allows for very basic parallelism (as implemented in GPUs)

- their lack of smoothness

The lectures will therefore focus essentially on (mostly convex) optimisation methods for non-smooth problems: duality, proximity operators and proximal splitting, etc. We will discuss rates of convergence of first order methods (lower bound, “optimal” algorithms…) and try to describe practically useful algorithms and general convergence analysis techniques.

This list is ex-directory. This means that it does not appear in the index. Note that, like with a telephone, people can still access the list by guessing its number. Note that, unlike with a telephone, guessing the number is a trivial challenge.

Other views and ways to subscribe

You can include this list in your own website. Read the Instructions on how to include a list in your site and then click on 'Create Custom View' above to get started.

List Managers

Each talk has an organiser. Please contact them in the first instance if you have a query about a particular talk. Only contact one of the people below if you have a question about the list, such as whether your talk or series could be added.

(In order to see the manager's details, such as their e-mail, you will need to have an account and log in)

Lists included in this list

This list does not include any other list

Lists that include this list

Note that ex-directory lists are not shown.


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