Paper
21 December 1994 Blind deconvolution using the Richardson-Lucy algorithm
Henri Lanteri, Claude Aime, Hubert Beaumont, Philippe Gaucherel
Author Affiliations +
Abstract
The aim of this communication is to show how the Richardson-Lucy deconvolution algorithm can be applied to the blind deconvolution problem. After a brief description of the R.L algorithm itself, we start from the basic papers of Ayers and Dainty (1988) and Lane (1992) and introduce in their approach the R.L algorithm in several different ways. We show that the general behaviour of the proposed methods is analogous to that of the error-reduction algorithms and that good solutions can be obtained. The unregularized behaviour of the RL algorithm is overcame by a limitation of the iteration number. Moreover we compare the structures of the various algorithms proposed here and emphasise the main differences. The proposed algorithms are used to blindly deconvolve two types of objects (point-like and extended objects) blurred by simulated point spread functions similar to those observed at the focus of a small telescope in presence of at- mospheric turbulence. The error reduction term is given as a function of the iteration number.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Henri Lanteri, Claude Aime, Hubert Beaumont, and Philippe Gaucherel "Blind deconvolution using the Richardson-Lucy algorithm", Proc. SPIE 2312, Optics in Atmospheric Propagation and Random Phenomena, (21 December 1994); https://doi.org/10.1117/12.197374
Lens.org Logo
CITATIONS
Cited by 9 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Deconvolution

Point spread functions

Convolution

Algorithm development

Reconstruction algorithms

Image processing

Electronic filtering

Back to Top