Title :
De-interlacing of video images using a shortest path technique
Author_Institution :
Div. of Math. & Inf. Sci., CSIRO, North Ryde, NSW, Australia
fDate :
5/1/2001 12:00:00 AM
Abstract :
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
Keywords :
dynamic programming; image sequences; motion estimation; video signal processing; cost matrix; de-interlacing; dynamic programming; fast algorithm; motion estimation; motion information; shortest path technique; video images; Australia; Costs; Dynamic programming; Heuristic algorithms; Image converters; Motion detection; Motion estimation; Optical filters; Sun; Testing;
Journal_Title :
Consumer Electronics, IEEE Transactions on
