Image restoration with the Viterbi algorithm

Casey Miller, Bobby R. Hunt, Michael W Marcellin, Mark A Neifeld

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

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 grayscale 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.

Original languageEnglish (US)
Pages (from-to)265-275
Number of pages11
JournalJournal of the Optical Society of America A: Optics and Image Science, and Vision
Volume17
Issue number2
StatePublished - 2000

Fingerprint

Viterbi algorithm
Image reconstruction
Restoration
Noise
Optical Devices
Binary images
Optical Imaging
Vector quantization
Imaging systems
Computational complexity
Pixels
Feedback

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Computer Vision and Pattern Recognition

Cite this

Image restoration with the Viterbi algorithm. / Miller, Casey; Hunt, Bobby R.; Marcellin, Michael W; Neifeld, Mark A.

In: Journal of the Optical Society of America A: Optics and Image Science, and Vision, Vol. 17, No. 2, 2000, p. 265-275.

Research output: Contribution to journalArticle

@article{b6b313d7b5574862a038718e94548d23,
title = "Image restoration with the Viterbi algorithm",
abstract = "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 grayscale 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.",
author = "Casey Miller and Hunt, {Bobby R.} and Marcellin, {Michael W} and Neifeld, {Mark A}",
year = "2000",
language = "English (US)",
volume = "17",
pages = "265--275",
journal = "Journal of the Optical Society of America A: Optics and Image Science, and Vision",
issn = "1084-7529",
publisher = "The Optical Society",
number = "2",

}

TY - JOUR

T1 - Image restoration with the Viterbi algorithm

AU - Miller, Casey

AU - Hunt, Bobby R.

AU - Marcellin, Michael W

AU - Neifeld, Mark A

PY - 2000

Y1 - 2000

N2 - 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 grayscale 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.

AB - 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 grayscale 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.

UR - http://www.scopus.com/inward/record.url?scp=0034133154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034133154&partnerID=8YFLogxK

M3 - Article

VL - 17

SP - 265

EP - 275

JO - Journal of the Optical Society of America A: Optics and Image Science, and Vision

JF - Journal of the Optical Society of America A: Optics and Image Science, and Vision

SN - 1084-7529

IS - 2

ER -