Binary image reconstruction via 2-D Viterbi search

Many systems in widespread use concentrate on the imaging of binary objects, e.g., the archival storage of text documents on microfilm or the facsimile transmission of text. Due to the imperfect nature of such systems, the binary image is unavoidably corrupted by blur and noise to form a grey-scale image. We present a technique to reverse this degradation which maps the binary object reconstruction problem into a Viterbi state-trellis. We assign states of the trellis to possible outcomes of the reconstruction estimate and search the trellis in the usual optimal fashion. Our method yields superior estimates of the original binary object over a wide range of signal-to-noise ratios (SNR) when compared with conventional Wiener filter (WF) estimates. For moderate blur and SNR levels, the estimates produced approach the maximum likelihood (ML) bound on estimation performance.

[1]  Stanley J. Simmons,et al.  Breadth-first trellis decoding with adaptive effort , 1990, IEEE Trans. Commun..

[2]  K.M. Chugg Performance of optimal digital page detection in a two-dimensional ISI/AWGN channel , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

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

[4]  Yoichi Sato,et al.  Optimum soft-output detection for channels with intersymbol interference , 1995, IEEE Trans. Inf. Theory.

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