Communication theoretic image restoration for binary-valued imagery

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)269-276
Number of pages8
JournalApplied Optics
Volume39
Issue number2
StatePublished - Jan 10 2000

Fingerprint

Image reconstruction
imagery
restoration
communication
Communication
transition probabilities
Viterbi algorithm
Intersymbol interference
Wiener filtering
binary data
alphabets
Bit error rate
Maximum likelihood
bit error rate
Pixels
pixels
interference
configurations

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Communication theoretic image restoration for binary-valued imagery. / Neifeld, Mark A; Xuan, Ruozhong; Marcellin, Michael W.

In: Applied Optics, Vol. 39, No. 2, 10.01.2000, p. 269-276.

Research output: Contribution to journalArticle

@article{13f9e4064e764223a69234af79039da9,
title = "Communication theoretic image restoration for binary-valued imagery",
abstract = "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.",
author = "Neifeld, {Mark A} and Ruozhong Xuan and Marcellin, {Michael W}",
year = "2000",
month = "1",
day = "10",
language = "English (US)",
volume = "39",
pages = "269--276",
journal = "Applied Optics",
issn = "1559-128X",
publisher = "The Optical Society",
number = "2",

}

TY - JOUR

T1 - Communication theoretic image restoration for binary-valued imagery

AU - Neifeld, Mark A

AU - Xuan, Ruozhong

AU - Marcellin, Michael W

PY - 2000/1/10

Y1 - 2000/1/10

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

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

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

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

M3 - Article

C2 - 18337894

AN - SCOPUS:0009990361

VL - 39

SP - 269

EP - 276

JO - Applied Optics

JF - Applied Optics

SN - 1559-128X

IS - 2

ER -