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 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.
authors.affiliation: Lucent Technol., AT&T Bell Labs., Murray Hill, NJ.
authors.forename: J
authors.initials: J
authors.lastname: Kovacevic
authors.forename: R J
authors.initials: RJ
authors.lastname: Safranek
authors.forename: E M
authors.initials: EM
authors.lastname: Yeh