Deinterlacing by successive approximation

Jelena Kovacevic, Robert J. Safranek, Edmund M. YehIEEE TIP 1997 · OpenReview

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 the motion-compensated part uses the previously interpolated frame. Furthermore, bidirectional motion estimation and compensation allow for better performance in the 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.
BibTeX
@article{kovacevic1997deinterlacing,
  author = {Jelena Kovacevic and Robert J. Safranek and Edmund M. Yeh},
  title = {{Deinterlacing by successive approximation}},
  journal = {IEEE Trans. Image Process.},
  year = {1997},
  url = {https://openreview.net/forum?id=0EpZ74CqI0},
}

Loading related content...

Figure