One of the essential ways in which nonlinear image restoration algorithms differ from linear, convolution-type image restoration filters is their capability to restrict the restoration result to nonnegative intensities. The iterative constrained Tikhonov–Miller (ICTM) algorithm, for example, incorporates the nonnegativity constraint by clipping all negative values to zero after each iteration. This constraint will be effective only when the restored intensities have near-zero values. Therefore the background estimation will have an influence on the effectiveness of the nonnegativity constraint of these algorithms. We investigated quantitatively the dependency of the performance of the ICTM, Carrington, and Richardson–Lucy algorithms on the estimation of the background and compared it with the performance of the linear Tikhonov–Miller restoration filter. We found that the performance depends critically on the background estimation: An underestimation of the background will make the nonnegativity constraint ineffective, which results in a performance that does not differ much from the Tikhonov–Miller filter performance. A (small) overestimation, however, degrades the performance dramatically, since it results in a clipping of object intensities. We propose a novel general method to estimate the background based on the dependency of nonlinear restoration algorithms on the background, and we demonstrate its applicability on real confocal images.
© 2000 Optical Society of AmericaFull Article | PDF Article