Abstract
Image restoration from degraded observations and from properties that the image is supposed to satisfy has been approached by the method of projections onto convex constraint sets. Previous attempts have incorporated only partially the knowledge that we possess about the image to be restored because of difficulties in the implementation of some of the projections. In the parallel-projection algorithm presented here the a priori knowledge can be fully exploited. Moreover, the algorithm operates well even if the constraints are nonconvex and/or if the constraints have an empty intersection, without a limitation on the (finite) number of constraint sets.
© 1995 Optical Society of America
Full Article | PDF ArticleMore Like This
Joseph Rosen
Opt. Lett. 18(14) 1183-1185 (1993)
Aharon Levi and Henry Stark
J. Opt. Soc. Am. A 1(9) 932-943 (1984)
Joseph Rosen and Joseph Shamir
Opt. Lett. 16(10) 752-754 (1991)