Abstract:
Color filter array interpolation with directional derivatives using all eight nearest neighbor pixels. The interpolation method applies to Bayer pattern color CCDs and MOS detectors and is useful in digital still cameras and video cameras.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS  
       [0001]    This application claims priority from provisional application: Serial No. 60/343,132, filed Dec. 21, 2001. The following patent applications disclose related subject matter: Serial Nos. 09/______, filed ______ (-----). These referenced applications have a common assignee with the present application. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    The invention relates to electronic devices, and more particularly to color filter array interpolation methods and related devices such as digital cameras.  
           [0003]    There has been a considerable growth in the sale and use of digital cameras in the last few years. Nearly 10M digital cameras were sold worldwide in 2000, and this number is expected to grow to 40M units by 2005. This growth is primarily driven by consumers&#39; desire to view and transfer images instantaneously. FIG. 5 is a block diagram of a typical digital still camera (DSC) which includes various image processing components, collectively referred to as an image pipeline. Color filter array (CFA) interpolation, gamma correction, white balancing, color space conversion, and JPEG compression/decompression constitute some of the key image pipeline processes. Note that the typical color CCD consists of a rectangular array of photosites (pixels) with each photosite covered by a filter (CFA): either red, green, or blue. In the commonly-used Bayer pattern CFA one-half of the photosites are green, one-quarter are red, and one-quarter are blue. And the color conversion from RGB to YCbCr (luminance, chrominance blue, and chrominance red) used in JPEG is defined by: 
             Y= 0.299 R+ 0.587 G+ 0.114 B   
             Cb=− 0.16875 R− 0.33126 G+ 0.5 B   
             Cr= 0.5 R− 0.41859 G− 0.08131 B   
           [0004]    so the inverse conversion is: 
             R=Y+ 1.402 Cr   
             G=Y− 0.34413 Cb− 0.71414 Cr   
             B=Y+ 1.772 Cb   
           [0005]    where for 8-bit colors the R, G, and B will have integer values in the range 0-255 and the CbCr plane will be correspondingly discrete.  
           [0006]    To recover a full-color image (all three colors at each pixel), a method is therefore required to calculate or interpolate values of the missing colors at a pixel from the colors of its neighboring pixels. Such interpolation methods are referred to as CFA interpolation, reconstruction or demosaicing algorithms in the image processing literature.  
           [0007]    It is easier to understand the underlying mathematics of interpolation by looking at 1D rather than 2D signals. The CFA samples can be regarded as the samples of a lower resolution image or a signal x CFA (n). The resolution can be doubled by inserting zeros between x CFA (n) samples to form a new expanded signal x(n) as shown in FIG. 3. The expansion is going to squeeze the frequency response in the frequency domain as indicated in FIG. 4. Assuming no aliasing of high frequency content, by performing a low-pass filtering operation, interpolated samples can be generated in-between the original samples. In FIG. 3, the interpolated signal is denoted by y(n).  
           [0008]    The differences between bilinear interpolation, cubic/B-spline interpolation and other similar CFA interpolation techniques lie in the shape of the low-pass filter used. However, they all share the same underlying interpolation mathematics.  
           [0009]    In general, the low-pass filtering operation leads to the removal of some high frequency image content. The situation is less serious for green color (or luminance) as compared to blue and red colors (or chrominance) since there are twice as many green pixels in the Bayer pattern. The artifacts introduced by low-pass filtering appear as aliasing in high frequency areas, blurry looking image in areas of uniform color, and zigzaginess, known as the “zipper effect”, along edges. To overcome such artifacts, many methods have been developed to incorporate high frequency or edge information into the interpolation process.  
           [0010]    Indeed, CFA interpolation methods can be classified into two major categories: non-adaptive interpolation and edge-adaptive interpolation methods. In non-adaptive interpolation methods, the interpolation process is carried out the same way in all parts of the image regardless of any high frequency color variations, whereas in edge-adaptive methods, the interpolation process is altered in different parts of the image depending on high frequency colorcontent.  
           [0011]    Some edge-adaptive interpolation methods first detect the edges in the image and then use them to guide the interpolation process. Examples of such techniques appear in Allebach et al, Edge-Directed Interpolation, IEEE Proc. ICIP 707 (1996) and Dube et al, An Adaptive Algorithm for Image Resolution Enhancement, 2 Signals, Systems and Computers 1731 (2000). This approach is computationally expensive due to performing explicit edge detection.  
           [0012]    Another category of edge-adaptive techniques incorporates the edge information into the interpolation process and hence are computationally more attractive. For example, see U.S. Pat. No. 4,642,678 (Cok), Kimmel, Demosaicing: Image Reconstruction from Color CCD Samples, 8 IEEE Trans.Image Proc. 1221 (1999), Li et al, New Edge Directed Interpolation, Proc. 2000 IEEE ICIP 311, and Muresan et al, Adaptive, Optimal-Recovery Image Interpolation, Proc. 2001 IEEE ICASSP 1949.  
           [0013]    However, all of these methods have quality limitations.  
         SUMMARY OF THE INVENTION  
         [0014]    The present invention provides camera systems and methods of CFA interpolation using directional derivatives for all eight nearest neighbors of a pixel.  
           [0015]    This has advantages including enhanced quality of interpolation. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0016]    The drawings are heuristic for clarity.  
         [0017]    [0017]FIG. 1 is a flow diagram for a preferred embodiment method.  
         [0018]    [0018]FIGS. 2 a - 2   b  illustrate pixel notations.  
         [0019]    FIGS.  3 - 4  show one-dimensional interpolation.  
         [0020]    [0020]FIG. 5 is a block diagram of still camera system.  
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
     1. Overview  
       [0021]    Preferred embodiment digital camera systems include preferred embodiment CFA interpolation methods which use a weighted sum of nearest neighbor direction predictors. FIG. 1 is a flow diagram for a first preferred embodiment method  
         [0022]    [0022]FIG. 5 shows in functional block form a system (camera) which may incorporate preferred embodiment CFA interpolation methods. The functions of FIG. 5 can be performed with digital signal processors (DSPs) or general purpose programmable processors or application specific circuitry or systems on a chip such as both a DSP and RISC processor on the same chip with the RISC processor as controller. Further specialized accelerators, such as CFA color interpolation and JPEG encoding, could be added to a chip with a DSP and a RISC processor. Captured images could be stored in memory either prior to or after image pipeline processing. The image pipeline functions could be a stored program in an onboard or external ROM, flash EEPROM, or ferroelectric RAM for any programmable processors.  
       2. First Preferred Embodiment  
       [0023]    The first preferred embodiment Bayer CFA interpolation initially interpolates the green color plane using all CFA pixel values, and then interpolates the red and blue color planes using the previously-interpolated green color plane. FIG. 2 a  shows a pixel at (i,j) plus the eight nearest neighbor pixels where the pixel color values P m,n  denote the original Bayer CFA values; additionally, FIG. 2 a  indicates the pattern of Bayer CFA colors for the case of P i,j  being blue.  
         [0024]    The green interpolation calculates a missing green pixel value, G i,j , as a weighted average of eight green predictors,            x , one predictor for each of the eight nearest neighbor pixel directions (labeled by the compass directions from the missing pixel as illustrated in FIG. 2 b ). 
           G   i,j =α N             N +α W             W +α S             S +α E             E +α NW             NW +α SW z, 901   SW +α SE z, 901   SE +α NE             NE   
         [0025]    where α N +α W +α S +α E +α NW +α SW +α SE +α NE =1, so the weights are normalized. The green predictors are roughly linear extrapolations using directional derivatives, plus the weights vary inversely with the directional derivatives to de-emphasize extrapolation across an edge in the image. In particular, presume the pixel at (i,j) is not a green pixel in the Bayer CFA where i is the column index and j is the row index; e.g., FIG. 2 a.  Then compute a green value G i,j  for this pixel as follows. First, note that the four nearest-neighbor pixels (horizontal and vertical) in the CFA have green values G i,−1j,  G i−1,j,  G i,j+1,  and G i+1,j  and the four diagonal-neighbor pixels have all red (blue) values R i−1,j−1,  R i+1,j−1,  R i−1,j+1,  and R i+1,j+1 . These eight neighboring pixels are labeled by the eight compass directions (N,S,E,W,NE,SE,NW,SW) with N-S corresponding to an array column (index i) and W-E to an array row (index j); see FIG. 2 b.  Then for each of these eight neighboring pixels define a green prediction value (           x ) for the pixel at (i, j) as follows: 
         
               
       N 
       =G 
       i,j−1 
       +ΔG 
       N 
     
         
               
       W 
       =G 
       i−1,j 
       +ΔG 
       W 
     
         
               
       S 
       =G 
       i,j+1 
       +ΔG 
       S 
     
         
               
       E 
       =G 
       i+1,j 
       +ΔG 
       E 
     
                     NW =( G   i,j−1   +G   i−1,j )/2+ ΔG   NW   
                     SW =( G   i,j+1   +G   i−1,j )/2+ ΔG   SW   
                     SE =( G   i,j+1   +G   i+1,j )/2+ ΔG   SE   
                     NE =( G   i,j−1   +G   i+1,j )/2+ ΔG   NE   
         [0026]    Thus for N,S,E,W the predictor value is the neighboring green pixel value (e.g., G i,j−1 ) plus an increment (e.g., ΔG N ), and for NW,SE,NW,SW the predictor value is a green value created as the average of two neighboring green pixels&#39; values (e.g., (G i,j−1 +G i−1,j )/2) and deemed located at the midpoint between the neighboring pixel centers (which is the corner of the (i,j) pixel in the corresponding direction) plus an increment (e.g., ΔG NW ). The increments are just linear extrapolations: each increment is the product of the (approximated) directional derivative at the midpoint between the green value location (either neighboring green pixel center or the created green value at the (i,j) pixel corner) and the center of the predicted (i,j) pixel multiplied by the distance (in terms of the distance between pixel centers horizontally or vertically) between the green value location and the center of (i,j) as follows: 
           ΔG   N =( Dy   i,j   +Dy   i,j−1 )/2 
           ΔG   W =( Dx   i,j   +Dx   i−1,j )/2 
           ΔG   S =( −Dy   i,j   −Dy   i,j+1 )/2 
           ΔG   E =( −Dx   i,j   −Dx   i+1,j )/2 
           ΔG   NW =( Du   i,j   +[Dy   i,j−1   +Dx   i−1,j ]/2)/2 
           ΔG   SW =( −Dv   i,j   −[Dy   i,j+1   −Dx   i−1,j ]/2)/2 
           ΔG   SE =( −Du   i,j   −[Dy   i,j+1   +Dx   i+1,j ]/2)/2 
           ΔG   NE =( Dv   i,j   +[Dy   i,j−1   −Dx   i+1,j ]/2)/2 
         [0027]    Here the horizontal directional derivatives Dx m,n , the vertical directional derivatives Dy m,n , and the diagonal directional derivatives Du m,n  and Dv m,n  are defined as: 
           Dx   m,n =( P   m+1,n   −P   m−1,n )/2 
           Dy   m,n =( P   m,n+1   −P   m,n−1 )/2 
           Du   m,n =( P   m+1,n+1   −P   m−1,n−1 )/2{square root}2 
           Dv   m,n =( P   m−1,n+1   −P   m+1,n−1 )/2{square root}2 
         [0028]    where P m,n  is the Bayer CFA color value at pixel (m,n); see FIG. 2 a.  Note that for each (m,n) P m+1,n , P m−1,n , P m,n+1 , and P m,n−1  are all of the same color. Hence, Adams&#39;s color correlation model implies that the directional derivatives are well-defined and independent of color. (Recall the color correlation model presumes locally B=G+k B  and R=G+k R  for some constants k B  and k R , so pixel value differences within a color plane locally have the constant canceling out.) The division by 2 in Dx m,n  and Dy m,n  corresponds to the pixels in the difference being a distance 2 apart, and similarly the 2{square root}2 in the diagonal directional corresponds to the pixels in the difference being a distance 2{square root}2 apart.  
         [0029]    In particular, for ΔG N  the distance between the north green value at (i,j−1) and the predicted pixel at (i,j) equals 1, and the (approximated) directional derivative at the midpoint between (i,j−1) and (i,j) is taken to be the average of the y directional derivatives at (i,j−1) and the y directional derivative at (i,j). Similarly for the south, west, and east.  
         [0030]    For ΔG NW  the green value is located at the NW corner of the (i, j) pixel and is taken to be the average of the green values at the N pixel (i,j−1) and the W pixel (i−1,j), and the diagonal directional derivative at this green value location is taken to be the average of the y directional derivative at the N pixel and the x directional derivative at the W pixel. Thus the distance from this green value location to the center of the (i, j) pixel is 1/{square root}2. And the diagonal directional derivative at the midpoint between this green value location and the center of the pixel at (i, j) is taken to be the average of the diagonal derivative at (i,j) and the average-defined diagonal derivative at the green value location. Again, NE, SW, and SE are similar.  
         [0031]    The weights are defined with an inverse correspondence to the magnitude of the directional derivative: this de-emphasizes the predictions across edges where the directional derivative would be large. Various measures of magnitude could be used; however, absolute differences (rather than squared differences or other magnitude measurements) allow a more efficient implementation on a fixed-point processor. Thus define the (not normalized) weights: 
           w   N =1/(1 +|Dy   i,j   |+|Dy   i,j−1 |) 
           w   W =1/(1 +|Dx   i,j   |+|Dx   i−1,j |) 
           w   S =1/(1 +|Dy   i,j   |+|Dy   i,j+1 |) 
           w   E =1/(1 +|Dx   i,j   |+|Dx   i+1,j |) 
           w   NW =1/(1 +|Du   i,j   |+|Du   i−1,j−1 |) 
           w   SW =1/(1 +|Dv   i,j   |+|Dv   i−1,j+1 |) 
           w   SE =1/(1 +|Du   i,j   |+|Du   i+1,j+1 |) 
           w   NE =1/(1 +|Dv   i,j   |+|Dv   i+1,j−1 |) 
         [0032]    and so normalize by α N =w N /Σ, α=w W /Σ, α S =w S /Σ, α E =w E /Σ, α NW =w NW /Σ, α SW =w SW /Σ, α SE =w SE /Σ, and α NE =w NE /Σ where Σ=w N +w W +w S+w   E +w NW +w SW +w SE +w NE . This completes the green plane interpolation.  
         [0033]    After performing the above green interpolation, which can be viewed as the luminance interpolation, proceed with the red and blue (chrominance) interpolation. This time use the directional derivative approach to interpolate the differences B−G and R−G noting that these differences become more severe at edges as compared to uniform color areas. B−G and R−G differences correspond to a well-behaved chrominance or color space and match well with the color correlation model. (In contrast, the B/G and R/G ratios do not correspond to a well-behaved color space due to the possibility of having low green values.)  
         [0034]    In particular, for blue/red interpolation again proceed in two steps. In the first step, interpolate the missing blues/reds at red/blue locations by using the same weights (recall the directional derivatives were color independent) and analogous diagonal predictors as in the foregoing green interpolation: 
           B   i,j =( w   NW             NW   +w   SW             SW   +w   SE             SE   +w   NE             NE )/ K   
         [0035]    and 
           R   i,j =( w   NW             NW   +w   SW             SW   +w   SE             SE   +w   NE             NE )/ K   
         [0036]    where K=w NW +w SW +w SE +w NE  normalizes the weights.  
         [0037]    The red and blue predictors are defined analogously with the green extrapolations: 
         
               
       NW 
       =B 
       i−1,j−1 
       +ΔB 
       NW 
     
         
               
       SW 
       =B 
       i−1,j+1 
       +ΔB 
       SW 
     
         
               
       SE 
       =B 
       i+1,j+1 
       +ΔB 
       SE 
     
         
               
       NE 
       =B 
       i+1,j−1 
       +ΔB 
       NE 
     
         [0038]    and 
         
               
       NW 
       =R 
       i−1,j−1 
       +ΔR 
       NW 
     
         
               
       SW 
       =R 
       i−1,j+1 
       +ΔR 
       SW 
     
         
               
       SE 
       =R 
       i+1,j+1 
       +ΔR 
       SE 
     
         
               
       NE 
       =R 
       i+1,j−1 
       +ΔR 
       NE 
     
         [0039]    The directional increments are taken as equal to the corresponding green increments from the previously interpolated green plane: 
         +Δ B   NW   ≅ΔG   NW   =G   i,j   −G   i−1,j−1   
         +Δ B   SW   ≅ΔG   SW   =G   i,j   −G   i−1,j+1   
         +Δ B   SE   ≅ΔG   SE   =G   i,j   −G   i+1,j+1   
         +Δ B   NE   ≅ΔG   NE   =G   i,j   −G   i+1,j−1   
         [0040]    and 
         +Δ R   NW   ≅ΔG   NW   =G   i,j   −G   i−1,j−1   
         +Δ R   SW   ≅ΔG   SW   =G   i,j   −G   i−1,j+1   
         +Δ R   SE   ≅ΔG   SE   =G   i,j   −G   i+1,j+1   
         +Δ R   NE   ≅ΔG   NE   =G   i,j   −G   i+1,j−1   
         [0041]    The foregoing red/blue interpolation on blue/red pixels is thus equivalent to interpolation of the differences B i,j −G i,j  (and R i,j −G i,j ) with the same weights; that is: 
           B   i,j   =G   i,j   +{w   NW ( B   i−1,j−1   −G   i−1,j−1 )+ w   SW ( B   i−1,j+1   −G   i−1,j+1 )+ w   SE ( B   i+1,j+1   −G   i+1,j+1 )+ w   NE ( B   i+1,j+1   −G   i+1,j+1 )}/ K   
         [0042]    where again K=w NW +w SW +w SE +w NE  normalizes the weights.  
         [0043]    In the second step, interpolate the missing blues/reds at green locations by using horizontal and vertical direction predictors: 
           B   i,j =( w   N             N   +w   W             W   +w   S             S   +w   E             E )/ M   
         [0044]    and 
           R   i,j =( w   N             N   +w   W             W   +w   S             S   +w   E             E )/ M   
         [0045]    where M=w N +w W +w S +w E  normalizes the weights. Again, the predictors are defined by color values plus (horizontal and vertical) increments: 
         
               
       N 
       =B 
       i,j−1 
       +ΔB 
       N 
     
         
               
       W 
       =B 
       i−1,j 
       +ΔB 
       W 
     
         
               
       S 
       =B 
       i,j+1 
       +ΔB 
       S 
     
         
               
       E 
       =B 
       i+1,j 
       +ΔB 
       E 
     
         [0046]    and 
         
               
       N 
       =R 
       1,j−1 
       +ΔR 
       N 
     
         
               
       W 
       =R 
       i−1,j 
       +ΔR 
       W 
     
         
               
       S 
       =R 
       i,j+1 
       +ΔR 
       S 
     
         
               
       E 
       =R 
       i+1,j 
       +ΔR 
       E 
     
         [0047]    with the increments again taken equal to the green horizontal and vertical increments. 
         
       +ΔB 
       N 
       ≅ΔG 
       N 
       =G 
       i,j 
       −G 
       i,j−1 
     
         
       +ΔB 
       W 
       ≅ΔG 
       W 
       =G 
       i,j 
       −G 
       i−1,j 
     
         
       +ΔB 
       S 
       ≅ΔG 
       S 
       =G 
       i,j 
       −G 
       i+i,j 
     
         
       +ΔB 
       E 
       ≅ΔG 
       E 
       =G 
       i,j 
       −G 
       i+1,j 
     
         [0048]    and 
         
       +ΔR 
       N 
       ≅ΔG 
       N 
       =G 
       i,j 
       −G 
       i,j−1 
     
         
       +ΔR 
       W 
       ≅ΔG 
       W 
       =G 
       i,j 
       −G 
       i−1,j 
     
         
       +ΔR 
       S 
       ≅ΔG 
       S 
       =G 
       i,j 
       −G 
       i,j+1 
     
         
       +ΔR 
       E 
       ≅ΔG 
       E 
       =G 
       i,j 
       −G 
       i+1,j 
     
         [0049]    This completes the CFA interpolation. Note that the overall effect is a filtering with a filter kernel having coefficients varying according to the eight neighboring pixels and associated directional derivatives.  
       3. Alternative Preferred Embodiment  
       [0050]    An alternative preferred embodiment replaces the directional derivative combination (Du i,j +[Dy i,j−1 +Dx i−1,j ]/2)/2 of the green interpolation with a combination of two pure diagonal derivatives in a 3 to 1 ratio: (3Du i,j +Du i−1,j−1 )/4 and this avoids relying on horizontal and vertical derivatives but extends farther in the diagonal direction.  
       4. Modifications  
       [0051]    The preferred embodiments may be modified in various ways while retaining one or more of the features of predictions from neighboring pixels by linear extrapolations with estimated directional derivatives and predictions from all eight neighboring pixels with weightings of the predictions varying inversely on the directional derivatives. For example, the input color planes may be varied such as yellow-cyan-magenta-green, the weights may depend on other combinations of directional derivatives in parallel directions, either directly or indirectly, such as when three of the four directional derivatives used for weights in parallel directions (e.g., W N  uses Dx i,j  plus Dx i,j   1  and w S  uses Dx i,j  plus Dx i,j+1 ) have large magnitudes and the fourth a small magnitude (note that Dx i,j  is counted twice and thus must be large), then drop the common (large) directional derivative from the weight with the small directional derivative. and thereby only retain the small one; . . . .