Abstract:
A color interpolation processor and the color interpolation calculation method thereof are disclosed. More particularly, they relates to a color interpolation processor and the color interpolation calculation method thereof that are implemented in a real-time image process system using charge couple devices (CCD) for sampling. The color interpolation calculation method of the present invention is to perform a computation of color interpolation by utilizing the edge directions weighting and local gain approach according to the luminance density determined by the green (G) component. Therefore, the quality of interpolation is improved. Meanwhile, because the computation technique of the present invention is not complicated, the cost is lower when the color interpolation calculation method of the present invention is implemented in image signal process system. Thus, the production cost is decreased tremendously.

Description:
FIELD OF THE INVENTION  
         [0001]    The present invention relates to a color interpolation processor and the color interpolation calculation method thereof. More particularly, it relates to a color interpolation processor and the color interpolation calculation method thereof that are implemented in a real-time image process system using charge couple devices (CCD) for sampling. Therefore the efficiency of color interpolation process will be enhanced, and the cost and the process time of color interpolation will be reduced also.  
         BACKGROUND OF THE INVENTION  
         [0002]    Presently, the CCD sensor is usually used for sampling in most of digital camera system. An incident light will be transformed to an electronic signal by utilizing the CCD according to the photoelectric effect. Then, the electronic signal will be converted and digitized for an image process and recorded by an analog/digital converter. Moreover, the sampling format usually is a color filter array (CFA) format in order to reduce the size of sensor.  
           [0003]    In digital sampling system using CCD as a sampling unit, there are three departments. The first department is involved in the image process in the CCD sampling system, such as optical black alignment compensation, defect prevention, white balance and auto-white balance, and the separation and interpolation of color signal of CFA. From these image processes, a colorful image signal corresponding to every picture pixel is obtained, and then, a correction and compensation process follows, such as lens flicker compensation, hue correction, gamma correction, border correction and brightness adjustment, etc.  
           [0004]    Red (R), Green (G) and Blue (B) are three primary colors for images. When the CFA sampling format is used, only one color component of R, G, and B is taken at every sampling point. In order to make up the missing components for forming a complete color structure at every sampling point, a complicated calculation has to be performed to obtain two deficient colors by interpolation at every sampling point thereby enhancing the resolution of sampling image.  
           [0005]    The so-called interpolation is to calculate and determine the unknown pixel among several known sampling points. There are lots of traditional computation methods for interpolation existing, such as nearest neighbor interpolation, bilinear interpolation, cubic B-spline interpolation and cubic convolution interpolation, etc. However, these traditional interpolation methods have their own defects respectively. For example, the calculating speeds of the nearest neighbor interpolation and bilinear interpolation are fast but lacking of good interpolation quality. A good image quality cannot be obtained because a blurred image always exists after the interpolation is done, so that the nearest neighbor interpolation and the bilinear interpolation are not suitable for use in the high resolution, high contrast image process system.  
           [0006]    As to the cubic B-spline interpolation and the cubic convolution interpolation, they require many parameters for the interpolating calculation, so that their calculating processes are very complicated. By utilizing the cubic B-spline interpolation and the cubic convolution interpolation, a good and accurate interpolation value can be obtained but their complicated calculations take a lot of time. Therefore, the cubic B-spline interpolation and the cubic convolution interpolation are not suitable for implementing in a real-time digital color sampling system. Moreover, in the digital color sampling system with CCD and CFA sampling format, colorful stains and blurred borders always appear in the image after the interpolation is done by the traditional interpolation methods.  
           [0007]    In order to enhance the image quality after interpolation, there are many methods provided, such as the discriminated color correlation approach and the enlarged neighborhood approach. However, the computational structures of these interpolation methods are too complicated. For example, many buffers are needed to record the parameters during the computation and numerous additions are required during the interpolation computation of two deficient colors in a sampling point. Therefore, the system source will be quickly consumed. If the aforementioned interpolation methods are implemented, the cost will increase greatly. Moreover, if the aforementioned interpolation methods are implemented in the real-time image process system, due to the long computing time for interpolation, the efficiency of the image process system will be decreased.  
         SUMMARY OF THE INVENTION  
         [0008]    In the view of the background of the invention described above, in the traditional image process system with sampling by CCD and CFA format, especially for the real-time image process system, the traditional computation methods of interpolation, such as nearest neighbor interpolation, bilinear interpolation, cubic B-spline interpolation and cubic convolution interpolation, etc., fail to provide good quality and rapid calculation. Therefore, the product that utilizes the traditional computation methods of interpolation lacks of both good quality and rapid calculation of interpolation.  
           [0009]    It is the principal object of the present invention to provide a color interpolation processor and the color interpolation calculation method thereof, and more particularly, relating to the implementation in a real-time image process system using charge couple devices (CCD) for sampling. Because the computation technique of the present invention is not complicated, the cost is lower for implementing the color interpolation calculation method of the present invention in an image signal process system. Thus, the production cost will be decreased tremendously.  
           [0010]    In accordance with the aforementioned purpose of the present invention, the present invention provides a color interpolation processor and the color interpolation calculation method thereof, and more particularly relating to the implementation in a real-time image process system using charge couple devices (CCD) for sampling. Because the luminance density that is determined by the green (G) component, the edge directions weighting and local gain approach are utilized mainly to perform the computation of G interpolation, thereby enhancing the image definition after interpolation. Moreover, since the computation technique of the present invention is not complicated, the computation of interpolation is fast, so that the present invention is suitable for being implemented in the real-time image process system, and further, only two buffers are required to record the data while in application, so that the cost is decreased effectively. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0011]    The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same becomes better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:  
         [0012]    [0012]FIG. 1 is an image data array of a preferred embodiment of the present invention which is sampled by CFA.  
         [0013]    [0013]FIG. 2 is an image data array of another preferred embodiment of the present invention which is sampled by CFA.  
         [0014]    [0014]FIG. 3 is a real-time color interpolation process system of a preferred embodiment of the present invention.  
         [0015]    [0015]FIG. 4 is an internal operational flow sheet of the color interpolation processor of a preferred embodiment of the present invention according to FIG. 3.  
         [0016]    [0016]FIG. 5 is a core operational flow sheet of a preferred embodiment of the present invention according to the image data array shown in FIG. 1 and the internal operational flow sheet shown in FIG. 4.  
         [0017]    [0017]FIG. 6 is a computational flow sheet for common parameters shown in FIG. 4, wherein the image data array of FIG. 1 is utilized.  
         [0018]    [0018]FIG. 7 is a computational flow sheet for the differentials of horizontal/vertical edges according to FIG. 4, wherein the image data array of FIG. 1 is utilized.  
         [0019]    [0019]FIG. 8 is a diagram of separation performance of the horizontal and vertical differentials signal stream of a preferred embodiment of the present invention according to FIG. 7.  
         [0020]    [0020]FIG. 9 is a diagram of system clock, first clock and second clock of a preferred embodiment of the present invention according to FIG. 8.  
         [0021]    [0021]FIG. 10 is a computational flow sheet for the edge weighting of a preferred embodiment of the present invention.  
         [0022]    [0022]FIG. 11 is a diagram of system clock corresponding to the edge weighting of FIG. 10.  
         [0023]    [0023]FIG. 12 is a flow sheet of the B local mean computation according to the mean computations of FIG. 4.  
         [0024]    [0024]FIG. 13 is a computational flow sheet for the R edge mean value and the G mean value according to the mean computations of FIG. 4. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT  
       [0025]    In CFA pattern, only one color component is sampled in each cycle, so that one color component of R, G and B is taken at every sampling point. In order to reconstruct complete RGB components from CFA format, two colors components have to be computed by interpolation at every sampling point. Generally, the image resolution is mostly determined by image luminance density. Luminance density could be defined by RGB components as equation (1). 
           Y= 0.59 G+ 0.11 B+ 0.3 R   (1) 
         [0026]    From the equation (1), it is shown that G component has the maximum weighting value for determining the luminance level, so that the interpolation of G component is more important than those of R and B.  
         [0027]    Referring to FIG. 1, which shows that an image data array of a preferred embodiment of the present invention, which is sampled by CFA. The image data array of FIG. 1 is constructed from the image data of four rows and nine columns. The image data of the first row and the third row are constructed from R sampling data and G sampling data spaced in-between. The image data of the second row and the fourth row are constructed from G sampling data and B sampling data spaced in-between. First, the G 24  interpolation is considered at the B 24  position (as shown in FIG. 1, the intersection of the second row and the forth column of the image data array) for the introduction of the computation of interpolating a G component because the interpolation of G component is more important than those of R and B.  
         [0028]    To achieve high performance, the edge information is adopted to enhance the interpolated resolution. First, as the equation (2) and the equation (3) shown below, the local vertical differential and the local horizontal differential are computed. 
           ΔV   4   =|G   14   −G   34 |  (2) 
           ΔH   5   =|G   23   −G   25 |  (3) 
         [0029]    The local vertical differential is the absolute value of G 34  sampling data minus G 14  sampling data. The local horizontal differential is the absolute value of G 25  sampling data minus G 23  sampling data.  
         [0030]    Then, the G interpolation is computed by two steps. In the first step, weighting distribution is employed according to edge direction differential with the equation (2) and the equation (3). The G initial interpolation  
       (       G   ^     24     (   1   )       )                         
 
         [0031]    of B 24  is computed as shown in the equation (4).  
             {         if           Δ                 H     =       0                 and                 Δ                 V     =     0                 then                                                G     ^     24     (   1   )       =       AH   +   AV     2               else                   G   ^     24     (   1   )       =       AH   ×       Δ                 V         Δ                 H     +     Δ                 V           +     AV   ×       Δ                 H         Δ                 H     +     Δ                 V                         =       AH   ×       Δ                 V         Δ                 H     +     Δ                 V           +     AV   ×     (     1   -       Δ                 V         Δ                 H     +     Δ                 V           )                               (   4   )                               
 
         [0032]    wherein Ĝ 24   (1)  is the G initial interpolation at B 24 . AH=(G 25 +G 23 )/2 and AV=(G 14 +G 34 )/2 individually denotes the average interpolation from horizontal and vertical directions. From the equation (4), the interpolated value is based on ΔV and ΔH. As the differential of one direction is larger, the weighting value of the direction is decreased thereby preventing image blur. In the special case, when ΔV=0 and ΔH=0, the G 24  initial interpolation is the average of AH and AV .  
         [0033]    And then the local mean (LM) of B 24  is computed as shown in the equation (5)  
               LM        (     B   24     )       =         B   22     +       B   ^     23     +     B   24     +     B   26       4             (   5   )                               
 
         [0034]    wherein the {circumflex over (B)} 23  is the interpolation value of G 23 . The G final interpolation  
       (       G   ^     24     (   2   )       )                         
 
         [0035]    is computed as shown in the equation (6)  
                 G   ^     24     (   2   )       =         G   ^     24     (   1   )       ×       B   24       LM        (     B   24     )                   (   6   )                               
 
         [0036]    wherein B 24 /LM(B 24 ) is the local gain of B 24 .  
         [0037]    Then the following discussion is about the computation of R interpolation value of B 24 . First, the edge mean of R 24  is computed as shown in the equation (7).  
               LM        (     R   24     )       =         R   15     +     R   13     +     R   35     +     R   33       4             (   7   )                               
 
         [0038]    And the R Interpolation ({circumflex over (R)} 24 ) will be computed as shown in the equation (8).  
                 R   ^     24     =       LM        (     R   24     )       ×       B   24       LM        (     B   24     )                   (   8   )                               
 
         [0039]    Similarly, the G final interpolation (Ĝ 33   (2) ) of R 33  is computed as shown in the equation (9)  
                 G   ^     33     (   2   )       =         G   ^     33     (   1   )       ×       R   33       LM        (     R   33     )                   (   9   )                               
 
         [0040]    wherein the Ĝ 33   (1)  is the G initial interpolation of R 33  and R 33 /LM(R 33 ) is the local mean of R 33 . The local mean of R 33  (LM(R 33 )) is computed as shown in the equation (10)  
               LM        (     R   33     )       =         R   31     +       R   ^     32     +     R   33     +     R   35       4             (   10   )                               
 
         [0041]    wherein {circumflex over (R)} 32  is the interpolation of G 32  in FIG. 1.  
         [0042]    As to the computation of the B interpolation of R 33 , the edge mean of B 33  is computed as shown in the equation (11) first.  
               LM        (     B   33     )       =         B   22     +     B   24     +     B   42     +     B   44       4             (   11   )                               
 
         [0043]    Then, the B interpolation ({circumflex over (B)} 33 ) is computed as shown in the equation (12)  
                 B   ^     33     =       LM        (     B   33     )       ×       R   33       LM        (     R   33     )                   (   12   )                               
 
         [0044]    wherein LM(R 33 ) is computed as shown in the equation (10).  
         [0045]    To compute the B interpolation and the R interpolation of G 23 , the mean value of G 23  is computed as shown in the equation (13) first.  
               LM        (     G   23     )       =         G   12     +     G   14     +     G   34     +     G   32       4             (   13   )                               
 
         [0046]    And then the R interpolation ({circumflex over (R)} 23 ) is computed as shown in the equation (14).  
                 R   ^     23     =           R   13     +     R   33       2     ×       G   23       LM        (     G   23     )                   (   14   )                               
 
         [0047]    The B interpolation ({circumflex over (B)} 23 ) of G 23  is computed as shown in the equation (15)  
                 B   ^     23     =           B   22     +     B   24       2     ×       G   23       LM        (     G   23     )                   (   15   )                               
 
         [0048]    After the aforementioned descriptive example, the B interpolation and the R interpolation from the G sampling data, the G interpolation and the R interpolation from the B sampling data and the G interpolation and the B interpolation from the R sampling data are discussed. Therefore, the color interpolation calculation method of the present invention can be implemented in the image data array of FIG. 1 for the relational color interpolation for every sampling point.  
         [0049]    Referring to FIG. 2, which shows an image data array of another preferred embodiment of the present invention, which is sampled by CFA. The image data array of FIG. 2 is constructed from the image data of M rows and N columns, wherein M is an integer that is not smaller than 3 and N is an integer that is not smaller than 6. The color interpolation calculation method of the present invention can be implemented in the image data array constructed from a plurality of rows and a plurality of columns for interpolation computation, and is not limited to the image data array of FIG. 1.  
         [0050]    Referring to FIG. 3, which shows a real-time color interpolation process system of a preferred embodiment of the present invention. In the real-time color interpolation process system  10 , the image signal  12  from CCD is entered into an analog/digital converter (ADC)  16  for analog/digital conversion from an input terminal  14 , and then the sampling data formed by rows is outputted to a color interpolation processor  18 . Meanwhile, the vertical and horizontal synchronous signals are entered into the color interpolation processor  18  for controlling the operation thereof. When the sampling data of the first row is inputted to the color interpolation processor  18 , the color interpolation processor  18  does not operate, and the sampling data of the first row are saved into a buffer  22 . Then, the sampling data of the second row are inputted to the color interpolation processor  18 , and the color interpolation processor  18  does not operate either, and the sampling data of the second row are saved into a buffer  24 . After the sampling data of the third row are inputted to the color interpolation processor  18 , and the sampling data of the first row and the sampling data of the second row are inputted to the color interpolation processor  18  from the buffer  22  and the buffer  24  at the same time, then the computation begins. When the correlative color interpolations are obtained, the R, G and B components are outputted from the output terminal  26 .  
         [0051]    In other words, when the sampling data of i row and i+1 row are inputted to the color interpolation processor  18 , the sampling data of i row and i+1 row are saved into the buffer  22  and the buffer  24 . After the sampling data of the i+2 row are inputted to the color interpolation processor  18 , the color interpolation processor begins to operate. Therefore, only two buffers are utilized for real-time color interpolation computation in the color interpolation calculation method of the present invention, thereby obtaining the R, G and B components. Thus, the cost and the difficulty of implementation are decreased.  
         [0052]    Referring to FIG. 4, which shows an internal operational flow sheet of the color interpolation processor of a preferred embodiment of the present invention according to FIG. 3. First, the sampling data of i row, the sampling data of i+1 row and sampling data of i+2 row enter the color interpolation processor  18  from an input terminal  50  and the computations for common parameter  52  and the differential computations for horizontal/vertical edges  54  are performed. Then the mean computations  56  are performed with the result from the computations for common parameter  52  for the local mean and the edge mean of the correlative color. For the G final interpolation, the edge weighting computation  58  is performed with the results from the computations for common parameter  52  and the differential computations for horizontal/vertical edges  54 . After the G final interpolation is done, the edge mean and the local mean of the correlative color are obtained, and then the selection for interpolated components  60  is performed to generate an appropriate output signal. Then, a parallel step  62  is performed with the appropriate output signal and the result of computations for common parameter  52 , thereby outputting a correlative interpolation from output  64 .  
         [0053]    Referring to FIG. 5, which shows a core operational flow sheet of a preferred embodiment of the present invention according to the image data array of FIG. 1 and the internal operational flow sheet of FIG. 4. The illustration of the core operational flow sheet of FIG. 5 is based on the interpolation computation of the sampling data of the second row (the i+1 row also) of the image data array of FIG. 1. For example, the signal stream  412  is outputted from the output terminal  102  of FIG. 5. The signal stream  412  is constructed with the correlative G final interpolation and B interpolation of the sampling data of the second row (the i+1 row also) of the image data array of FIG. 1.  
         [0054]    As shown in FIG. 5, for computing the correlative interpolation of the second row (the i+1 row also) of the image data array of FIG. 1, the signal stream  104 , the signal stream  106 , the signal stream  108 , the signal stream  110  and the signal stream  112  are required at least. To computing the R interpolation ({circumflex over (R)} 23 ) and the B interpolation ({circumflex over (B)} 23 ) of G 23  of the second row of the image data array of FIG. 1, G 23  sampling data of the sampling data  130  of the second row of the image data array of FIG. 1 is selected according to the equation (14) and the equation (15). Then the mean value of G 23  (LM(G 23 )) is also selected by controlling the multiplexer  114 . The G 23  sampling data is divided by LM(G 23 ) through the divider  116  and the result after division is sent to the register  118  and then to the multiplicator  120  and the multiplicator  122 . Meanwhile, AR 1  from the signal stream  104  is sent to the multiplicator  120  through the register  128  by controlling the multiplexer  124  for multiplying the result of division and the R interpolation ({circumflex over (R)} 23 ) of G 23  is outputted from the output terminal  100 ; AB 4  from the signal stream  106  is sent to the multiplicator  122  by controlling the multiplexer  126  for multiplying the result of division, and then the B interpolation ({circumflex over (B)} 23 ) of G 23  is outputted from the output terminal  102 .  
         [0055]    As shown in the equation (4), the equation (5) and the equation (6), to compute the R interpolation ({circumflex over (R)} 24 ) and the G final interpolation (Ĝ 24   (2) ) of B 24  of the second row of the image data array of FIG. 1, B 24  sampling data is selected from the second row and the local mean of B 24  (LM(B 24 )) is outputted from the signal stream  110  by controlling the multiplexer  114 . Then, B 24  sampling data is divided by LM(B 24 ) through the divider  116  and the result of division is sent to the multiplicator  120  and the multiplicator  122  through the register  118 . Afterwards, the R local mean (LM(R 24 )) of B 24  in the signal stream  112  is sent to the multiplicator  120  through the register  128  by controlling the multiplexer  124 , and is multiplied by the result of division, and the R interpolation ({circumflex over (R)} 24 ) of B 24  is outputted from the output terminal  100 ; the G initial interpolation (Ĝ 24   (1) ) of B 24  in the signal stream  108  is sent to the multiplicator  122  by controlling the multiplexer  126 , and is multiplied by the result of division, and the G final interpolation (Ĝ 24   (2) ) of B 24  is outputted from the output terminal  102 . The descriptions about generating every signal stream of FIG. 5 are as follows.  
         [0056]    Referring to FIG. 6, which shows a computational flow sheet for common parameters shown in FIG. 4, wherein the image data array of FIG. 1 is utilized. The sampling data of the first row (i.e. the i row) and the sampling data of the third row (i.e. the i+2 row) of the image data array of FIG. 1, are sequentially inputted from R 11  and R 31  to the adder  200  correspondingly for addition as shown in FIG. 6. After the result of addition is shifted two bits rightward, AR 1 , AV 2 , AR 3 , AV 4  and other common parameters are outputted correspondingly as shown in FIG. 6. Therefore, the signal stream  104  of FIG. 5 is constructed from the common parameters that are the output of the adder  200 . Thus, to derive from the addition above, the red common parameter is AR x =(R 1x +R 3x )/2 and the vertical average is AV x =(G 1x +G 3x )/2, wherein the x is an integer not smaller than 1.  
         [0057]    At the same time, the sampling data of the second row (i.e. the i+1 row) and the sampling data delayed by two system clocks from the second row (i.e. the i+1 row) of the image data array of FIG. 1 are sequentially inputted from the G 21  to the adder  202  correspondingly for addition as shown in FIG. 6. After the result of addition is shifted two bits rightward, O, O, AH 3 , AB 4  and other common parameters are outputted in order as shown in FIG. 6, wherein the “O” indicates nothing because there is no result of addition generated in the beginning of addition at the first system clock and the second system clock. The signal stream  106  of FIG. 5 is constructed from the common parameters that are the output of the adder  202 . Thus, to derive from the addition above, the blue common parameter is AB x =(B 2x +B 2(x−2) )/2 and the horizontal average for G component is AH x =(G 2x +G 2(x−2) )/2, wherein the x is an integer not smaller than 1.  
         [0058]    Referring to FIG. 7, which shows a computational flow sheet for the differentials of horizontal/vertical edges according to FIG. 4, wherein the image data array of FIG. 1 is utilized. By utilizing the system clock  208  to control the multiplexer  204 , the G sampling data are sieved from the sampling data of the first row (i.e. the i row) and the second row (i.e. the i+1 row) of the image data array of FIG. 1 as shown in FIG. 7, and sent to the subtracter  210  from G 21  in order.  
         [0059]    Meanwhile, by utilizing the system clock  208  to control the multiplexer  206 , the G sampling data are sieved from the sampling data of the third row (i.e. the i+2 row) and the second row (i.e. the i+1 row) of the image data array of FIG. 1 as shown in FIG. 7, and sent to the subtracter  210  from O in order, wherein the sampling data of the second row is delayed by two system clocks to input to the multiplexer  206  than the sampling data of the third row, and the “O” indicates nothing, because of no sieved result generated from the multiplexer  206  in the beginning of the first system clock and the second system clock, for the sampling data of the second row is delayed two system clocks to input to the multiplexer  206  than the sampling data of the third row. In all diagrams of a preferred embodiment of the present invention, the “O” indicates no signal or nothing corresponding to the time, or the “O” indicates the signal that is not utilized in a preferred embodiment of the present invention.  
         [0060]    The sieved result of the multiplexer  204  and that of the multiplexer  206  are inputted to the subtracter  210  for subtraction operation. After the result of subtraction, wherein O, ΔV 2 , ΔH 3 , ΔV 4 , ΔH 5  and other horizontal and vertical differentials are outputted in order to construct the horizontal and vertical differentials signal stream  212 , wherein the “O” is the output of subtracter  210  at the first clock. The ΔV 2 , ΔV 4  and other vertical differentials in the horizontal and vertical differentials signal stream  212  are based on the equation (15) 
           ΔV   x   =|G   1x   −G   3x |  (15) 
         [0061]    The ΔH 3 , ΔH 5  and other horizontal differentials in the horizontal and vertical differentials signal stream  212  are based on the equation (16). 
           ΔH   x   =|G   2x   −G   2(x−2) |  (16) 
         [0062]    Referring to FIG. 8, which shows a diagram of separation performance of the horizontal and vertical differentials signal stream of a preferred embodiment of the present invention according to FIG. 7. In order to separate the horizontal and the vertical differentials from the horizontal and vertical differentials signal stream  212 , the horizontal and vertical differentials signal stream  212  is sent to the multiplexer  214  of FIG. 8 from the subtracter  210  of FIG. 7.  
         [0063]    Referring to FIG. 9, which shows a diagram of the system clock, the first clock and the second clock of a preferred embodiment of the present invention according to FIG. 8. The system clock  208  of FIG. 9 is inputted to the frequency divider  216  of FIG. 8 for division operation. Then, the first clock  218  is sent to the multiplexer  214  of FIG. 8, and the second clock  220  is sent to the register  222  of FIG. 8, wherein the period of the first clock  218  and that of the second clock  220  are double as much as the period of the system clock  208 .  
         [0064]    Please referring the FIG. 8 and the FIG. 9, the horizontal differentials of the horizontal and vertical differential signal stream  212  are sent to the register  222  from the multiplexer  214  controlled by the first clock  218  of FIG. 9, when the first clock is at high level, and the vertical differentials of the horizontal and vertical differential signal stream  212  are sent to the register  222  from the multiplexer  214  controlled by the first clock  218  of FIG. 9, when the first clock is at low level. Therefore, the vertical differential signal stream  230  and the horizontal differential signal stream  240  of FIG. 8 are obtained in the same system clock, wherein the ΔH 3  of the horizontal differential signal stream  240  corresponds to the ΔV 2  of the vertical differential signal stream  230  in the first system clock, and the ΔH 5  of the horizontal differential signal stream  240  corresponds to the ΔV 4  of the vertical differential signal stream  230  in the second system clock, and so on.  
         [0065]    Referring to FIG. 10, which shows a computational flow sheet for the edge weighting of a preferred embodiment of the present invention. The horizontal differentials signal stream  240  and the vertical differentials signal stream  230  from the multiplexer  214  of FIG. 8 are sent to the adder  300  of FIG. 10 so as to obtain the signal stream  302  constructed of the result of addition (ΔV x +ΔH (x+1) ), for example: (ΔH 3 +ΔV 2 ), (ΔH 5 +ΔV 4 ), etc. Then, the signal stream  302  is sent to the register  304  controlled by the second clock  220  for zero-check. The zero-check is to check whether the ΔV x  and the ΔH (x+1)  of the signal stream  302  are zero or in accordance with the equation (4). If the ΔV x  and the ΔH (x+1)  of the signal stream  302  are zero, the computation would be stopped and the G initial interpolation would be computed and obtained according to the equation (4). If the ΔV x  and the ΔH (x+1)  of the signal stream  302  are not equal to zero, the signal stream  302  would be sent to the divider  306 , and the corresponding signal of the horizontal and vertical differential signal stream  212  would be divided by the corresponding parameter of the signal stream  302 . Thereafter, the result of division is sent to the multiplicator  308 .  
         [0066]    Meanwhile, the signal stream  106  and the signal stream  104  are sent to the multiplexer  310 , and the horizontal average of the signal stream  106  is sent to the multiplicator  308  from the multiplexer  310  controlled by the first clock  218  when the first clock  218  is at high level, and is multiplied by the corresponding parameter outputted from the divider  306  according to the equation (4), and then the result of multiplication is sent to an accumulation addition unit  312 ; the vertical average of the signal stream  104  is sent to the multiplicator  308  from the multiplexer  310  controlled by the first clock  218  when the first clock  218  is at low level, and is multiplied by the corresponding parameter outputted from the divider  306  according to the equation (4), and then the result of multiplication is sent to an accumulation addition unit  312  so as to add to the prior result of multiplication registered in the accumulation addition unit  312 . Afterwards, the signal stream  108  constructed of the G initial interpolation in FIG. 5 is outputted by the control of the system clock  208 .  
         [0067]    Referring to FIG. 11, which shows a diagram of system clock corresponding to the weighting computation of FIG. 8. Since no signal for handling appears in the first system clock, so that “O” is used as an indication. Then ΔH 3  and ΔV 2  are sent to the adder in the second system clock. In the third system clock, the result of addition of ΔH 3  and ΔV 2  is obtained, and then ΔV 2 /(ΔH 3 +ΔV 2 ) is computed, wherein ΔV 2  of the horizontal and vertical differential signal stream  212  is divided by (ΔH 3 +ΔV 2 ) sent to the divider  306 , and then ΔH 3 /(ΔH 3 +ΔV 2 ) is computed, wherein ΔH 3  of the horizontal and vertical differentials signal stream  212  is divided by (ΔH 3 +ΔV 2 ) from the control of the second clock  220 .  
         [0068]    In the forth system clock, ΔV 2 /(ΔH 3 +ΔV 2 ) is multiplied by ΔH 3  of the signal stream  106  that is sent to the multiplicator  308  from the multiplexer  310  controlled by the first clock  218 , and the result of multiplication is sent to the accumulation addition unit  312 . Then ΔH 3 /(ΔH 3 +ΔV 2 ) is multiplied by ΔV 2  of the signal stream  104  that is sent to the multiplicator  308  from the multiplexer  310  controlled by the first clock  218 , and the result of multiplication is sent to the accumulation addition unit  312  to add to the prior parameter. Meanwhile, ΔH 5  and ΔV 4  are sent to the adder. Then the G initial interpolation (Ĝ 22   (1) ) of B 22  is outputted by the control of the system clock  208  in the fifth system clock. At the same time, the performance step of ΔH 5  and ΔV 4  is similar to the performance step of ΔH 3  and ΔV 2  at the third system clock, so that the signal stream  108  constructed of different G initial interpolation outputted from the accumulation addition unit  312  is obtained.  
         [0069]    Referring to FIG. 12, which shows a flow sheet of the B local mean computation of FIG. 4. In order to obtain the signal stream  110  constructed of B local mean value, the B sampling data are first sieved from the second row of the image data array of FIG. 1, and the B interpolation is sieved from the signal stream  412  that is outputted from the output terminal  102  of FIG. 5. As shown in FIG. 12, the B interpolation of G 23  and the B 26  sampling data are sent to the adder  400  for addition operation. The result of addition and AB 4  of the signal stream  106  are added together and shifted two bits rightward to obtain the signal stream  110  constructed of the B local mean value in FIG. 5, wherein AB 4  is derived from AB x =(B 2x +B 2(x−2) )/2.  
         [0070]    Referring to FIG. 13, which shows a computational flow sheet of the R edge mean value and the G mean value of FIG. 4. In order to obtain the signal stream  112  constructed of the R edge mean value and the G mean value in FIG. 5, the signal stream  104  is outputted from the adder  200  in FIG. 6, and the signal stream  104  that is delayed by two system clocks is sent to the adder  404  for addition operation. Therefore, the signal stream  112  constructed of the R edge mean value and the G mean value can be obtained.  
         [0071]    After the signal stream  104 , the signal stream  106 , the signal stream  108 , the signal stream  110  and the signal stream  112  are obtained from the computations described above, the interpolations corresponding to every sampling data of the image data array of FIG. 1 are obtained in order. Then the selection for interpolated components  60  is performed for selecting the appropriate output signal, and the parallel process  62  is performed with the appropriate output signal and the result of computations for common parameters, and the corresponding interpolation is outputted from the output  64  finally.  
         [0072]    The advantage of the present invention is to provide a high-performance color interpolation processor and the color interpolation calculation method thereof. By utilizing the color interpolation calculation method of the present invention in the image signal process system using CCD for sampling, the better interpolation quality is provided, and the time of computing interpolation is decreased at the same time, so that the efficiency of interpolation process is enhanced. Thus, the present invention is suitable for use in real-time image process system, thereby decreasing the cost.  
         [0073]    As is understood by a person skilled in the art, the foregoing preferred embodiments of the present invention are illustrated of the present invention rather than limiting of the present invention. It is intended to cover various modifications and similar arrangements included within the spirit and scope of the appended claims, the scope of which should be accorded the broadest interpretation so as to encompass all such modifications and similar structure.