A Landweber algorithm for 3D confocal microscopy restoration

A new Landweber algorithm for 3D microscopy deconvolution is introduced in this paper. The algorithm is formulated from the Fredholm equation of the first kind. Artificial 3D images are used to test this algorithm and the restored results are compared with a nonlinear iterative deconvolution algorithm (IDA). The experimental results show that the Landweber algorithm can effectively suppress background noise and remove asymmetric point spread function (PSF) degradation. Finally, a typical real 3D confocal image is restored by the Landweber algorithm and the results are compared with IDA.

[1]  Moe Razaz,et al.  Comparison of an iterative deconvolution and Wiener filtering for image restoration , 1997 .

[2]  L. Schaefer,et al.  Generalized approach for accelerated maximum likelihood based image restoration applied to three‐dimensional fluorescence microscopy , 2001, Journal of microscopy.

[3]  L Landmann,et al.  Deconvolution improves colocalization analysis of multiple fluorochromes in 3D confocal data sets more than filtering techniques , 2002, Journal of microscopy.

[4]  Yves Goussard,et al.  Unsupervised 3-D restoration of tomographic images by constrained Wiener filtering , 1997, Proceedings of the 19th Annual International Conference of the IEEE Engineering in Medicine and Biology Society. 'Magnificent Milestones and Emerging Opportunities in Medical Engineering' (Cat. No.97CH36136).

[5]  Moe Razaz,et al.  Comparison of two nonlinear constrained algorithms for 3D image restoration , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[6]  H. Trussell,et al.  The Landweber iteration and projection onto convex sets , 1985, IEEE Trans. Acoust. Speech Signal Process..