METHOD OF DE-INTERLACING VIDEO SIGNALS USING A MIXED MODE SPATIAL AND TEMPORAL APPROXIMATION TECHNIQUE

Abstract: A method of de-interlacing interlaced video formats using a mixed mode spatial and temporal approximation technique. The method can be implemented with input of known pixel values obtained from only two fields, featuring the current spatial field containing missing pixels, and either of two neighbor temporal fields containing known pixels. Decision steps requiring evaluation of a series of logical operations lead to assignment of values to missing spatial pixels. There is a feedback step of approximated values of missing pixels from one cycle to the next cycle of approximation of missing pixel values. The method is applicable to a variety of video interlaced signals, including interlaced RGB component signals, and video signals containing luminance and chrominance components. Video de-interlacing according to the present invention is an efficient way of having image processing devices operating with interlaced technology be compatible with visual display monitors operating with de-interlaced (progressive) high resolution scan format systems. Moreover, the de-interlacing method is applicable to real time and off-line modes of operation of video and television systems currently using interlaced scanning formats.

Description: APPLICATION FOR PATENT Title: METHOD OF DE-INTERLACING VIDEO SIGNALS USING A MIXED MODE SPATIAL AND TEMPORAL APPROXIMATION TECHNIQUE FIELD AND BACKGROUND OF THE INVENTION The present invention relates to processing of video signals. In particular, this invention relates to a method of de-interlacing interlaced video formats using a mixed mode spatial and temporal approximation technique. Video signals are currently represented as sequences of either (a) fields in case of interlace scan refresh, or, (b) frames according to non-interlace or progressive scan refresh. In the interlaced scan format, a single image (frame) is represented using a pair of fields. One field of the pair features pixels located in alternate rows (odd numbered horizontal lines, for example) of the field matrix. The second field of the pair features pixels located in the same field matrix only in the corresponding horizontal lines (even numbered horizontal lines, for example) which were missing pixels in the first field, such that portions of the image not represented in the first field are represented in the second field. In the interlaced scan format, each field of image data is scanned twice, once for the odd numbered horizontal lines of the field, and another time for the even numbered horizontal lines of the field, in order to have all of the horizontal lines of the odd field followed by all of the horizontal lines of the even field. The pair of fields of odd and even horizontal lines in interlaced video constitute the frame (one full resolution picture or image). In contrast, in the de-interlaced or progressive scan format, an image is represented in its entirety using only a single field which includes pixels in all horizontal lines of the field matrix. Here, each frame or field of image data is scanned once from the top horizontal line to the bottom horizontal line without requiring interlacing action between two fields. In the interlace scan format, the first and second fields of a pair are scanned consecutively on a video display monitor at a rate of 60 fields per second, in order to reconstruct single image frames on the display at the industry interlaced scan standard of 30 frames per second. In more recently developed video representation techniques using de-interlacing (progressive scan format) format, frames are progressively scanned on a display at the standard progressive display rate of 60 frames per second. Application of current interlace scan format to television, is according to the NTSC (National Television System Committee) and the PAL (Phase Alternation by Line) systems, for example. In the NTSC format, there are 262.5 horizontal scanning lines per field (including one odd numbered field, and one even numbered field), translating to 525 scanning lines per frame, with an established scan rate of (60 fields) 30 frames per second. In the PAL format, there are 312.5 horizontal scanning lines per field (including one odd numbered field, and one even numbered field), translating to 625 scanning lines per frame, with an established scan rate of (50 fields) 25 frames per second. New display systems such as CRT (PC monitors), flat liquid crystal device (LCD) panels, plasma display panels (PDP), and video equipment, including cameras, broadcast station transmitters and high definition television (HDTV) desktop or workstation display monitors are using de-interlaced (progressive) high resolution scan format systems such as VGA(480 lines x 640 columns per frame), SVGA(600 lines x 800 columns per frame), XGA(768 lines x 1024 columns per frame), and UXGA(1200 lines x 1600 columns per frame) to scan and display image data. An example showing the need for de-interlacing interlaced video data, is a typical LCD display having 480 horizontal scanning lines with 640 dots per scanning line (VGA system). Since LCD display systems are designed to be scanned in the de-interlaced format, when the need is to display NTSC (525 lines per frame) and PAL (625 lines per frame) image signals on an LCD display, interlaced image signals need to be converted into de-interlaced image signals for proper display. It is known that higher quality image reproductions are obtained by using de-interlaced scanned format rather than interlaced scan format, because interlaced displays are more likely to exhibit visual artifacts (such as line crawl on diagonal edges of an image, and interline flicker on horizontal edges of an image) than de-interlaced scan displays. As a result, there has been substantial effort towards developing methods of converting or de-interlacing interlaced video image data suitable for display on de-interlaced or progressive scan format devices. Several conversion or de-interlacing methods, devices, and systems for video image processing have been developed, most of which feature one or a more of a variety of spatial, temporal, or spatio-temporal interpolation processing for estimating the values of missing pixels in an interlaced frame. The relative suitability of these techniques depends on the resulting image quality. Moreover, different interpolation techniques and systems work better under different conditions. U.S. Pat. No. 5,661,525 issued to Kovacevic et al., features a method for de-interlacing an interlaced video frame sequence using interpolation of spatial and temporal pixels for estimating values of missing pixels. The interpolations are weighted according to the errors each one introduces for generating the approximations of missing pixel values for a de-interlaced frame. In these interpolations, three fields of pixels are used, for example, the current spatial field and the two neighboring (immediately preceding and following) fields of pixels are used for estimating values of missing pixels in the current spatial field. In U.S. Pat. No. 5,793,435 issued to Ward et al., a de-interlacing system for converting an interlaced video to a progressive video features a variable coefficient, non-separable spatio-temporal interpolation filter. Reference and offset video signals are weighted together with filter coefficients in the spatio-temporal interpolation filter,' to produce an inteφolated video signal. The inteφolated video signal is interleaved with the reference video signal, suitably delayed to compensate for filter processing time, to produce the de-interlaced video signal. U.S. Pat. No. 5,621 ,470 issued to Sid- Ahmed makes use of inteφolation in an inter-pixel and inter- frame arrangement and incoφorates a 3D (low pass) filter to support such actions. The 3D inteφolator produces twice the number of pixels along each horizontal line, twice the number of lines in each frame and double the number of frames per second. Another inteφolation filter apparatus applied to de-interlacing is disclosed in U.S. Pat. No. 5,559,905 issued to Greggain et al, in which inteφolation of a stream of input pixels involves a filter providing a means for aligning the stream of input pixels and the first derived stream of sampled (output) pixels at the boundaries of the image, at a predetermined inteφolation rate. U.S. Pat. No. 5,650,824 issued to Si Jun Huang, includes the use of a filter which performs linear inteφolation on interlaced image data, involving two neighboring field samples for each odd field and even field input. An example of a device for implementing an inteφolation method of de-interlacing video signals is disclosed in U.S. Pat. No. 5,717,466 issued to Shao Wei Pan et al., featuring an enhanced video circuit for performing (linear and non-linear) non-uniform inteφolation of video scan lines. A real-time video system which incoφorates the circuit device featured in U.S. Pat. No. 5,717,466, is described in U.S. Pat. No. 5,742,350, issued to the same. Current methods of de-interlacing interlaced video signals are notably limited with respect to de-interlacing video images featuring textual data. Standard approximation methods currently used for de-interlacing interlaced video signals are typically based on inteφolation techniques, for evaluating missing pixels in interlaced fields of video signals. These inteφolation techniques require the use of no less than three fields of pixels with known values for estimating values of missing pixels. A more accurate and comprehensive approximation method for de-interlacing interlaced video signals involves usage of logical operations, for making decisions leading to assignment of highly accurate values of missing pixels, included in a technique which involves extrapolation, and not only inteφolation, of missing pixels in interlaced fields of video signals. Moreover, a de-interlacing method which requires less than three fields of pixels with known values for approximating values of missing pixels would translate to a significant savings of resources required for de-interlacing. A method requiring input information from two, instead of three, fields of pixels with known values would require measurably less data processing resources including hardware, software, memory, and calculation time. There is thus a need for, and it would be highly advantageous to have, an accurate and comprehensive method of de-interlacing interlaced video signals currently used in standard video and television devices, which is generally applicable to both numerical and textual image data, and which requires fewer resources. Moreover, there is a need for such a method of de-interlacing applicable to either real time or off-line mode of operation of video and television signal de-interlacing. SUMMARY OF THE INVENTION The present invention relates to a method of de-interlacing interlaced video signals using a mixed mode spatial and temporal approximation technique. Hereinafter, the term 'current' is used with respect to a given set time of de-interlacing an interlaced video signal, and is used as a temporal reference point in describing the approximation method of the present invention, whether the interlaced video signal be in real time or off-line mode of operation. Hereinafter, the term 'logical operations' refers to usage of the known logical operators of 'less than', 'less than or equal to', 'greater than', 'greater than or equal to', 'and', 'or', and 'xor'. Spatial pixels of a current spatial field of pixels, and pixels of the previous and/or the following temporal fields, are used as input data of the approximation method. The method of video de-interlacing of the present invention features a unique mixed mode spatial and temporal approximation technique, involving approximating missing pixels of interlaced (half) fields required to form a single de-interlaced frame (raster) of pixels positioned in grid space of a visual display device. The method of the present invention provides the unique capability of implementation using input information from only two fields, instead of using the conventional three fields of pixels with known values, for approximating values of missing pixels in a current spatial field. For example, in addition to the current spatial field featuring known and missing values of spatial pixels, only one neighboring temporal field having temporal pixels with known values need be used for performing all necessary calculations, determinations, and evaluations for completely de-interlacing an interlaced video signal. The method of the present invention involves unique usage of logical operations, for making decisions leading to assignment of highly accurate values of missing pixels. Additionally, the method' of the present invention includes a feedback step for continuation of the approximation method of evaluating a value of a next missing pixel, following evaluation of a previous missing pixel. A preferred embodiment of a method of video de-interlacing of the present invention features the following principle steps: (1) initialization of the value of the first output pixel, and definition of threshold constants and pixel luminance levels (where luminance refers to brightness or darkness), to be used in a later decision step in evaluating missing pixels, (2) identification of a line of missing pixels within a spatial field at a set time, (3) identification of a current line of pixels with known values within the previous temporal field or the next temporal field, or within both the previous temporal field and the next temporal field, (4) identification of a missing spatial pixel in the line of missing spatial pixels, (5) determination of directional averages of the spatial neighbors of the missing spatial pixel, in the current spatial field, at the set time, (6) determination of averages of temporal pixels located in the same line and column of the missing spatial pixel, but in previous and/or next temporal fields, (7) determination of standard deviations of the spatial pixels with known values, located in the same field as the missing spatial pixel, (8) determination of the minimum standard deviation of the spatial pixels, (9) determination of the standard deviation between the average of the neighboring temporal pixels, and the average of -the current spatial pixels related to the minimum standard deviation of step (8), (10) deciding from several potential values to the missing spatial pixel, based on evaluation of a series of logical operations of previously determined values, leading to assignment of a value to the missing spatial pixel, (1 1) saving the value of step (10), for use in performing the following feedback step for approximating a value of a next missing spatial pixel, and (12) approximation of a value of a next missing spatial pixel by feedback, by repeating steps (1) through (11). There are several ways to represent color video. Currently, video broadcasts are based on formats such as YUV, and YCrCb, where Y is known as the luminance (brightness or darkness) component and UV or CrCb are different chrominance (color) components. The above outlined method is generally applicable to any type of interlaced video signal format, including interlaced color video formats. The method of the present invention, may be similarly implemented for the case of video interlaced RGB signals, whereby the above method (steps (1) through (11)) is repeated for each color component (red, green, and blue). The method of the present invention, may be similarly implemented for the case of video interlaced signals represented by luminance and chrominance components (for example, YUV, YCrCb), whereby the above method (steps (1) through (11)) is repeated only for the luminance components (the Y part), and an approximation is performed for the chrominance components (the CrCb part), from information obtained from the decision step (10). According to the present invention, there is provided a method for de-interlacing an interlaced video format, the method comprising the steps of: (a) receiving the interlaced video format featuring a sequence of fields of pixels to be de-interlaced, and (b) using a current spatial field featuring missing spatial pixels and the spatial pixels with known values, located in the sequence of the fields, and at least one temporal field featuring temporal pixels with known values, located in the sequence of the fields, for determining values of the missing pixels of the current spatial field. According to the present invention, there is provided a method for de-interlacing an interlaced video format, the method comprising the steps of: (a) receiving the interlaced video format featuring a sequence of fields of pixels to be de-interlaced, (b) evaluating logical operations of linear combinations of values selected from the group consisting of averages of known values of spatial pixels, averages of the known values of temporal pixels, standard deviations of the known values of the spatial pixels, standard deviations of the known values of the temporal pixels, minimums of the standard deviations of the known values of the spatial pixels, absolute values of differences between the averages of the known values of the temporal pixels and the known values of the spatial pixels, the known values of the spatial pixels, and a plurality of constants, the logical operations selected from the group consisting of greater than, greater than or equal to, less than, less than or equal to, 'and', 'or', and 'xor', and (c) deciding upon assignment of values to missing spatial pixels according to results of the logical operations. The method of video de-interlacing of the present invention, leads to the capability of using image processing devices operating with interlaced technology to be compatible with visual display monitors operating with de-interlaced (progressive) high resolution scan format systems. Moreover, the method of video de-interlacing of the present invention is applicable to either real time or off-line mode of operation of video and television signal de-interlacing. The present invention could be implemented by hardware or by software on any operating system of any firmware or a combination thereof. For example, as hardware, the invention could be implemented as a chip or a circuit. As software, the invention could be implemented as a plurality of software instructions being executed by a computer using any suitable operating system. In any case, the steps of the method of the invention could be described as being performed by a data processor, such as a computing platform for executing a plurality of instructions, regardless of the implementation of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS The invention is herein described, by way of example only, with reference to the accompanying drawings, wherein: FIG. 1A is an illustration of an odd field (one half of odd lines of a single frame) of an interlaced scan format; FIG. IB is an illustration of an even field (one half of even lines of a single frame) of an interlaced scanned format; FIG. 2 is an illustration of a single frame (two fields at the same time) of a de-interlaced scanned format; FIG. 3 shows an example of a matrix representation of pixel grid space for a given spatial field and immediate neighboring temporal fields of an interlaced video signal; FIG. 4 is a flow diagram of a preferred embodiment of the method for de-interlacing a sequence of interlaced fields according to the present invention; and FIG. 5 (comprising two pages as FIG. 5/1 , and FIG. 5/2 as continuation of FIG. 5/1) is a flow diagram of an exemplary preferred embodiment for implementing the method of the video de-interlacing method according to the present invention. DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention is of a method of de-interlacing interlaced video signals using a mixed mode spatial and temporal approximation method. The approximation method includes a decision step, featuring evaluation of a series of logical operations leading to a decision of assignment of a value to a missing pixel in an interlaced field of a video signal, and assignment of a value to that missing pixel based on the correct comparison. The approximation method includes feedback of the approximated value of a previous missing pixel, to the initial step of the approximation method, for approximation of a next missing pixel. The components and operation of a method of de-interlacing video signals according to the present invention are better understood with reference to the drawings and the accompanying description. It is to be noted that illustrations of the present invention shown here are for illustrative puφoses only and are not meant to be limiting. Referring now to the drawings, FIGS. 1A and IB illustrate a pair 10 of an odd field 12 and of an even field 14 of an interlaced scanned format. FIG. 1A is an illustration of odd field 12, featuring one half of odd lines of a single frame of an interlaced scan format, such that each frame includes one odd field and one even field. In terms of an electronic device providing visual display of video signals, odd field 12 of pair 10 features lines of pixels 20, located in alternate rows 16 (odd numbered horizontal lines, for example) of grid space, also corresponding to a field matrix representation (FIG. 3). FIG. IB is an illustration of even field 14, featuring one half of even lines of a single frame of an interlaced scan format. Even field 14 of pair 10 features lines of pixels 22 located in the same grid space as lines of pixels 20 in odd field 12, but only in correspondingly alternate rows 18 (even numbered horizontal lines, for example) which were missing pixels in odd field 12, such that portions of the image not represented in odd field 12 are now represented in even field 14. Each field of pair 10 includes pixels representative of one-half of a complete single image which was recorded, such that sequential scanning of both fields of pixels 12 and 14 is required for reconstructing the image. FIG. 2 shows an illustration of a single frame 24 (two fields at the same time) of a de-interlaced scanned format. Frame 24 includes horizontal lines of pixels 26 in both odd and even horizontal rows 28, such that scanning the single frame captures the entire image in contrast to the need for sequential scanning of both odd field 12 and even field 14 of interlaced scanned format 10 of FIGS. 1A and IB. FIG. 3 shows an example of a matrix representation 30 of pixel grid space for a given spatial field and immediate neighboring temporal fields of an interlaced video signal. Matrix representation 30 is referred to in the corresponding preferred embodiment of a mixed mode spatial and temporal approximation method of the present invention (FIGS. 4 and 5), where a missing pixel (P 46 in FIG. 3), included in a sequence of interlaced fields of a video signal, is determined as part of the method of converting interlaced scanned format video signals to de-interlaced scanned format video signals. In FIG. 3, matrix representation 30, a sequence of temporally related luminance fields is featured as Field (Y t ) 32, Field (Y t . ,) 34, and Field (Y t + ,) 36. At a given set time of receiving an interlaced video signal, Field (Y t ) 32 represents a current spatial field, Field (Y t _ ,) 34 represents the previous temporal field, and Field (Y t + ,) 36 represents the next temporal field. Current spatial field, Field (Y t ) 32 includes spatial pixels x,, x 2 , and x 3 in Line (k - 1) 38, and spatial pixels x 4 , x 5 , and x 6 in Line (k + 1) 40. Horizontal line 42 is missing spatial pixels in Line (k) 44. The temporal fields, Field (Y t . j) 34, and Field (Y t + ,) 36 include temporal pixels g ] 5 g 2 , and g 3 in Line (k) 44, and temporal pixels h,, h 2 , and h 3 in Line (k) 44, respectively. Spatial pixel P 46, represents a missing spatial pixel located in Line (k) 44, of the current spatial field, Field (Y t ) 32. Spatial pixel P 46 is to be approximated from spatial information located in the current spatial field, Field (Y t ) 32, and from temporal information located in either one or both temporal fields, Field (Y t . ,) 34, and Field (Y t + ,) 36, using a mixed mode spatial and temporal approximation method of the present invention. In FIG. 4, each principle step of the method of the video de-interlacing method of the present invention is numbered and enclosed inside a box. FIG. 5, (comprising FIG. 5/1, and FIG. 5/2 as continuation of FIG. 5/1), shows a preferred illustrative embodiment for implementing the method shown in FIG. 4, also as a flow diagram. Referring to FIG. 4, a preferred embodiment of a method of video de-interlacing of the present invention is as follows. In Step 1, initialization is performed, in which the value of the first output pixel, evaluated by using the de-interlacing approximation method, is initialized. Additionally, threshold constants and pixel luminance (brightness and darkness) levels, to be used later in the decision step (Step 10) of assigning a value to a missing pixel, are defined. In Step 2, there is identification of a horizontal line of missing spatial pixels within a current spatial field, at a given set time. In Step 3, there is identification of the current horizontal line of temporal pixels with known values, located within the previous temporal field or the next temporal field, or alternatively, located within both the previous temporal field and next temporal field, corresponding to the same horizontal line of missing spatial pixels within the current spatial field determined in Step 2, at the given set time. In Step 4, identification is made of a missing spatial pixel whose value is to be approximated, in the line of missing spatial pixels. In Step 5, determination is made of directional averages of the known spatial pixel neighbors of the missing spatial pixel, in the current spatial field of the horizontal line of missing spatial pixels, at the given set time. In Step 6, determination is made of averages of known temporal pixels, located in the previous temporal field or in the next temporal field, or alternatively, located in both the previous temporal field and in the next temporal field, in the same horizontal line and the same column of the missing spatial pixel. In Step 7, determination is made of standard deviations of known spatial pixels located in the current spatial field of the missing spatial pixel. In Step 8, determination is made of the minimum standard deviation of the standard deviations determined in Step 7. In Step 9, there is determination of the standard deviation between the average of neighbor temporal pixels evaluated in Step 6, and the average of current spatial pixels related to the minimum standard deviation evaluated in Step 8. Step 10 is a decision step, deciding from several potential values to the missing spatial pixel, based on evaluation of a series of logical operations of previously determined values. The decision step concludes with assignment of a value to the missing spatial pixel. In Step 11, the approximated value of the missing pixel determined in Step 10, is saved for initialization of, and in performing the following feedback step, Step 12, for approximating a value of a next missing spatial pixel, in the next cycle of the approximation method. Completion of Step 11, represents completion of a single cycle of approximating values of missing pixels in grid space, using a mixed mode spatial and temporal approximation technique of the present invention, of an interlaced format video signal, prior to transmission of a de-interlaced video signal to an electronic visual display device. Step 12 continues the approximation method by approximation of a value of a next missing spatial pixel by feedback, by repeating Steps 1 through 11. FIG. 5, (comprising two pages as FIG. 5/1 , and FIG. 5/2 as continuation of FIG. 5/1), shows a flow diagram of an exemplary preferred embodiment for implementing the video de-interlacing method shown in FIG. 4. The preferred embodiment of FIG. 5 is an example of implementing the video de-interlacing method of the present invention for approximating the value of missing pixel P 46, shown in FIG. 3, included in a field of a sequence of an interlaced video signal. Principle step numbers and titles of FIG. 5/1 and of FIG. 5/2 correspond to those appearing in FIG. 4. Notation and symbols appearing in FIG. 5/1 and in FIG. 5/2 are consistent with those appearing in FIG. 3. For each principle method step, definitions of selected terms or components of that step, or of a substep to that step, are included, in addition to one or more substeps representing further of the indicated principle method step of the video de-interlacing method. In the following description of preferred embodiment featured in FIG. 5/1 and FIG. 5/2, definitions are indicated by a hyphen, substeps are indicated by a letter in parentheses, and the multiplication operation is indicated by an asterisk (*). Referring to FIG. 5/1, Step 1 starts the mixed mode spatio-temporal approximation de- interlacing method with initialization of the first output pixel, definition of threshold constants, and definition of pixel luminance levels. Step (a) is the initialization of the value of the first output pixel, of the approximation method of an interlaced sequence of a video signal of the present invention, such as that shown in FIG. 3 for example, whereby the output value of a previous pixel (Previous-Result) is set equal to zero, (Previous-Result) = 0. Additionally in Step 1, threshold constants, A„ for i = 1 to 8, and pixel luminance levels, including B - a darkness level (black level), and W = a brightness level (white level), are each defined. Threshold constants and luminance levels are used later for completing a decision step, involving evaluation of a series of logical operations leading to assignment of a value to a missing pixel. In Step 2 identification is made of a horizontal line of missing pixels within a current spatial field, at a given set time. Step (a) involves setting-up a matrix representation of pixels of a sequence of an interlaced video signal, featuring spatial and temporal pixels within spatial and temporal interlaced fields, at a given set (current) time. These interlaced fields are to be de-interlaced by the present approximation method. The example used in this embodiment of the present invention relates to that appearing in FIG. 3. There it is shown that missing spatial pixels are located in horizontal line 42, in Line (k) 44. In Step 3, there is identification of the current horizontal line of pixels with known values, located in the previous temporal field (Field (Y t . ,) 34, FIG. 3), or in the next temporal field (Field (Y t + ,) 36, FIG. 3), or located in both the previous temporal field (Field (Y t . ,) 34, FIG. 3) and in the next temporal field (Field (Y t + ,) 36, FIG. 3), corresponding to the same location as the horizontal line of missing spatial pixels within the current spatial field determined in Step 2 (FIG. 5/1 ) at the given set time. Successful implementation of the method of the present invention, requires input values of known pixels from at least one temporal field neighbor of the current spatial field featuring missing pixels. In step (a), reference is made to FIG. 3, where temporal pixels, with values located in Line (k) 44, in the previous temporal Field (Y t - 1 ) 34, have values g ] 5 g 2 , g 3 , and temporal pixels with values, located in Line (k) 44, in the next temporal Field (Y t + 1 ) 36, have values h,, h 2 , h 3 . Temporal pixels with known values, located in at least one of the neighboring previous temporal field, or next temporal field, are used as inputs in the approximation method of the present invention. In Step 4, identification is made of a missing pixel in the line of missing pixels, whose value is to be approximated by the method of the present invention. In step (a), reference is made to FIG. 3, where a missing spatial pixel P 46 located in Line (k) 44 of missing pixels, in spatial Field (Y t ) 32 is selected, as part of an example of implementation of the approximation method. In Step 5, determination is made of directional averages of the known spatial pixel neighbors of the missing spatial pixel (P 46 in FIG. 3), located in the current field of the horizontal line of missing spatial pixels, at the given set time. In step (a), neighbor pixel values are obtained from the matrix representation of pixels in grid space (FIG. 3). Neighbor spatial pixels with values, located in Line (k - 1) 38, and in Line (k + 1) 40, in the current spatial Field (Y t ) 32 of the missing spatial pixel P 46, have values x,, x 2 , x 3 , and x 4 , x 5 , x 6 , respectively. In step (b), the directional averages, m, , are evaluated, where m, = a,x, + a 2 x 6 , m 2 = b,x 2 + b 2 x 5 , and m 3 = c,x 3 + c 2 x 4 , with a, + a 2 = 1, bi + b 2 = 1 , and Ci + c 2 = 1, where coefficients a„ b„ and c, are positive constants. In Step 6, determination is made of averages of values of known temporal pixels, located in the previous temporal field and in the next temporal field, in the same horizontal line and the same column of the missing spatial pixel (P 46 in FIG. 3). In step (a), previous and next field pixel values are obtained from the matrix representation of pixels in grid space (FIG. 3). Temporal pixels with values, located in Line (k ) 44, in the previous temporal Field (Y t . ,) 34, have values g,, g 2 , and g 3 and temporal pixels with values, located in Line (k) 44, in the next temporal Field (Y t + ,) 36 have values h h 2 , and h 3 . In step (b), temporal pixel average, m τ , is evaluated, where m τ = d,g 2 + d 2 h 2 , with d, + d 2 = 1, and where coefficients d, and d 2 are positive constants, greater than or equal to zero. In step (c), temporal pixel average, n τ , is evaluated, where n τ = e,g ] + e 2 h,, with e, + e 2 = 1, and where coefficients βj and e 2 are positive constants, greater than or equal to zero. According to the values of the coefficients, d,, d 2 , e,, and e 2 , the approximation method of the present invention requires input values from three fields of pixels (one current spatial field and two neighboring temporal fields), or input values from two fields of pixels (one current spatial field and one neighboring temporal field), for approximating missing pixels in the current spatial field. In the case of d, = 0 and e, = 0, m τ = d 2 h 2 , and n τ = e 2 h,, temporal pixel values (h, and h 2 ) from only one temporal field, the next temporal field (Field (Y t + { ) 36, FIG. 3), are needed for evaluation of m τ and n τ , and ultimately evaluation of missing pixel P 46 (FIG. 3). Similarly, in the case of d 2 = 0 and e, = 0, m τ = d,_g 2 , and n τ = βjgj, temporal pixel values (g, and g 2 ) from only one temporal field, the previous temporal field (Field (Y, . λ ) 34, FIG. 3) are needed for evaluation of m τ and n τ , and ultimately evaluation of missing pixel P 46 (FIG. 3). In other cases, in which neither d] = 0 and βj = 0, or d 2 = 0 and e 2 = 0, occurs, then there is a known value of at least one temporal pixel from each of both neighboring temporal fields (Field (Y t + ,) 36 and Field (Y t . ,) 34, FIG. 3), to the current spatial field (Field (Y t ) 32, FIG. 3) featuring the missing spatial pixel (P 46, FIG. 3) to be approximated, in the equations for evaluating m τ and n τ , which are used in a later decision step (Step 10, FIG. 5/2) leading to evaluation of the missing spatial pixel (P 46, FIG. 3). Continuation of the exemplary preferred embodiment of FIG. 5, appears in FIG. 5/2, where in Step 7, determination is made of standard deviations of spatial pixels with known values, located in the current spatial field of the missing spatial pixel (P 46 in FIG. 3). In step (a), standard deviations, Sigma i, are evaluated for i = 1 to 3, where Sigma 1 = s x [abs (x, - m ] , Sigma 2 = s 2 [abs (x 2 - m 2 )] , and Sigma 3 = s 3 [abs (x 3 - m 3 )], where s, (for i = 1 to 3) is a positive constant, and the term 'abs' appearing in the equations of Sigma i = s, [abs (x, - m,)], represents the absolute value of the term appearing in the parentheses, i.e., the absolute value of (x, - m,). The equation used for evaluating the standard deviation of Sigma i, i.e., Sigma i = s, [abs (x, - m,)], is a known close approximation to the actual equation used for evaluating a standard deviation. In Step 8, the minimum standard deviation of the standard deviations evaluated in Step 7 (FIG. 5/2) is determined. Step (a) features evaluation of the minimum standard deviation, Min-Sigma, from the set of Sigma i (i = 1 to 3), where Min-Sigma = Min [Sigma i] for 1<= i <= 3, and Min is a minimization operator. The term, m j (where j = i) is defined as the average of spatial pixel values related to the minimum standard deviation, Min-Sigma. In Step 9, there is determination of the standard deviation between the average of neighbor temporal pixels evaluated in Step 6 (FIG. 5/1), and the average of current spatial pixels related to the minimum standard deviation evaluated in Step 8 (FIG. 5/2). Step (a) features evaluation of the standard deviation, Sigma, where Sigma = [abs (m τ - m.)], and where m τ and m. correspond to the average of neighbor temporal pixels evaluated in Step 6 (FIG. 5/1), and the average of current spatial pixels related to the minimum standard deviation evaluated in Step 8 (FIG. 5/2), respectively. Step 10 is a decision step, in which a series of logical operations are evaluated leading to decision and assignment of a value to the missing spatial pixel (P 46 in FIG. 3). The decision step concludes with assignment of a value to the missing spatial pixel. In step (a), there is evaluation of a series of logical operations, listed as (i) through (x), in the preferred embodiment of the present invention shown in FIG. 5/2, featuring comparisons of: linear combinations of a standard deviation (Sigma, or Min-Sigma); or, of absolute magnitude of the difference between temporal pixel average, m τ , and a selected spatial pixel with a known value (x, , x 2 , x 3 , x 4 , x 5 or x 6 ); or, of an average (m τ ); or of the difference between a previously approximated missing pixel value (Previous-Result) and an average of temporal pixels (n τ ); to linear combinations of threshold constants (A] through A 8 ) or pixel luminance levels (B, W), previously defined in Step 1 (FIG. 5/1). The series of logical comparisons features the following, whereby, if any one of the following logical operations, (i) through (x), is correct, then the decision is to assign (Step (b)) a value to the missing spatial pixel (P 46 in FIG. 3), according to: (i) Sigma <= (K0 + Min-Sigma), where -C 0 <= K0 < C 0 , or (ii) Min-Sigma >= (W - Kl), where -C, <= KK C 1 , or (iii) abs (m τ - x,) < Al , or (iv) abs (m τ - x 2 ) < A2, or (v) abs (m τ - x 3 ) < A3, or (vi) abs (m τ - x 4 ) < A4, or (vii) abs (m τ - x 5 ) < A5, or (viii) abs (m τ - x 6 ) < A6, or (ix) m, <= (B + K2), where -C 2 <= K2 < C 2 , or (x) [(Previous-Result) - n τ <= A6] and [m τ >= W - A7], whereby the following additional logical comparison is evaluated, to assign a value to the missing spatial pixel (P 46 in FIG. 3): If Sigma < A8, the value of the missing spatial pixel (P 46 in FIG. 3) is assigned (Step (b)) as: P = (m τ + m.) * K3, where 0 < K3 < 1. However, if Sigma >= A8, the value of the missing spatial pixel (P 46 in FIG. 3) is assigned (Step (b)) as: P — m τ . If none of the logical comparisons (i) through (x) is correct, then the decision is to assign (Step (b)) the value of missing spatial pixel (P 46 in FIG. 3) as: P - n j . In Step 10, the assigned value of missing spatial pixel (P 46 in FIG. 3) is obtained, in part, from input of known values of pixels located in either one, or two neighbor temporal fields (Field (Y t + x ) 3fj and Field (Y t . ,) 34, FIG. 3), in addition to input of known values of pixels located in the current spatial field (Field (Y t ) 32, FIG. 3) featuring the missing spatial pixel (P 46, FIG. 3) to be approximated. As described in Step 6 (FIG. 5/1), and shown by the logical operations (equations) of Step 10, for the case in which the coefficients dj = 0 and e, = 0, then m τ = d 2 h 2 , and n τ = e 2 h,, or, for the case in which the coefficients d 2 = 0 and e 2 = 0, then m τ — d,g 2 , and n τ = e,g then the value of missing pixel P 46 (FIG. 3) is obtained using known values of pixels of only one neighbor temporal field, i.e., Field (Y t + 36, or Field (Y t . ,) 34, and of the current spatial field, Field (Y t ) 32 featuring the missing pixel P 46, as shown in FIG. 3. In Step 11, the approximated value of the missing pixel determined in Step 10, is saved for initialization of, and in performing the following feedback step, Step 12, for approximating a value of a next missing spatial pixel, in the next cycle of the approximation method. Completion of Step 11, represents completion of a single cycle of approximating values of missing pixels in grid space, using a mixed mode spatial and temporal approximation technique of the present invention, of an interlaced format video signal, prior to transmission of the de-interlaced video signal to an electronic visual display device. In Step 12, continues the approximation method of the present invention, by approximation of a value of a next missing spatial pixel by feedback of (Previous-Result) from Step 11, and repeating Steps 1 through 11. The method of the present invention, may be similarly implemented for the case of video interlaced RGB signals, whereby the above method (Steps 1 through 11, FIG. 5/1 and FIG. 5/2) is repeated for each color component (red, green, and blue). The method of the present invention, may be similarly implemented for the case of video interlaced signals represented by luminance and chrominance components, for example, YUV, YCrCb, whereby the above method (Steps 1 through 11, FIG. 5/1 and FIG. 5/2) is repeated only for the luminance components (the Y part), and an approximation is performed for the chrominance components (the CrCb part), from information obtained from the decision step (Step 10). While the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims.

Claims: WHAT IS CLAIMED IS: 1. A method for de-interlacing an interlaced video format, the method comprising the steps of: (a) receiving the interlaced video format featuring a sequence of fields of pixels to be de-interlaced; and (b) using a current spatial field featuring missing spatial pixels and said spatial pixels with known values, located in said sequence of said fields, and at least one temporal field featuring temporal pixels with known values, located in said sequence of said fields, for determining values of said missing pixels of said current spatial field. 2. The method of claim 1 , wherein said at least one temporal field featuring said temporal pixels with said known values is selected from the group consisting of immediate previous said temporal field to said current spatial field located in said sequence of said fields, and immediate next said temporal field to said current spatial field located in said sequence of said fields. 3. The method of claim 1, further comprising the steps of: (c) evaluating logical operations of linear combinations of values selected from the group consisting of averages of said known values of said spatial pixels, averages of said known values of said temporal pixels, standard deviations of said known values of said spatial pixels, standard deviations of said known values of said temporal pixels, minimums of said standard deviations of said known values of said spatial pixels, absolute values of differences between said averages of said known values of said temporal pixels and said known values of said spatial pixels, said known values of said spatial pixels, and a plurality of constants, said logical operations selected from the group consisting of greater than, greater than or equal to, less than, less than or equal to, 'and', 'or', and 'xor'; and (d) deciding upon assignment of said values to said missing spatial pixels according to results of said logical operations. 4. The method of claim 3, wherein said plurality of constants is selected from the group consisting of a linear combination of a plurality of values of threshold constants, and a linear combination of a plurality of values of luminance levels of said missing pixels. 5. The method of claim 4, wherein said plurality of said values of said luminance levels of said missing pixels includes a plurality of values of darkness and a plurality of values of brightness. 6. The method of claim 1 , wherein said assigned values to said missing pixels feature linear combinations of averages of said pixels with said known values. 7. The method of claim 1 , further comprising the step of: (c) feedback of said values of said missing pixels of said current spatial field for determination of next said missing pixels of said current spatial field. 8. A method for de-interlacing an interlaced video format, the method comprising the steps of: (a) receiving the interlaced video format featuring a sequence of fields of pixels to be de-interlaced; (b) evaluating logical operations of linear combinations of values selected from the group consisting of averages of known values of spatial pixels, averages of said known values of temporal pixels, standard deviations of said known values of said spatial pixels, standard deviations of said known values of said temporal pixels, minimums of said standard deviations of said known values of said spatial pixels, absolute values of differences between said averages of said known values of said temporal pixels and said known values of said spatial pixels, said known values of said spatial pixels, and a plurality of constants, said logical operations selected from the group consisting of greater than, greater than or equal to, less than, less than or equal to, 'and', 'or', and 'xor'; and (c) deciding upon assignment of values to missing spatial pixels according to results of said logical operations. 9. The method of claim 8, wherein said sequence of fields of pixels to be de-interlaced features a current spatial field featuring missing spatial pixels and said spatial pixels with known values located in said sequence of said fields, and at least one temporal field featuring said temporal pixels with said known values located in said sequence of said fields. 10. The method of claim 9, wherein said at least one temporal field featuring said temporal pixels with said known values is selected from the group consisting of immediate previous said temporal field to said current spatial field located in said sequence of said fields, and immediate next said temporal field to said current spatial field located in said sequence of said fields. 11. The method of claim 8, wherein said plurality of constants is selected from the group consisting of a linear combination of a plurality of values of threshold constants, and a linear combination of a plurality of values of luminance levels of said missing pixels. 12. The method of claim 1 1 , wherein said plurality of said values of said luminance levels of said missing pixels includes a plurality of values of darkness and a plurality of values of brightness. 13. The method of claim 8, wherein said assigned values to said missing pixels feature said linear combinations of said averages of said pixels with said known values. 14. The method of claim 8, further comprising the step of: (d) feedback of said values of said missing pixels of said current spatial field for determination of next said missing pixels of said current spatial field.

Inventors: SEGMAN YOSEF, SEGMAN, YOSEF
Applicants: FRIEDMAN MARK M, OPLUS TECHNOLOGIES LTD, SEGMAN YOSEF, FRIEDMAN, MARK, M., OPLUS TECHNOLOGIES LTD., SEGMAN, YOSEF
Application year: 1999
Main classification: H04N7
IPC codes: G09G5, H04N5, H04N7