Blind deconvolution using the Richardson-Lucy algorithm

Physics – Optics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Blind deconvolution using the Richardson-Lucy algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Blind deconvolution using the Richardson-Lucy algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blind deconvolution using the Richardson-Lucy algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1415629

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.