Paper
19 December 2002 Optimization issues in blind deconvolution algorithms
Author Affiliations +
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Eric Thiebaut "Optimization issues in blind deconvolution algorithms", Proc. SPIE 4847, Astronomical Data Analysis II, (19 December 2002); https://doi.org/10.1117/12.461151
Lens.org Logo
CITATIONS
Cited by 65 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Deconvolution

Optimization (mathematics)

Point spread functions

Condition numbers

Data modeling

Inverse problems

Solids

Back to Top