Communication theoretic image restoration for binary-valued imagery.

We present a new image-restoration algorithm for binary-valued imagery. A trellis-based search method is described that exploits the finite alphabet of the target imagery. This algorithm seeks the maximum-likelihood solution to the image-restoration problem and is motivated by the Viterbi algorithm for traditional binary data detection in the presence of intersymbol interference and noise. We describe a blockwise method to restore two-dimensional imagery on a row-by-row basis and in which a priori knowledge of image pixel correlation structure can be included through a modification to the trellis transition probabilities. The performance of the new Viterbi-based algorithm is shown to be superior to Wiener filtering in terms of both bit error rate and visual quality. Algorithmic choices related to trellis state configuration, complexity reduction, and transition probability selection are investigated, and various trade-offs are discussed.

[1]  M. Ibrahim Sezan,et al.  Tutorial review of recent developments in digital image restoration , 1990, Other Conferences.

[2]  L Hesselink,et al.  Signal detection for page-accessoptical memories with intersymbol interference. , 1996, Applied optics.

[3]  Lambertus Hesselink,et al.  Channel codes for digital holographic data storage , 1995 .

[4]  L D Marks,et al.  Wiener-filter enhancement of noisy HREM images. , 1996, Ultramicroscopy.

[5]  B V Kumar,et al.  Application of linear minimum mean-squared-error equalization for volume holographic data storage. , 1999, Applied optics.

[6]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[7]  Mario Bertero,et al.  Regularization methods in image restoration: An application to HST images , 1995, Int. J. Imaging Syst. Technol..

[8]  Keith M. Chugg,et al.  Near-optimal parallel distributed data detection for page-oriented optical memories , 1998 .

[9]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[10]  Gerald Krell,et al.  Restoration of three-dimensional quasi-binary images from confocal microscopy and its application to dendritic trees , 1997, Photonics West - Biomedical Optics.

[11]  C. M. Jefferson,et al.  Modulation coding for pixel-matched holographic data storage. , 1997, Optics letters.

[12]  M L Giger,et al.  Application of the EM algorithm to radiographic images. , 1992, Medical physics.

[13]  M A Neifeld,et al.  Parallel detection algorithm for page-oriented optical memories. , 1998, Applied optics.

[14]  Keith M. Chugg,et al.  Two-dimensional equalization in coherent and incoherent page-oriented optical memory , 1999 .

[15]  Fast maximum entropy restoration of low-noise solar images , 1997 .

[16]  T M Jovin,et al.  Improved restoration from multiple images of a single object: application to fluorescence microscopy. , 1998, Applied optics.

[17]  Dana H. Brooks,et al.  Electrical imaging of the heart , 1997, IEEE Signal Process. Mag..

[18]  Ping Wah Wong.  Entropy-constrained halftoning using multipath tree coding , 1997, IEEE Trans. Image Process..

[19]  Antonio Ortega,et al.  An iterative algorithm for two-dimensional digital least metric problems with applications to digital image compression , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[20]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .