Deinterlacing by successive approximation

Jelena Kovačević, 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 - 1997

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Deinterlacing by successive approximation'. Together they form a unique fingerprint.

  • Cite this