COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Continuous optimization for imagingAdd 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.
|