Share Email Print

Proceedings Paper

Blind deconvolution using the Richardson-Lucy algorithm
Author(s): Henri Lanteri; Claude Aime; Hubert Beaumont; Philippe Gaucherel
Format Member Price Non-Member Price
PDF $17.00 $21.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

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.

Paper Details

Date Published: 21 December 1994
PDF: 11 pages
Proc. SPIE 2312, Optics in Atmospheric Propagation and Random Phenomena, (21 December 1994); doi: 10.1117/12.197374
Show Author Affiliations
Henri Lanteri, Univ. de Nice-Sophia Antipolis (France)
Claude Aime, Univ. de Nice-Sophia Antipolis (France)
Hubert Beaumont, Univ. de Nice-Sophia Antipolis (France)
Philippe Gaucherel, Univ. de Nice-Sophia Antipolis (France)

Published in SPIE Proceedings Vol. 2312:
Optics in Atmospheric Propagation and Random Phenomena
Anton Kohnle; Adam D. Devir, Editor(s)

© SPIE. Terms of Use
Back to Top