yadif去隔行算法分析.docxVIP

Yadif算法分析Yadif去隔行算法来自Mplayer，它是一个速度和效果折中的方案。http://trac.handbrake.fr/wiki/yadif.ru/yadif/yadif.html/showthread.php?t=124284Understanding YadifYadif goes through every plane of every frame. It assumes everything is interlaced. Because of this assumption, yadif starts out by focusing on only half the lines and rewriting the alternate half of the lines to match them.For clarity, this guide deals with top field first content.If yadifs going top field first, it will keep the first line in every frame, and then go through the second line pixel by pixel to make it match the first, keep the third line, go through the 4th pixel by pixel, etc. As it goes through, it discards the intensity of each pixel of each of those even lines, and makes a bunch of guesses about what it should be.?Diagram 1: Three interlaced framesInterpolationThe guessing process starts with a crude approximation of what the frame would look like if the odd field was a full-height progressive frame. It knows that the lines directly above and below the current pixel on an even line are good (from the first field) and that the ones 2 up and 2 down are bad (from the second field) and should be mostly ignored.Yadif also realizes that, since interlacing alternates, the order is opposite in the frames before and after. After all, the previous moment in time is the even field in the previous frame, and the next moment in time is the odd field in the current frame. In those, the pixels 2 up and 2 down are good and the ones directly above and below are bad. So for the pixel 2 above in the current frame and the pixel 2 below, it uses the average of that pixel in the fields before and after. Meanwhile, it preserves the pixels directly above and below. The current pixel is treated like the ones 2 above and below -- its ignored and replaced with the average of the pixel in the fields before and after.This process gives yadif an approximation of what the frame should look like if it were progressive and took place at t