logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Deinterlacing by successive approximation

delete1997-02-01
delete51
PRE
AI
J
Jelena Kovačević *
R
R.J. Safranek
Y
Yeh, EM
DOI：10.1109/83.551707delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
RATE UPCONVERSION
MOTION
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

No organization information available