US 7,405,767 B2Granted

Video image conversion method for interlaced image to progressive image and system thereof

AssigneeHimax Technologies Limited

InventorChien-Hsin Li

Life of this patent

Estimating the term…

Loading patent…

Abstract

A video image conversion method is for converting interlaced image into progressive image. The deinterlacing method for the video system is for converting the interlaced image into the progressive image. The method performs an interpolation algorithm based on the pixel value of a reference field. An inter-field estimation on the pixel values is performed by referring to a predetermined value to calculate difference value between specific vicinity pixel value and predetermined value, to obtain a set of pixel values, corresponding to the minimum value of summation of a set of pixel difference values. The pixel value corresponding to the auxiliary field is interpolated. The reference field and the auxiliary filed are also referred as the odd field and the even field, where neither the interlacing order nor the respective correspondence is constrained. The method further detects a still motion, such that the flickering is effectively eliminated in another interpolation mode.

Claims7

Dependent claims

A video image conversion method for processing an interlaced field, wherein the interlaced field has a plurality of scanning lines, each of the scanning lines comprises a plurality of pixels represented as P(x,n), and the plurality of corresponding pixels is represented as Q(x,n), where x represents the xth scanning line, n represents the nth pixel on each of the scanning lines, and the video image conversion method comprises:

defining a target pixel, and the target pixel being located between the pixels P(x,n) and P(x+1,n) on two neighboring scanning lines;
obtaining a reference value R(x,n), wherein the reference value R(x,n) is an arithmetic mean of Q(x,n) and Q(x+1,n), where Q(x,n) and Q(x+1,n) are the pixel values of the pixel P(x,n) and the pixel P(x+1,n), respectively;
composing the pixel P(x,n−i) and the pixel P(x+1,n+i) of two neighboring scanning lines as a pair by using the target pixel as a center, and calculating a comparison value of each pair (abs[Q(x,n−i)−R(x,n)]+abs[Q(x+1,n+i)−R(x,n)]), where abs[i]=0, 1, 2, . . . , and abs[ ] represents obtaining an absolute value;
comparing each of the comparison values, and obtaining a pair of pixels P(x,n−j) and P(x+1,n+j) having a minimum value, where abs[j]=0, 1, 2, . . . ;
and
calculating an arithmetic mean of Q(x,n−j) and Q(x+1,n+j).

3 more elements

Dependencies are inferred from the claim text.