Share Email Print

Proceedings Paper

Optimization issues in blind deconvolution algorithms
Author(s): Eric Thiebaut
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Modern blind deconvolution algorithms combine agreement with the data and regularization constraints into a single criteria (a so-called penalizing function) that must be minimized in a restricted parameter space (at least to insure positivity). Numerically speaking, blind deconvolution is a constrained optimization problem which must be solved by iterative algorithms owning to the very large number of parameters that must be estimated. Additional strong difficulties arise because blind deconvolution is intrinsically ambiguous and highly non-quadratic. This prevent the problem to be quickly solved. Various optimizations are proposed to considerably speed up blind deconvolution. These improvements allow the application of blind deconvolution to very large images that are now routinely provided by telescope facilities. First, it is possible to explicitly cancel the normalization ambiguity and therefore improve the condition number of the problem. Second, positivity can be enforced by gradient projection techniques without the need of a non-linear re-parameterization. Finally, superior convergence rates can be obtained by using a small sub-space of ad-hoc search directions derived from the effective behavior of the penalizing function.

Paper Details

Date Published: 19 December 2002
PDF: 10 pages
Proc. SPIE 4847, Astronomical Data Analysis II, (19 December 2002); doi: 10.1117/12.461151
Show Author Affiliations
Eric Thiebaut, CRAL/Observatoire de Lyon (France)

Published in SPIE Proceedings Vol. 4847:
Astronomical Data Analysis II
Jean-Luc Starck; Fionn D. Murtagh, Editor(s)

© SPIE. Terms of Use
Back to Top