Image restoration with the Viterbi algorithm.
The Viterbi algorithm (VA) is known to given an optimal solution to the problem of estimating one-dimensional sequences of discrete-valued pixels corrupted by finite-support blur and memoryless noise. A row-by-row estimation along with decision feedback and vector quantization is used to reduce the computational complexity of the VA and allow the estimation of two-dimensional images. This reduced-complexity VA (RCVA) is shown to produce near-optimal estimation of random binary images. In addition, simulated restorations of gray-scale images show the RCVA estimates to be an improvement over the estimates obtained by the conventional Wiener filter (WF). Unlike the WF, the RCVA is capable of superresolution and is adaptable for use in restoring data from signal-dependent Poisson noise corruption. Experimental restorations of random binary data gathered from an optical imaging system support the simulations and show that the RCVA estimate has fewer than one third of the errors of the WF estimate.
Miller
C
C
Department of Electrical and Electronic Engineering, University of Canterbury, Christchurch, New Zealand. c.miller@elec.canterbury.ac.nz
Hunt
B R
BR
Marcellin
M W
MW
Neifeld
M A
MA
D000465:Algorithms; D016477:Artifacts; D006801:Humans; D007091:Image Processing, Computer-Assisted; D016013:Likelihood Functions; D008962:Models, Theoretical