Abstract

We describe the implementation of a technique for achieving image superresolution using a fully connected network of simple processors operating in an iterative mode. We show that an updating scheme can be specified that ensures convergence for the serial (asynchronous) updating case. With the appropriate hardware, parallel (synchronous) updating becomes of particular interest because of the potential for accelerated convergence; it is this approach that we envisage implementing in optical hardware. For this case also, we present a convergent scheme that can be related to a regularized form of the Gerchberg–Papoulis algorithm.

© 1990 Optical Society of America

Image restoration by the shift-and-add algorithm

William G. Bagnuolo
Opt. Lett. 10(5) 200-202 (1985)

Improved restoration using a modification of the minimum-negativity iterative algorithm

Samuel J. Howard
Appl. Opt. 29(2) 266-274 (1990)

Image preprocessing for improving computational efficiency in implementation of restoration and superresolution algorithms

Malur K. Sundareshan, Supratik Bhattacharjee, Radhika Inampudi, and Ho-Yuen Pang
Appl. Opt. 41(35) 7464-7474 (2002)

Image restoration with the Viterbi algorithm

Casey Miller, Bobby R. Hunt, Michael W. Marcellin, and Mark A. Neifeld
J. Opt. Soc. Am. A 17(2) 265-275 (2000)

Modified shift-and-add speckle imaging algorithm

Denis J. Gingras and Tadashi Aruga
Opt. Lett. 15(23) 1380-1382 (1990)