Most digital image restoration algorithms are inherently incomplete because they are conditioned on a discrete-input, discrete-output model which only accounts for blurring during image gathering and additive noise. For those restoration applications where sampling and reconstruction (display) are important the restoration algorithm should be based on a more comprehensive end-to-end model which also accounts for the potentially important noise-like effects of aliasing and the low- pass filtering effects of interpolative reconstruction. In this paper we demonstrate that, although the mathematics of this more comprehensive model is more complex, the increase in complexity is not so great as to prevent a complete development and analysis of the associated minimum mean- square error (Wiener) restoration filter. We also survey recent results related to the important issue of implementing this restoration filter, in the spatial domain, as a computationally efficient small convolution kernel.
[1]
F. O. Huck,et al.
Wiener restoration of sampled image data: end-to-end analysis
,
1988
.
[2]
Stephen E. Reichenbach,et al.
Small convolution kernels for high-fidelity image restoration
,
1991,
IEEE Trans. Signal Process..
[3]
Stephen E. Reichenbach,et al.
Small-kernel image restoration
,
1989
.
[4]
Robert A. Schowengerdt,et al.
Image reconstruction by parametric cubic convolution
,
1982,
Comput. Graph. Image Process..
[5]
M. Ibrahim Sezan,et al.
Survey of recent developments in digital image restoration.
,
1990
.
[6]
Zia-ur Rahman,et al.
Image gathering and digital restoration for fidelity and visual quality
,
1991,
CVGIP Graph. Model. Image Process..
[7]
William F. Schreiber,et al.
Fundamentals of Electronic Imaging Systems
,
1986
.
[8]
Stephen E. Reichenbach,et al.
Optimal focal-plane restoration
,
1989
.