Deinterlacing by successive approximation
Related Experiment Video
Updated: Jul 7, 2026

Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
Published on: February 12, 2014
J Kovacevic1, R J Safranek, E M Yeh
1Lucent Technol., AT&T Bell Labs., Murray Hill, NJ.
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.
Related Concept Videos
Reconstruction of Signal using Interpolation
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Upsampling
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Sampling Continuous Time Signal
In the...