De-interlacing of video images using a shortest path technique

This paper presents a fast algorithm for de-interlacing of video images using a shortest path technique. The algorithm applies dynamic programming techniques to find a shortest path in a cost matrix. The motion information obtained from this shortest path is used to re-align the fields of a video image. By using the shortest path via dynamic programming, the motion information estimated is more reliable than simply performing a search in a local neighbourhood. A variety of real images have been tested, and good results have been obtained.

[1]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[2]  Yrjö Neuvo,et al.  Motion adaptive scan rate up-conversion , 1992, Multidimens. Syst. Signal Process..

[3]  Kenji Sugiyama,et al.  A method of de-interlacing with motion compensated interpolation , 1999, 1999 Digest of Technical Papers. International Conference on Consumer Electronics (Cat. No.99CH36277).

[4]  Theodore S. Rzeszewski.  Method for improving low-resolution video on higher-resolution displays , 1999, IEEE Trans. Consumer Electron..

[5]  Soon-kak Kwon,et al.  A motion-adaptive de-interlacing method , 1992 .

[6]  Georgy L. Gimel'farb,et al.  Experiments with symmetrized intensity‐based dynamic programming algorithms for reconstructing digital terrain model , 1992, Int. J. Imaging Syst. Technol..

[7]  Gerard de Haan,et al.  IC for motion compensated de-interlacing, noise reduction, and picture rate conversion , 1999, 1999 Digest of Technical Papers. International Conference on Consumer Electronics (Cat. No.99CH36277).

[8]  Dongil Han,et al.  A motion adaptive 3-D de-interlacing algorithm based on the brightness profile pattern difference , 1999, IEEE Trans. Consumer Electron..

[9]  G. de Haan,et al.  De-interlacing of video data using motion vectors and edge information , 2002, 2002 Digest of Technical Papers. International Conference on Consumer Electronics (IEEE Cat. No.02CH37300).

[10]  Michael Buckley,et al.  Regularised shortest-path extraction , 1997, Pattern Recognit. Lett..

[11]  S. A. Lloyd.  A dynamic programming algorithm for binocular stereo vision , 1985 .

[12]  Hans-Hellmut Nagel,et al.  Estimation of Optical Flow Based on Higher-Order Spatiotemporal Derivatives in Interlaced and Non-Interlaced Image Sequences , 1995, Artif. Intell..