I describe implementations of the Two-Mu image-restoration algorithm that model the center portion of the convolution of the point-spread function and the original image (this has been done heretofore), as well as those that model the full range of that convolution. The full convolution methods produce processed images of simple, simulated scenes that are comparable in quality with, and often involve computations that are considerably shorter than, those of the center convolution methods. The full convolution methods incur some loss of information near the edge of the scene. However, that loss may not be significant for large images, especially for those in which the important information is far from the edge of the scene.
© 2001 Optical Society of America
(100.0100) Image processing : Image processing
(100.1830) Image processing : Deconvolution
(100.2000) Image processing : Digital image processing
(100.3020) Image processing : Image reconstruction-restoration
J. D. Silverstein, "Alternative implementations of the Two-Mu algorithm," J. Opt. Soc. Am. A 18, 1853-1861 (2001)