Projection-based image restoration

We address the problem of noise smoothing in image restoration. We introduce several normed derivative constraints and compute their associated projectors. Several image-restoration algorithms that use these constraints, among others, are proposed. The issue of set closure is addressed, and it is shown that sets incorporating bounds on derivative norms are closed in L2.

[1]  G. Kitagawa,et al.  A smoothness priors time-varying AR coefficient modeling of nonstationary covariance time series , 1985, IEEE Transactions on Automatic Control.

[2]  Alexander A. Sawchuk,et al.  Adaptive Noise Smoothing Filter for Images with Signal-Dependent Noise , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  H Stark,et al.  High-resolution image recovery from image-plane arrays, using convex projections. , 1989, Journal of the Optical Society of America. A, Optics and image science.

[4]  E. Oja,et al.  Projection filter, Wiener filter, and Karhunen-Loève subspaces in digital image restoration , 1986 .

[5]  Erkki Oja,et al.  Parametric projection filter for image and signal restoration , 1986, IEEE Trans. Acoust. Speech Signal Process..

[6]  D. Youla,et al.  Image Restoration by the Method of Convex Projections: Part 1ߞTheory , 1982, IEEE Transactions on Medical Imaging.

[7]  H. Trussell,et al.  The feasible solution in signal restoration , 1984 .

[8]  C T Chen,et al.  Superresolved tomography by convex projections and detector motion. , 1992, Journal of the Optical Society of America. A, Optics and image science.

[9]  Henry Stark,et al.  Signal recovery with similarity constraints , 1989 .

[10]  Jr. Thomas G. Stockham,et al.  Image processing in the context of a visual model , 1972 .