## Parallel Image Restoration with a Two-Dimensional Likelihood-Based Algorithm

Applied Optics, Vol. 41, Issue 23, pp. 4812-4824 (2002)

http://dx.doi.org/10.1364/AO.41.004812

Acrobat PDF (1026 KB)

### Abstract

We describe a pixelwise parallel algorithm for the restoration of images that have been corrupted by a low-pass optical channel and additive noise. This new algorithm is based on an iterative soft-decision method of error correction (i.e., turbo decoding) and offers performance on binary-valued imagery that is comparable to the Viterbi algorithm. We quantify the restoration performance of this new algorithm on random binary imagery for which it is superior to both the Wiener filter and the projection onto convex sets algorithms over a wide range of channels. For typical optical channels, the new algorithm is within 0.5 dB of the two-dimensional Viterbi restoration method [J. Opt. Soc. Am. A **17,** 265 (2000)]. We also demonstrate the extension of our new algorithm to correlated and gray-scale images using vector quantization to mitigate the associated complexity burden. A highly parallel focal-plane implementation is also discussed, and a design study is presented to quantify the capabilities of such a VLSI hardware solution. We find that video-rate restoration on 252 × 252 pixel images is possible using current technology.

© 2002 Optical Society of America

**OCIS Codes**

(100.3020) Image processing : Image reconstruction-restoration

(100.3190) Image processing : Inverse problems

(100.6640) Image processing : Superresolution

(200.3050) Optics in computing : Information processing

(200.4960) Optics in computing : Parallel processing

**Citation**

Mark A. Neifeld and Yong Wu, "Parallel Image Restoration with a Two-Dimensional Likelihood-Based Algorithm," Appl. Opt. **41**, 4812-4824 (2002)

http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-41-23-4812

Sort: Year | Journal | Reset

### References

- H. C. Andrew and B. R. Hunt, Digital Image Restoration (Prentice-Hall, Englewood Cliffs, N.J., 1977).
- M. I. Sezan and A. M. Tekalp, “Tutorial review of recent development in digital image restoration,” in Visual Communications and Image Processing 1990, M. Kunt, ed., Proc. SPIE 1360, 1346–1359 (1990).
- C. Miller, B. R. Hunt, M. W. Marcellin, and M. A. Neifeld, “Image restoration with the Viterbi algorithm,” J. Opt. Soc. Am. A 17, 265–275 (2000).
- M. A. Neifeld, R. Xuan, and M. W. Marcellin, “Communication theoretic image restoration for binary-valued imagery,” Appl. Opt. 39, 269–276 (2000).
- J. F. Heanue, K. Gurkan, and L. Hesselink, “Signal detection for page-access optical memories with intersymbol interference,” Appl. Opt. 35, 2431–2438 (1996).
- J. S. Lim, Two-Dimensional Signal and Image Processing (Prentice-Hall, Englewood Cliffs, N.J., 1990).
- D. C. Youla and H. Webb, “Image restoration by the method of convex projections: Part 1. Theory,” IEEE Trans. Med. Imaging MI-1, 81–94 (1982).
- C. Berrou, A. Glavieux, and P. Thitimajishima, “Near Shannon limit error-correction coding and decoding: turbo-codes (1),” in Proceedings of the IEEE International Conference on Communications (Institute of Electrical and Electronics Engineers, New York, 1993), pp. 1064–1070.
- J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inf. Theory 42, 409–445 (1996).
- X. Chen, K. M. Chugg, and M. A. Neifeld, “Near-optimal parallel distributed data detection for page-oriented optical memories,” IEEE J. Sel. Top. Quantum Electron. 4, 866–879 (1998).
- W.-C. Chou and M. A. Neifeld, “Soft-decision array decoding for volume holographic memory systems,” J. Opt. Soc. Am. A 18, 185–194 (2001).
- Ref. 6, pp. 359–361.
- R. W. Gerchberg, “Super resolution through error energy reduction,” Opt. Acta 21, 709–720 (1974).
- Y. Linde, A. Buzo, and R. M. Gray, “An algorithm for vector quantization design,” IEEE Trans. Commun. T-COM-28, 84–95 (1980).
- G. Cauwenberghs, “A micropower CMOS algorithm A/D/A converter,” IEEE Trans. Circuits Syst. I 42, 913–919 (1995).

## Cited By |
Alert me when this paper is cited |

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article | Next Article »

OSA is a member of CrossRef.