Continuous optimization for imaging
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.
Other views and ways to subscribe
- Create Custom View
- Subscribe using iCal/vCal (Help)
- Subscribe to RSS feed
Please read notes first - Manage e-mail reminders - see link at top of page
- Plain Text View
You can include this list in your own website. Read the instructions and click 'Create Custom View' to get started.
List Managers
Each talk has an organiser. Contact them first about a specific talk. Contact a manager below about the list itself.
Log in to see manager contact details.
Lists included in this list
- This list does not include any other list
Lists that include this list
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)
