Deinterlacing by successive approximation

Jelena Kovacevic, Robert J. Safranek, Edmund M. Yeh

Research output: Contribution to journalArticle

Abstract

We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since motion-compensated part uses the previously interpolated frame. Furthermore, bidirectional motion estimation and compensation allow for better performance in case of scene changes and covering/uncovering of objects. Experiments are run both on "real-world" and computer generated sequences. Finally, subjective testing is performed to evaluate the quality of the algorithm.

Original languageEnglish (US)
Pages (from-to)339-344
Number of pages6
JournalIEEE Transactions on Image Processing
Volume6
Issue number2
DOIs
StatePublished - Dec 1 1997

Fingerprint

Interpolation
Subjective testing
Motion compensation
Motion estimation
Adaptive algorithms
Experiments

ASJC Scopus subject areas

  • Software
  • Medicine(all)
  • Computer Graphics and Computer-Aided Design

Cite this

Deinterlacing by successive approximation. / Kovacevic, Jelena; Safranek, Robert J.; Yeh, Edmund M.

In: IEEE Transactions on Image Processing, Vol. 6, No. 2, 01.12.1997, p. 339-344.

Research output: Contribution to journalArticle

Kovacevic, Jelena ; Safranek, Robert J. ; Yeh, Edmund M. / Deinterlacing by successive approximation. In: IEEE Transactions on Image Processing. 1997 ; Vol. 6, No. 2. pp. 339-344.
@article{1e8d07767d1a4f5280181a1a32238ce1,
title = "Deinterlacing by successive approximation",
abstract = "We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since motion-compensated part uses the previously interpolated frame. Furthermore, bidirectional motion estimation and compensation allow for better performance in case of scene changes and covering/uncovering of objects. Experiments are run both on {"}real-world{"} and computer generated sequences. Finally, subjective testing is performed to evaluate the quality of the algorithm.",
author = "Jelena Kovacevic and Safranek, {Robert J.} and Yeh, {Edmund M.}",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/83.551707",
language = "English (US)",
volume = "6",
pages = "339--344",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Deinterlacing by successive approximation

AU - Kovacevic, Jelena

AU - Safranek, Robert J.

AU - Yeh, Edmund M.

PY - 1997/12/1

Y1 - 1997/12/1

N2 - We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since motion-compensated part uses the previously interpolated frame. Furthermore, bidirectional motion estimation and compensation allow for better performance in case of scene changes and covering/uncovering of objects. Experiments are run both on "real-world" and computer generated sequences. Finally, subjective testing is performed to evaluate the quality of the algorithm.

AB - We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since motion-compensated part uses the previously interpolated frame. Furthermore, bidirectional motion estimation and compensation allow for better performance in case of scene changes and covering/uncovering of objects. Experiments are run both on "real-world" and computer generated sequences. Finally, subjective testing is performed to evaluate the quality of the algorithm.

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

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

U2 - 10.1109/83.551707

DO - 10.1109/83.551707

M3 - Article

C2 - 18282929

AN - SCOPUS:0031075364

VL - 6

SP - 339

EP - 344

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 2

ER -