Divide and conquer: splitting algorithms for inverse problems
Event details
| Date | 09.12.2010 |
| Hour | 10:00 |
| Speaker | Jalal M. Fadili |
| Location |
ELG 120
|
| Category | Conferences - Seminars |
This talk will focus on several optimization problems involved in inverse problems where the solution is assumed to be sparsely represented in an overcomplete dictionary of waveforms. Such problems appear in many fields including image and signal processing, and have
attracted even more interest since the emergence of the compressed sensing theory. In this talk, we formalize many of these problems within a unified and versatile framework of convex optimization theory,
and invoke tools from convex analysis (e.g. duality, proximity operators) and maximal monotone operator splitting. We show how fast iterative splitting algorithms can be used to solve these problems in their primal or dual versions.
Jalal M. Fadili graduated from the Ecole Nationale Supérieure d'Ingénieurs (ENSI) de Caen, France, and received the M.Sc. and Ph.D. degrees in signal and image processing from the University of Caen. He has been an Associate Professor of signal and image processing since September 2001 at ENSI.
Links
Practical information
- General public
- Free
Contact
- Pierre Vandergheynst