# Patent

## Title
Four-channel color filter array interpolation

## Abstract

A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising capturing a color filter array image using an image sensor including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels being panchromatic pixels; computing an interpolated panchromatic image from the color filter array image; computing an interpolated color image from the color filter array image; and forming the full color output image from the interpolated panchromatic image and the interpolated color image.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
Reference is made to commonly assigned U.S. application Ser. No. 12/401,002, filed Mar. 10, 2009 entitled CFA IMAGE WITH SYNTHETIC PANCHROMATIC IMAGE by Kumar et al., commonly assigned U.S. application Ser. No. 12/412,429, filed Mar. 27, 2009 entitled PRODUCING FULL-COLOR IMAGE USING CFA IMAGE by Kumar et al., commonly assigned U.S. application Ser. No. 12/423,839 filed Apr. 15, 2009 entitled PRODUCING FULL-COLOR IMAGE WITH REDUCED MOTION BLUR by Kumar et al., and commonly assigned U.S. application Ser. No. 12/472,563 filed May 27, 2009 entitled FOUR-CHANNEL COLOR FILTER ARRAY PATTERN by James E. Adams Jr., the disclosures of which are incorporated herein by reference.
FIELD OF THE INVENTION
The present invention relates to producing a full-color image with improved spatial resolution from a color filter array image having color channels and a panchromatic channel.
BACKGROUND OF THE INVENTION
A single-sensor digital camera employs a color filter array (CFA) in order to capture full-color information from a single two dimensional array of light-sensitive pixels. The CFA comprises an array of color filters that filter the light being detected by each pixel. As a result, each pixel receives light from only one color, or in the case of a panchromatic or “clear” filter, from all colors. In order to reproduce a full-color image from the CFA image, three color values must be produced at each pixel location. This is accomplished by interpolating the missing color values from neighboring pixel values.
The best known CFA pattern uses three colors channels as described by Bayer (U.S. Pat. No. 3,971,065) and shown in FIG. 2. The Bayer CFA has three color channels which enables full-color reproduction capability. However, the exact spectral responsivities (“colors”) of the three channels represent a compromise. In order to improve color fidelity and broaden the range of colors that can be captured by the CFA (i.e., the color gamut), the spectral responsivities need to be made more selective (“narrowed”). This has the side effect of reducing the overall amount of light that reaches the pixel and, therefore, reduces its sensitivity to light. As a consequence, the pixel value becomes more susceptible to noise from non-imaging sources, e.g., thermal noise. One solution to the noise problem is to make the CFA spectral responsivities less selective (“broader”) to increase the overall amount of light that reaches the pixel. However, this comes with the side effect of reducing color fidelity.
A solution to this three-channel CFA limitation is to employ a four-channel CFA composed of three colors with “narrow” spectral sensitivities and one color with a “broad” spectral sensitivity. The “broadest” such channel would be panchromatic or “clear” which would be sensitive to the full spectrum of light. The three “narrowband” color channels would produce an image with higher color fidelity and lower spatial resolution while the fourth “broadband” panchromatic channel would produce an image with lower noise and higher spatial resolution. These high color fidelity, low spatial resolution and low noise, high spatial resolution images would then be merged into a final high color fidelity, low noise, high spatial resolution image.
In order to produce a high spatial resolution panchromatic image while maintaining high color fidelity from the color pixels, the number and arrangement of panchromatic pixels within the CFA and the corresponding interpolation algorithms must be properly chosen. There are a variety of examples in the prior art with one or more liabilities in this regard. Frame (U.S. Pat. No. 7,012,643) teaches a CFA as shown in FIG. 12 that has only a single red (R), green (G), and blue (B) pixel within a 9×9 square of panchromatic (P) pixels. The problem with Frame is that the resulting color spatial resolution is too low to produce all but the lowest frequency color details in the image.
Yamagami et al. (U.S. Pat. No. 5,323,233) describe two CFA patterns as shown in FIGS. 13A and 13B that have equal amounts of panchromatic and color pixels, avoiding the liability of Frame. Yamagami et al. go on to teach using simple bilinear interpolation as the technique for interpolating the missing panchromatic values. The use of solely linear interpolation methods (such as bilinear interpolation) strongly limits the spatial resolution of the interpolated image. Nonlinear methods, such as that described in Adams et al. (U.S. Pat. No. 5,506,619), produce higher spatial resolution interpolated images, provided the CFA pattern permits their use. FIG. 14A illustrates the pattern used in Adams et al. Green (G) pixels, which provide the high spatial frequency resolution in the three channel system shown in FIG. 2, alternate with color (C) pixels in both the horizontal and vertical directions about a central color pixel. It is important to note that these color pixels are all the same color, e.g., red pixels. FIG. 14B shows a similar pattern that uses panchromatic (P) pixels in place of green pixels. It should be noted at this point that for a four-channel system it is not possible to arrange all four channels (R, G, B, and P) in such a way that the pattern shown in FIG. 14B occurs at all color (R, G, B) pixel locations across the sensor. Therefore, any possible arrangement will be some compromise in this manner. With regard to Yamagami et al. FIG. 13A has green and panchromatic pixels arranged as in FIG. 14B, but the red and blue pixels are not so arranged. After FIG. 14B, an arrangement such as in FIG. 14C is preferred, but FIG. 13A does not have this either with respect to the red and blue pixels. FIG. 13B does not have the patterns of FIG. 14B or FIG. 14C for any color pixels. Tanaka et al. (U.S. Pat. No. 4,437,112) describe a number of CFA patterns of which the most relevant one to this discussion is FIG. 15. In FIG. 15 cyan (C), yellow (Y), green (G), and panchromatic (P) pixels are arranged so that the green pixels are surrounded by the neighborhood shown in FIG. 14C. However, the yellow and cyan pixels do not conform to the patterns of either FIG. 14B or FIG. 14C. The same difficulties exist with the other patterns taught by Tanaka et al.
Hamilton et al. (U.S. Pat. Appl. No. 2007/0024879) teach a large number of CFA patterns of which two are shown in FIGS. 16A and 16B. The liabilities of these, as well as all of the other patterns disclosed in Hamilton et al., are the lack of FIG. 14B and FIG. 14C pixel arrangements.
Kijima et al. (U.S. Pat. Appl. No. 2007/0177236) describe a large number of CFA patterns of which the most relevant CFA pattern is shown in FIG. 17. While the double row of panchromatic pixels provides a FIG. 14C arrangement in the vertical direction, no such horizontal arrangement of side-by-side panchromatic values exists in FIG. 17.
Thus, there exists a need for a four-channel CFA pattern with three narrowband color channels and one broadband panchromatic channel with enough color pixels to provide sufficient color spatial resolution and arranged in such a way as to permit the effective nonlinear interpolation of the missing panchromatic values.
SUMMARY OF THE INVENTION
In accordance with the present invention, there is provided a method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processor(s) for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels being panchromatic pixels;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image.
An advantage of the present invention is that the color spatial resolution of the image is improved without the need of increasing the percentage of color pixels with respect to panchromatic pixels within the sensor.
A further advantage of the present invention is that a reduction of color noise in the image is realized without the need for increasing the spectral bandwidth of the color pixels with the correspondingly reduction of color fidelity of the image.
This and other aspects, objects, features, and advantages of the present invention will be more clearly understood and appreciated from a review of the following detailed description of the preferred embodiments and appended claims, and by reference to the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a digital camera for implementing the present invention;
FIG. 2 is a minimum repeating unit from the prior art;
FIG. 3 is a minimum repeating unit for the preferred embodiment of the present invention;
FIG. 4 is a minimum repeating unit for an alternate embodiment of the present invention;
FIG. 5 is an overview of the image processing chain for a preferred embodiment of the present invention; image values;
FIG. 7 is a pixel neighborhood used in interpolating color difference values;
FIG. 8 is a pixel neighborhood used in interpolating color difference values;
FIG. 9 is a pixel neighborhood used in interpolating color difference values;
FIG. 10 is a block diagram showing a detailed view of the fuse images block for a preferred embodiment of the present invention;
FIG. 11 is a block diagram showing a detailed view of the fuse images block for an alternate embodiment of the present invention;
FIG. 12 is a minimum repeating unit from the prior art;
FIG. 13A and FIG. 13B are minimum repeating units from the prior art;
FIG. 14A, FIG. 14B and FIG. 14C are pixel neighborhoods used for interpolating panchromatic image values from the prior art;
FIG. 15 is a minimum repeating unit from the prior art;
FIG. 16A and FIG. 16B are minimum repeating units from the prior art; and
FIG. 17 is a minimum repeating unit from the prior art.



DETAILED DESCRIPTION OF THE INVENTION
In the following description, a preferred embodiment of the present invention will be described in terms that would ordinarily be implemented as a software program. Those skilled in the art will readily recognize that the equivalent of such software can also be constructed in hardware. Because image manipulation algorithms and systems are well known, the present description will be directed in particular to algorithms and systems forming part of, or cooperating more directly with, the system and method in accordance with the present invention. Other aspects of such algorithms and systems, and hardware or software for producing and otherwise processing the image signals involved therewith, not specifically shown or described herein, can be selected from such systems, algorithms, components and elements known in the art. Given the system as described according to the invention in the following materials, software not specifically shown, suggested or described herein that is useful for implementation of the invention is conventional and within the ordinary skill in such arts.
Still further, as used herein, the computer program for performing the method of the present invention can be stored in a computer readable storage medium, which can include, for example; magnetic storage media such as a magnetic disk (such as a hard drive or a floppy disk) or magnetic tape; optical storage media such as an optical disc, optical tape, or machine readable bar code; solid state electronic storage devices such as random access memory (RAM), or read only memory (ROM); or any other physical device or medium employed to store a computer program.
Because digital cameras employing imaging devices and related circuitry for signal capture and correction and for exposure control are well known, the present description will be directed in particular to elements forming part of, or cooperating more directly with, the method and apparatus in accordance with the present invention. Elements not specifically shown or described herein are selected from those known in the art. Certain aspects of the embodiments to be described are provided in software. Given the system as shown and described according to the invention in the following materials, software not specifically shown, described or suggested herein that is useful for implementation of the invention is conventional and within the ordinary skill in such arts.
Turning now to FIG. 1, a block diagram of an image capture device embodying the present invention is shown. In this example, the image capture device is shown as a digital camera. However, although a digital camera will now be explained, the present invention is clearly applicable to other types of image capture devices as well. In the disclosed camera, light from the subject scene 10 is input to an imaging stage 11, where the light is focused by lens 12 to form an image on a solid state color filter array image sensor 20. Color filter array image sensor 20 converts the incident light to an electrical signal for each picture element (pixel). The color filter array image sensor 20 of the preferred embodiment is a charge coupled device (CCD) type or an active pixel sensor (APS) type. (APS devices are often referred to as CMOS sensors because of the ability to fabricate them in a Complementary Metal Oxide Semiconductor process.) Other types of image sensors having two-dimensional array of pixels can also be used provided that they employ the patterns of the present invention. The color filter array image sensor 20 for use in the present invention comprises a two-dimensional array of color and panchromatic pixels as will become clear later in this specification after FIG. 1 is described.
The amount of light reaching the color filter array image sensor 20 is regulated by an iris block 14 that varies the aperture and a neutral density (ND) filter block 13 that includes one or more ND filters interposed in the optical path. Also regulating the overall light level is the time that a shutter 18 is open. An exposure controller 40 responds to the amount of light available in the scene as metered by a brightness sensor block 16 and controls all three of these regulating functions.
This description of a particular camera configuration will be familiar to one skilled in the art, and it will be obvious that many variations and additional features are present. For example, an autofocus system can be added, or the lens can be detachable and interchangeable. It will be understood that the present invention can be applied to any type of digital camera, where similar functionality is provided by alternative components. For example, the digital camera can be a relatively simple point-and-shoot digital camera, where the shutter 18 is a relatively simple movable blade shutter, or the like, instead of the more complicated focal plane arrangement. The present invention can also be practiced using imaging components included in non-camera devices such as mobile phones and automotive vehicles.
The analog signal from the color filter array image sensor 20 is processed by analog signal processor 22 and applied to analog-to-digital (A/D) converter 24. A timing generator 26 produces various clocking signals to select rows and pixels and synchronizes the operation of analog signal processor 22 and A/D converter 24. An image sensor stage 28 includes the color filter array image sensor 20, the analog signal processor 22, the A/D converter 24, and the timing generator 26. The components of image sensor stage 28 can be separately fabricated integrated circuits, or they can be fabricated as a single integrated circuit as is commonly done with CMOS image sensors. The resulting stream of digital pixel values from the AD converter 24 is stored in a digital signal processor (DSP) memory 32 associated with a digital signal processor (DSP) 36.
The DSP 36 is one of three processors or controllers in this embodiment, in addition to a system controller 50 and an exposure controller 40. Although this partitioning of camera functional control among multiple controllers and processors is typical, these controllers or processors can be combined in various ways without affecting the functional operation of the camera and the application of the present invention. These controllers or processors can include one or more digital signal processor devices, microcontrollers, programmable logic devices, or other digital logic circuits. Although a combination of such controllers or processors has been described, it should be apparent that one controller or processor can be designated to perform all of the needed functions. All of these variations can perform the same function and fall within the scope of this invention, and the term “processing stage” will be used as needed to encompass all of this functionality within one phrase, for example, as in processing stage 38 in FIG. 1.
In the illustrated embodiment, DSP 36 manipulates the digital image data in the DSP memory 32 according to a software program permanently stored in a program memory 54 and copied to DSP memory 32 for execution during image capture. DSP 36 executes the software necessary for practicing image processing shown in FIG. 18. DSP memory 32 can be any type of random access memory, such as SDRAM. The bus 30 including a pathway for address and data signals connects DSP 36 to its related DSP memory 32, A/D converter 24 and other related devices.
System controller 50 controls the overall operation of the camera based on a software program stored in program memory 54, which can include Flash EEPROM or other nonvolatile memory. This memory can also be used to store image sensor calibration data, user setting selections and other data which must be preserved when the camera is turned off. System controller 50 controls the sequence of image capture by directing exposure controller 40 to operate the lens 12, ND filter block 13, iris block 14, and shutter 18 as previously described, directing the timing generator 26 to operate the color filter array image sensor 20 and associated elements, and directing DSP 36 to process the captured image data. After an image is captured and processed, the final image file stored in DSP memory 32 is transferred to a host computer via host interface 57, stored on a removable memory card 64 or other storage device, and displayed for the user on an image display 88.
A system controller bus 52 includes a pathway for address, data and control signals, and connects system controller 50 to DSP 36, program memory 54, a system memory 56, host interface 57, a memory card interface 60 and other related devices. Host interface 57 provides a high speed connection to a personal computer (PC) or other host computer for transfer of image data for display, storage, manipulation or printing. This interface can be an IEEE 1394 or USB2.0 serial interface or any other suitable digital interface. Memory card 64 is typically a Compact Flash (CF) card inserted into memory card socket 62 and connected to the system controller 50 via memory card interface 60. Other types of storage that can be utilized include without limitation PC-Cards, MultiMedia Cards (MMC), or Secure Digital (SD) cards.
Processed images are copied to a display buffer in system memory 56 and continuously read out via video encoder 80 to produce a video signal. This signal is output directly from the camera for display on an external monitor, or processed by display controller 82 and presented on image display 88. This display is typically an active matrix color liquid crystal display (LCD), although other types of displays are used as well.
A user interface 68, including all or any combination of a viewfinder display 70, an exposure display 72, a status display 76, the image display 88, and user inputs 74, is controlled by a combination of software programs executed on exposure controller 40 and system controller 50. User inputs 74 typically include some combination of buttons, rocker switches, joysticks, rotary dials or touchscreens. Exposure controller 40 operates light metering, exposure mode, autofocus and other exposure functions. The system controller 50 manages a graphical user interface (GUI) presented on one or more of the displays, e.g., on image display 88. The GUI typically includes menus for making various option selections and review modes for examining captured images.
Exposure controller 40 accepts user inputs selecting exposure mode, lens aperture, exposure time (shutter speed), and exposure index or ISO speed rating and directs the lens 12 and shutter 18 accordingly for subsequent captures. The brightness sensor block 16 is employed to measure the brightness of the scene and provide an exposure meter function for the user to refer to when manually setting the ISO speed rating, aperture and shutter speed. In this case, as the user changes one or more settings, the light meter indicator presented on viewfinder display 70 tells the user to what degree the image will be over or underexposed. In an automatic exposure mode, the user changes one setting and the exposure controller 40 automatically alters another setting to maintain correct exposure, e.g., for a given ISO speed rating when the user reduces the lens aperture, the exposure controller 40 automatically increases the exposure time to maintain the same overall exposure.
The ISO speed rating is an important attribute of a digital still camera. The exposure time, the lens aperture, the lens transmittance, the level and spectral distribution of the scene illumination, and the scene reflectance determine the exposure level of a digital still camera. When an image from a digital still camera is obtained using an insufficient exposure, proper tone reproduction can generally be maintained by increasing the electronic or digital gain, but the resulting image will often contain an unacceptable amount of noise. As the exposure is increased, the gain is decreased, and therefore the image noise can normally be reduced to an acceptable level. If the exposure is increased excessively, the resulting signal in bright areas of the image can exceed the maximum signal level capacity of the image sensor or camera signal processing. This can cause image highlights to be clipped to form a uniformly bright area, or to “bloom” into surrounding areas of the image. Therefore, it is important to guide the user in setting proper exposures. An ISO speed rating is intended to serve as such a guide. In order to be easily understood by photographers, the ISO speed rating for a digital still camera should directly relate to the ISO speed rating for photographic film cameras. For example, if a digital still camera has an ISO speed rating of ISO 200, then the same exposure time and aperture should be appropriate for an ISO 200 rated film/process system.
The ISO speed ratings are intended to harmonize with film ISO speed ratings. However, there are differences between electronic and film-based imaging systems that preclude exact equivalency. Digital still cameras can include variable gain, and can provide digital processing after the image data has been captured, enabling tone reproduction to be achieved over a range of camera exposures. It is therefore possible for digital still cameras to have a range of speed ratings. This range is defined as the ISO speed latitude. To prevent confusion, a single value is designated as the inherent ISO speed rating, with the ISO speed latitude upper and lower limits indicating the speed range, that is, a range including effective speed ratings that differ from the inherent ISO speed rating. With this in mind, the inherent ISO speed is a numerical value calculated from the exposure provided at the focal plane of a digital still camera to produce specified camera output signal characteristics. The inherent speed is typically the exposure index value that produces peak image quality for a given camera system for normal scenes, where the exposure index is a numerical value that is inversely proportional to the exposure provided to the image sensor.
The foregoing description of a digital camera will be familiar to one skilled in the art. It will be obvious that there are many variations of this embodiment that are possible and are selected to reduce the cost, add features or improve the performance of the camera. The following description will disclose in detail the operation of this camera for capturing images according to the present invention. Although this description is with reference to a digital camera, it will be understood that the present invention applies for use with any type of image capture device having an image sensor with color and panchromatic pixels.
The color filter array image sensor 20 shown in FIG. 1 typically includes a two-dimensional array of light sensitive pixels fabricated on a silicon substrate that provide a way of converting incoming light at each pixel into an electrical signal that is measured. As the color filter array image sensor 20 is exposed to light, free electrons are generated and captured within the electronic structure at each pixel. Capturing these free electrons for some period of time and then measuring the number of electrons captured, or measuring the rate at which free electrons are generated can measure the light level at each pixel. In the former case, accumulated charge is shifted out of the array of pixels to a charge-to-voltage measurement circuit as in a charge coupled device (CCD), or the area close to each pixel can contain elements of a charge-to-voltage measurement circuit as in an active pixel sensor (APS or CMOS sensor).
Whenever general reference is made to an image sensor in the following description, it is understood to be representative of the color filter array image sensor 20 from FIG. 1. It is further understood that all examples and their equivalents of image sensor architectures and pixel patterns of the present invention disclosed in this specification is used for color filter array image sensor 20.
In the context of an image sensor, a pixel (a contraction of “picture element”) refers to a discrete light sensing area and charge shifting or charge measurement circuitry associated with the light sensing area. In the context of a digital color image, the term pixel commonly refers to a particular location in the image having associated color values.
FIG. 2 is an example of a minimum repeating unit of a well-known color filter array pattern described by Bayer in U.S. Pat. No. 3,971,065. The minimum repeating unit is repeated over the surface of the color filter array sensor 20 (FIG. 1) thereby producing either a red pixel, green pixel, or blue pixel at each pixel location. The data produced by color filter array sensor 20 (FIG. 1) with the color filter array pattern of FIG. 2 can be used to produce a full-color image in many ways known to those skilled in the art. One example is described by Adams et al. in U.S. Pat. No. 5,506,619.
FIG. 3 is the minimum repeating unit for a preferred embodiment of the present invention. It is a 3×3 square array of pixels with color pixels along one of the diagonals and panchromatic pixels elsewhere. In FIG. 3 the diagonal of color pixels is populated with a red pixel, a green pixel, and a blue pixel. This minimum repeating unit of FIG. 3 is repeated over the surface of the color filter array sensor 20 (FIG. 1) thereby producing either a red pixel, green pixel, blue pixel, or panchromatic pixel at each pixel location.
FIG. 4 shows a minimum repeating unit for an alternate embodiment of the present invention. It is a 4×4 square array of pixels with color pixels along one of the diagonals and panchromatic pixels elsewhere. In FIG. 4 the diagonal of color pixels is populated, in order, with a green pixel, a red pixel, a green pixel, and a blue pixel. This minimum repeating unit of FIG. 4 is repeated over the surface of the color filter array sensor 20 (FIG. 1) thereby producing either a red pixel, green pixel, blue pixel, or panchromatic pixel at each pixel location.
The present invention can be generalized to CFA patterns of other sizes besides the 3×3 and 4×4 CFA patterns shown in FIGS. 3 and 4, respectively. In each case, the pixels will be arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns. The color pixels in the CFA pattern are arranged along one of the diagonals of the minimal repeating unit, and all other pixels are panchromatic pixels.
The color pixels along the diagonal of the minimal repeating pattern can be arranged in various patterns. For the case where there are three types of color pixels and a 3×3 minimal repeating unit is used, such as that shown in FIG. 3, the order of the three colors is arbitrary. For the case of a 4×4 minimal repeating unit, such as that shown in FIG. 4, there will be two pixels of one color and one pixel for each of the other two colors. For the case where the three types of color pixels are red, green and blue, it will generally be desirable to have one red pixel, two green pixels and one blue pixel as shown in FIG. 4. In the preferred 4×4 minimal repeating pattern shown in FIG. 4, the green pixels are separated alternately by red and blue pixels.
In the preferred 4×4 minimal repeating unit shown in FIG. 4, there are no panchromatic pixels along the diagonal of the minimal repeating unit. In an alternate configuration, there is one red pixel, one green pixel, one blue pixel and one panchromatic pixel along the diagonal of the minimal repeating unit.
In general, it will be desirable to arrange the positions of the color pixels along the diagonal so as to minimize the maximum distance between color pixels of the same color along the diagonal of the CFA pattern. For example, in FIG. 4, the maximum distance between the green pixels is two pixels (in the diagonal direction). This arrangement would generally be preferred to configurations where the two green pixels are next to each other, which would result in the maximum distance between the green pixels being three pixels.
The color pixels in the example CFA patterns shown in FIGS. 3 and 4 are red, green and blue. It will be understood by one skilled in the art that other types of color pixels can also be used in accordance with the present invention. For example, in an alternate embodiment of the present invention the color pixels can be cyan, magenta and yellow. In another embodiment of the present invention the color pixels can be cyan, yellow and green. In yet another embodiment of the present invention the color pixels can be cyan, magenta, yellow and green. Many other types and combinations of color pixels can also be used.
FIG. 5 is a high level diagram of an algorithm for producing a full-color output image from the data produced from minimum repeating units such as those shown in FIG. 3 or FIG. 4 according to a preferred embodiment of the present invention. The image sensor 20 (FIG. 1) produces a color filter array image 100. In the color filter array image 100 each pixel location is either a red, green, blue, or panchromatic pixel as determined by the minimum repeating units such as those shown in FIG. 3 or FIG. 4. An interpolate panchromatic image block 102 produces an interpolated panchromatic image 104 from the color filter array image 100. A generate color differences block 108 produces color difference values 110 from the color filter array image 100 and the interpolated panchromatic image 104. An interpolate color difference image block 112 produces an interpolated color difference image 114 from the color difference values 110. A generate interpolated color image block 106 produces an interpolated color image 120 from the interpolated panchromatic image 104 and the interpolated color difference image 114. Finally, a fuse images block 118 produces a full-color output image 116 from the interpolated panchromatic image 104 and the interpolated color image 120.
FIG. 6 is a detailed diagram of a pixel neighborhood used in the interpolate panchromatic image block 104 (FIG. 5) for the CFA pattern shown in FIG. 3. In FIG. 6, C1, C4, C7, CA, and CD refers to color pixel values of the same color values from the color filter array image 100 (FIG. 5). In FIG. 6, there are two adjacent panchromatic pixel values above, below, to the left, and to the right of C7. In order to produce the interpolated panchromatic value P′7 the following computations are performed.



  
    h
    =
    
      
        
        
          
            P
            6
          
          -
          
            P
            5
          
        
        
      
      +
      
        
        
          
            P
            8
          
          -
          
            P
            6
          
        
        
      
      +
      
        
        
          
            P
            9
          
          -
          
            P
            8
          
        
        
      
      +
      
        α
        ⁢
        
          
          
            
              C
              4
            
            -
            
              2
              ⁢
              
                C
                7
              
            
            +
            
              C
              A
            
          
          
        
      
    
  




  
    v
    =
    
      
        
        
          
            P
            3
          
          -
          
            P
            2
          
        
        
      
      +
      
        
        
          
            P
            B
          
          -
          
            P
            3
          
        
        
      
      +
      
        
        
          
            P
            C
          
          -
          
            P
            B
          
        
        
      
      +
      
        α
        ⁢
        
          
          
            
              C
              1
            
            -
            
              2
              ⁢
              
                C
                7
              
            
            +
            
              C
              D
            
          
          
        
      
    
  




  
    H
    =
    
      
        
          
            -
            
              P
              5
            
          
          +
          
            4
            ⁢
            
              P
              6
            
          
          +
          
            4
            ⁢
            
              P
              8
            
          
          -
          
            P
            9
          
        
        6
      
      +
      
        α
        ⁢
        
          
            
              -
              
                C
                4
              
            
            +
            
              2
              ⁢
              
                C
                7
              
            
            -
            
              C
              A
            
          
          9
        
      
    
  




  
    V
    =
    
      
        
          
            -
            
              P
              2
            
          
          +
          
            4
            ⁢
            
              P
              3
            
          
          +
          
            4
            ⁢
            
              P
              B
            
          
          -
          
            P
            C
          
        
        6
      
      +
      
        α
        ⁢
        
          
            
              -
              
                C
                1
              
            
            +
            
              2
              ⁢
              
                C
                7
              
            
            -
            
              C
              D
            
          
          9
        
      
    
  




  
    
      P
      7
      ′
    
    =
    
      
        
          h
          
            h
            +
            v
          
        
        ⁢
        V
      
      +
      
        
          v
          
            h
            +
            v
          
        
        ⁢
        H
      
    
  



The value of α in the preferred embodiment of this invention is zero. In an alternate embodiment of this invention, the value of α is one. It will be obvious to one skilled in the art that other values of α can also be used. Changing the value of α has the effect of controlling how much the color pixel values are weighted in the process of determining the interpolated panchromatic value P′7. These computations are repeated by the interpolate panchromatic image block 104 (FIG. 5) at each color pixel location in the color filter array image 100 (FIG. 5) to produce the corresponding interpolated panchromatic values P′7. The interpolated panchromatic values combined with the original panchromatic values (P2, P3, P5, P6, P8, P9, PB, and PC in FIG. 6) produce the interpolated panchromatic image 104 (FIG. 5). The details of the interpolate panchromatic image block 104 (FIG. 5) for the preferred embodiment of FIG. 3 can be generalized to apply to the alternate embodiment of FIG. 4. In FIG. 4, each color pixel is separated by three panchromatic pixels to the left, to the right, above, and below. The interpolate panchromatic image block 104 (FIG. 5) can be adjusted to accommodate this different color pixel spacing. The two closest panchromatic pixels in each of the four directions can be used along with the color pixels three pixels away from the center color pixel to produce a pixel neighborhood as in FIG. 6. At that point the interpolate panchromatic image block 104 (FIG. 5) can be applied as previously described.

FIG. 7 is a detailed diagram of a pixel neighborhood used in the interpolate color difference image block 112 (FIG. 5) for the preferred embodiment of the CFA pattern shown in FIG. 3. In FIG. 7, D0, D3, DC, and DF are color difference values 110 (FIG. 5) produced by the generate color differences block 108 (FIG. 5) for a given color (e.g., red, green, or blue). As an example, the interpolation of red color differences is now described. The locations of D0, D3, DC, and DF correspond to red pixels in the color filter array image 100 (FIG. 5). The values of D0, D3, DC, and DF are computed as given below.

D0=R0−P′0 

D3=R3−P′3 

DC=RC−P′C 

DF=RF−P′F 

In these computations R refers to the original red pixel value from the color filter array image 100 (FIG. 5) and P′ refers to the corresponding interpolated panchromatic value from the interpolated panchromatic image 104 (FIG. 5). The subscripts correspond to the pixel positions shown in FIG. 7. The interpolate color difference image block 112 (FIG. 5) produces interpolated color difference values D′ at the pixel locations in FIG. 7 without an existing color difference value D. Standard bilinear interpolation of the color difference values D0, D3, DC, and DF produces the interpolated color difference values D′. The following equations show the explicit computations that can be used to determine the interpolated color difference values D′:

D′1=(2D0+D3)/3

D′2=(D0+2D3)/3

D′4=(2D0+DC)/3

D′5=(4D0+2D3+2DC+DF)/9

D′6=(2D0+4D3+DC+2DF)/9

D′7=(2D3+DF)/3

D′8=(D0+2DC)/3

D′9=(2D0+D3+4DC+2DF)/9

D′A=(D0+2D3+2DC+4DF)/9

D′B=(D3+2DF)/3

D′D=(2DC+DF)/3

D′E=(DC+2DF)/3

The interpolated color difference values combined with the color values (D0, D3, DC, and DF) make up the interpolated color difference image 114 (FIG. 5).

The generate interpolated color image block 106 (FIG. 5) produces interpolated color values R′ from the interpolated color difference values D′ and the corresponding panchromatic value, either original or interpolated. Again referring to FIG. 7, the following computations are performed.

R′1=D′1+P1 

R′2=D′2+P2 

R′4=D′4+P4 

R′5=D′5+P′5 

R′6=D′6+P6 

R′7=D′7+P7 

R′8=D′8+P8 

R′9=D′9+P9 

R′A=D′A+P′A 

R′B=D′B+PB 

R′D=D′D+PD 

R′E=D′E+PE 

The original color values R together with the interpolated color values R′ produce the red values of the interpolated color image 120 (FIG. 5). The preceding set of operations is repeated for the green and blue pixel values to complete the production of the interpolated color image 120 (FIG. 5).

FIG. 8 is a detailed diagram of a pixel neighborhood used in the interpolate color difference image block 112 (FIG. 5) for the CFA pattern shown in the alternate embodiment of FIG. 4. In FIG. 8, D0, D4, D8, and DC are green color difference values 110 (FIG. 5) produced by the generate color differences block 108 (FIG. 5). The locations of D0, D4, D8, and DC correspond to green pixels in the color filter array image 100 (FIG. 5). The values of D0, D4, D8, and DC are computed as follows:

D0=G0−P′0 

D4=G4−P′4 

D8=G8−P′8 

DC=GC−P′C 

In these computations G refers to the original green pixel value from the color filter array image 100 (FIG. 5) and P′ refers to the corresponding interpolated panchromatic value from the interpolated panchromatic image 104 (FIG. 5). Returning to FIG. 8, the interpolate color difference image block 112 (FIG. 5) produces interpolated color difference values D′ at the pixel locations without an existing color difference value D. Standard bilinear interpolation of the color difference values D0, D4, D8, and DC produces the interpolated color difference values D′ according to the following explicit computations:

D′1=(D0+D4)/2

D′2=(9D0+3D4+3D8+DC)/16

D′3=(D0+D8)/2

D′5=(3D0+9D4+D8+3DC)/16

D′6=(D0+D4+D8+DC)/4

D′7=(3D0+D4+9D8+3DC)/16

D′9=(D4+DC)/2

D′A=(D0+3D4+3D8+9DC)/16

D′B=(D8+DC)/2

The interpolated color difference values together with the color values (D0, D4, D8, and DC) make up the interpolated color difference image 114 (FIG. 5). The generate interpolated color image block 106 (FIG. 5) produces interpolated color values G′ from the interpolated color difference values D′ and the corresponding panchromatic value, either original or interpolated. Again referring to FIG. 8, the following computations are performed:

G′1=D′1+P1 

G′2=D′2+P2 

G′3=D′3+P′3 

G′5=D′5+P5 

G′6=D′6+P6 

G′7=D′7+P7 

G′9=D′9+P′9 

G′A=D′A+PA 

G′B=D′B+PB 

The original color values G and the interpolated color values G′ make up the green values of the interpolated color image 120 (FIG. 5).

FIG. 9 is a detailed diagram of a pixel neighborhood used to interpolate the red and blue color difference values in the interpolate color difference image block 112 (FIG. 5) for the alternate CFA pattern embodiment of FIG. 4. In FIG. 8, D0, D4, DK, and DP are the red or blue color difference values 110 (FIG. 5) produced by the generate color differences block 108 (FIG. 5). The locations of D0, D4, DK, and DP correspond to either red or blue pixels in the color filter array image 100 (FIG. 5). As an example, the interpolation of red color differences is now described. The values of D0, D4, DK, and DP are computed as follows:

D0=R0=P′0 

D4=R4−P′4 

DK=RK−P′K 

DP=RP−P′P 

In these computations R refers to the original red pixel value from the color filter array image 100 (FIG. 5) and P′ refers to the corresponding interpolated panchromatic value from the interpolated panchromatic image 104 (FIG. 5).

Returning to FIG. 9, the interpolate color difference image block 112 (FIG. 5) produces interpolated color difference values D′ at the pixel locations without an existing color difference value D. Standard bilinear interpolation of the color difference values D0, D4, DK, and DP produces the interpolated color difference values D′. The explicit computations are as follows:

D′1=(3D0+D4)/4

D′2=(D0+D4)/2

D′3=(D0+3D4)/4

D′5=(3D0+DK)/4

D′6=(9D0+3D4+3DK+DP)/16

D′7(3D0+3D4+DK+DP)/8

D′8=(3D0+9D4+DK+3DP)/16

D′9=(3D4+DP)/4

D′A=(D0+DK)/2

D′B=(3D0+D4+3DK+DP)/8

D′C=(D0+D4+DK+DP)4

D′D=(D0+3D4+DK+3DP)/8

D′E=(D4+DP)/2

D′F=(D0+3DK)/4

D′G=(3D0+D4+9DK+3DP)/16

D′H=(D0+D4+3DK+3DP)/8

D′I=(D0+3D4+3DK+9DP)/16

D′J=(D4+3DP)/4

D′L=(3DK+DP)/4

D′M=(DK+DP)/2

D′N=(DK+3DP)/4

The interpolated color difference values together with the color values (D0, D4, DK, and DP) make up the interpolated color difference image 114 (FIG. 5).

The generate interpolated color image block 106 (FIG. 5) produces interpolated color values R′ from the interpolated color difference values D′ and the corresponding panchromatic value, either original or interpolated. Again referring to FIG. 9, the following computations are performed:

R′1=D′1+P1 

R′2=D′2+P2 

R′3=D′3+P3 

R′5=D′5+P5 

R′6=D′6+P′6 

R′7=D′7+P7 

R′8=D′8+P8 

R′9=D′9+P9 

R′A=D′A+PA 

R′B=D′B+PB 

R′C=D′C+P′C 

R′D=D′D+PD 

R′E=D′E+PE 

R′F=D′F+PF 

R′G=D′G+PG 

R′H=D′H+PH 

R′I=D′I+P′I 

R′J=D′J+PJ 

R′L=D′L+PL 

R′M=D′M+PM 

R′N=D′N+PN 

The original color values K together with the interpolated color values R′ make up the red values of the interpolated color image 120 (FIG. 5). The preceding set of operations is repeated for the blue pixel values to complete the production of the interpolated color image 120 (FIG. 5).

FIG. 10 is a block diagram of a preferred embodiment of the fuse images block 118 (FIG. 5). A low-pass filter block 204 produces a low frequency color image 206 from the interpolated color image 120 (FIG. 5). A high-pass filter block 200 produces a high frequency panchromatic image 202 from the interpolated panchromatic image 104 (FIG. 5). Finally, a merge images block 208 produces the full-color output image 116 (FIG. 5) by combining the low frequency color image 206 and the high frequency panchromatic image 202.
The low-pass filter block 204 performs a convolution of the interpolated color image 120 (FIG. 5) using a low-pass filter. In a preferred embodiment of the present invention, the following convolution kernel is used:




  g
  =
  
    
      1
      16
    
    ⁢
    
      (
      
        
          
            1
          
          
            2
          
          
            1
          
        
        
          
            2
          
          
            4
          
          
            2
          
        
        
          
            1
          
          
            2
          
          
            1
          
        
      
      )
    
  




Mathematically, CL=C*g, where C is the interpolated color image 120 (FIG. 5), CL is the low frequency color image 206 and “*” represents the convolution operator. It will be clear to one skilled in the art that other convolution kernels can be used in accordance with the present invention.

The high-pass filter block 200 performs a convolution of the interpolated panchromatic image 104 (FIG. 5) using a high-pass filter. In a preferred embodiment of the present invention, the following convolution kernel is used:




  h
  =
  
    
      1
      16
    
    ⁢
    
      (
      
        
          
            
              -
              1
            
          
          
            
              -
              2
            
          
          
            
              -
              1
            
          
        
        
          
            
              -
              2
            
          
          
            12
          
          
            
              -
              2
            
          
        
        
          
            
              -
              1
            
          
          
            
              -
              2
            
          
          
            
              -
              1
            
          
        
      
      )
    
  




Mathematically, PH=P*h, where P is the interpolated panchromatic image 104 (FIG. 5) and PH is the high frequency panchromatic image 202. It will be clear to one skilled in the art that other convolution kernels can be used in accordance with the present invention.

The merge images block 208 combines the high frequency panchromatic image 202 and the low frequency color image 206 together to produce the full-color output image 116 (FIG. 5). In a preferred embodiment of the present invention, this is accomplished by simply adding the high frequency panchromatic image 202 and the low frequency color image 206. Mathematically, C′=CL+PH, where C′ is the full-color output image 116 (FIG. 5) and the other terms are as previously defined.
FIG. 11 is a block diagram of an alternate embodiment of the fuse images block 118 (FIG. 5). A pyramid decomposition block 300 produces a panchromatic image pyramid 302 from the interpolated panchromatic image 104 (FIG. 5). A pyramid decomposition block 304 produces a color image pyramid 306 from the interpolated color image 120 (FIG. 5). A merged pyramid reconstruction block 308 produces the full-color output image 116 (FIG. 5) by combining the panchromatic image pyramid 302 and the color image pyramid 306. The pyramid decomposition block 300 produces a standard Gaussian-Laplacian image pyramid by a method that will be known to one skilled in the art. Briefly, the following computations are performed.




  
    
      
        
          P
          1
        
        =
        
          
            (
            
              
                P
                0
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          Q
          1
        
        =
        
          
            P
            0
          
          -
          
            (
            
              
                P
                1
              
              ↑
              2
            
            )
          
        
      
    
  
  
    
      
        
          P
          2
        
        =
        
          
            (
            
              
                P
                1
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          Q
          2
        
        =
        
          
            P
            1
          
          -
          
            (
            
              
                P
                2
              
              ↑
              2
            
            )
          
        
      
    
  
  
    
      ⋮
    
    
      ⋮
    
  
  
    
      
        
          P
          N
        
        =
        
          
            (
            
              
                P
                
                  N
                  -
                  1
                
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          Q
          N
        
        =
        
          
            P
            
              N
              -
              1
            
          
          -
          
            (
            
              
                P
                N
              
              ↑
              2
            
            )
          
        
      
    
  




P0 is the interpolated panchromatic image 104 (FIG. 5). P0 is convolved with the low-pass filter convolution kernel g, which has been described previously. The result of the convolution operation is subsampled by a factor of 2 both horizontally and vertically (↓2). The result of the subsampling is P1, the first level component of the corresponding Gaussian pyramid of the panchromatic image pyramid 302. This process in continued to produce P2 through PN where N is the desired number of pyramid levels. In one embodiment of the present invention N=4.

Q1 is the first level component of the corresponding Laplacian pyramid of the panchromatic image pyramid 302. It is computed by taking the first level component of the Gaussian pyramid, P1, and upsampling it by a factor of 2 both horizontally and vertically (↑2) and then subtracting the result from the interpolated panchromatic image 104 (FIG. 5). The upsampling operation can be performed in any manner known to those skilled in the art. In one embodiment of the present invention, the upsampling is performed using well-known bilinear interpolation. This process is continued to produce Q2 through QN. The pyramid components {P1, . . . , PN, Q1, . . . , QN} taken together make up the pyramid image pyramid 302.
The pyramid decomposition block 304 is performed in the same manner as the pyramid decomposition block 300 except that each color of the interpolated color image 120 (FIG. 5) is processed separately to produce red, green, and blue pyramids that, taken together, make up the color image pyramid 306. To establish notation, the computations performed by the pyramid decomposition block 304 are as follows:




  
    
      
        
          C
          1
        
        =
        
          
            (
            
              
                C
                0
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          H
          1
        
        =
        
          
            C
            0
          
          -
          
            (
            
              
                C
                1
              
              ↑
              2
            
            )
          
        
      
    
  
  
    
      
        
          C
          2
        
        =
        
          
            (
            
              
                C
                1
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          H
          2
        
        =
        
          
            C
            1
          
          -
          
            (
            
              
                C
                2
              
              ↑
              2
            
            )
          
        
      
    
  
  
    
      ⋮
    
    
      ⋮
    
  
  
    
      
        
          C
          N
        
        =
        
          
            (
            
              
                C
                
                  N
                  -
                  1
                
              
              *
              g
            
            )
          
          ↓
          2
        
      
    
    
      
        
          H
          N
        
        =
        
          
            C
            
              N
              -
              1
            
          
          -
          
            (
            
              
                C
                N
              
              ↑
              2
            
            )
          
        
      
    
  




Pyramid components {C1, . . . , CN} together make up the color Gaussian pyramid and pyramid components {H1, . . . , HN} together make up the color Laplacian pyramid.

The merged pyramid reconstruction block 308 performs the following computations which are a modification of the standard Gaussian-Laplacian pyramid reconstruction that will be known to those skilled in the art:




  {
  
    
      
        
          
            
              C
              
                N
                -
                1
              
              ′
            
            =
            
              
                (
                
                  
                    C
                    N
                  
                  ↑
                  2
                
                )
              
              +
              
                H
                N
              
            
          
        
      
      
        
          
            
              P
              
                N
                -
                1
              
              ′
            
            =
            
              
                (
                
                  
                    P
                    N
                  
                  ↑
                  2
                
                )
              
              +
              
                Q
                N
              
            
          
        
      
      
        
          
            
              C
              
                N
                -
                1
              
              ′′
            
            =
            
              
                
                  P
                  
                    N
                    -
                    1
                  
                  ′
                
                *
                h
              
              +
              
                
                  C
                  
                    N
                    -
                    1
                  
                  ′
                
                *
                g
              
            
          
        
      
    
    ⁢
    
      

    
    ⁢
    
      {
      
        
          
            
              
                
                  C
                  
                    N
                    -
                    2
                  
                  ′
                
                =
                
                  
                    (
                    
                      
                        C
                        
                          N
                          -
                          1
                        
                        ′′
                      
                      ↑
                      2
                    
                    )
                  
                  +
                  
                    H
                    
                      N
                      -
                      1
                    
                  
                
              
            
          
          
            
              
                
                  P
                  
                    N
                    -
                    2
                  
                  ′
                
                =
                
                  
                    (
                    
                      
                        P
                        
                          N
                          -
                          1
                        
                        ′
                      
                      ↑
                      2
                    
                    )
                  
                  +
                  
                    Q
                    
                      N
                      -
                      1
                    
                  
                
              
            
          
          
            
              
                
                  C
                  
                    N
                    -
                    2
                  
                  ′′
                
                =
                
                  
                    
                      P
                      
                        N
                        -
                        2
                      
                      ′
                    
                    *
                    h
                  
                  +
                  
                    
                      C
                      
                        N
                        -
                        2
                      
                      ′
                    
                    *
                    g
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        ⋮
        ⁢
        
          

        
        ⁢
        
          {
          
            
              
                
                  
                    C
                    0
                    ′
                  
                  =
                  
                    
                      (
                      
                        
                          C
                          1
                          ′′
                        
                        ↑
                        2
                      
                      )
                    
                    +
                    
                      H
                      1
                    
                  
                
              
            
            
              
                
                  
                    P
                    0
                    ′
                  
                  =
                  
                    
                      (
                      
                        
                          P
                          1
                          ′
                        
                        ↑
                        2
                      
                      )
                    
                    +
                    
                      Q
                      1
                    
                  
                
              
            
            
              
                
                  
                    C
                    0
                    ′′
                  
                  =
                  
                    
                      
                        P
                        0
                        ′
                      
                      *
                      h
                    
                    +
                    
                      
                        C
                        0
                        ′
                      
                      *
                      g
                    
                  
                
              
            
          
        
      
    
  




In each set of three computations, a Gaussian color pyramid component, C, or a merged Gaussian color pyramid component, C′′, is upsampled by a factor of 2 and added to a Laplacian color pyramid component, H. Then a Gaussian panchromatic pyramid component, P or P′, is upsampled by 2 and added to a Laplacian panchromatic pyramid component, Q. The resulting Gaussian color pyramid component, C′, is convolved with the previously described low pass convolution kernel g, the resulting Gaussian panchromatic pyramid component, P′, is convolved with the previously described high pass convolution kernel h, and the results added together to produce the merged Gaussian color pyramid component C′′. These computations are repeated until the full-color output image 116 (FIG. 5), C′′0, is produced.

The algorithm for computing the full-color output image as disclosed in the preferred embodiment of the present invention can be employed in a variety of user contexts and environments. Exemplary contexts and environments include, without limitation, in-camera processing (reading sensor image, digital processing, saving processed image on digital media), wholesale digital photofinishing (which involves exemplary process steps or stages such as submitting digital images for wholesale fulfillment digital processing, and digital printing), retail digital photofinishing (submitting digital images for retail fulfillment, digital processing, and digital printing), home printing (inputting home digital images, digital processing, and printing on a home printer), desktop software (software that applies algorithms to digital images to make them better—or even just to change them), digital fulfillment (inputting digital images—from media or over the web, digital processing, outputting digital images—on media, digital form over the internet), kiosks (inputting digital images, digital processing, digital printing or outputting digital media), mobile devices (e.g., PDA or cell phone that can be used as a processing unit, a display unit, or a unit to give processing instructions), and as a service offered via the World Wide Web.
In each case, the algorithm for computing the full-color output image can stand alone or can be a component of a larger system solution. Furthermore, the interfaces with the algorithm (e.g., the input, the digital processing, the display to a user (if needed), the input of user requests or processing instructions (if needed), and the output) can each be on the same or different devices and physical locations, and communication between the devices and locations can be via public or private network connections, or media based communication. Where consistent with the foregoing disclosure of the present invention, the algorithms themselves can be fully automatic, can have user input (i.e., they can be fully or partially manual), can have user or operator review to accept/reject the result, or can be assisted by metadata (metadata can be user supplied, supplied by a measuring device (e.g. in a camera) or determined by an algorithm). Moreover, the algorithms can interface with a variety of workflow user interface schemes.
The computation of the full-color output image algorithm disclosed herein in accordance with the invention can have interior components that utilize various data detection and reduction techniques (e.g., face detection, eye detection, skin detection, flash detection).
The invention has been described in detail with particular reference to certain preferred embodiments thereof, but it will be understood that variations and modifications can be effected within the spirit and scope of the invention.
PARTS LIST


    10 light from subject scene
    11 imaging stage
    12 lens
    13 neutral density (ND) filter block
    14 iris block
    16 brightness sensor block
    18 shutter
    20 color filter array image sensor
    22 analog signal processor
    24 analog-to-digital (A/D) converter
    26 timing generator
    28 image sensor stage
    30 bus
    32 digital signal processor (DSP) memory
    36 digital signal processor (DSP)
    38 processing stage
    40 exposure controller
    50 system controller
    52 system controller bus
    54 program memory
    56 system memory
    57 host interface
    60 memory card interface
    62 memory card socket
    64 memory card
    68 user interface
    70 viewfinder display
    72 exposure display
    74 user inputs
    76 status display
    80 video encoder
    82 display controller
    88 image display
    100 color filter array image
    102 interpolate panchromatic image block
    104 interpolated panchromatic image
    106 generate interpolated color image block
    108 generate color differences block
    110 color difference values
    112 interpolate color difference image block
    114 interpolated color difference image
    116 fall-color output image
    118 fuse images block
    120 interpolated color image
    200 high-pass filter block
    202 high frequency panchromatic image
    204 low-pass filter block
    206 low frequency color image
    208 merge images block
    300 pyramid decomposition block
    302 panchromatic image pyramid
    304 pyramid decomposition block
    306 color image pyramid
    308 merged pyramid reconstruction block

## Claims

1. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image, wherein step d) further includes:
i) applying a high-pass filter to the interpolated panchromatic image to form a high frequency panchromatic image,
ii) applying a low-pass filter to the interpolated color image to form a low frequency color image, and
iii) merging the high frequency panchromatic image and the low frequency color image to form the full color output image.

2. The method of claim 1 wherein step c) further includes using the interpolated panchromatic image in the process of computing the interpolated color image.

3. The method of claim 2 wherein the process of computing the interpolated color image includes forming an interpolated color difference image using color difference values formed from the interpolated panchromatic image and the color filter array image.

4. The method of claim 1 wherein the positions of the color pixels along the diagonal are arranged to minimize the maximum distance between color pixels of the same color.

5. The method of claim 1 wherein there are no panchromatic pixels on the diagonal of the minimal repeating unit that includes color pixels.

6. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image, wherein step d) further includes:
i) performing a pyramid decomposition to the interpolated panchromatic image to form a panchromatic image pyramid,
ii) performing a pyramid decomposition to the interpolated color image to form a color image pyramid,
iii) merging the panchromatic image pyramid and the color image pyramid to form the output image pyramid, and
iv) forming the full color output image from the output image pyramid.

7. The method of claim 6 wherein step iii) includes applying a high-pass filter to each level of the panchromatic image pyramid to form a high frequency panchromatic image pyramid, applying a low-pass filter to each level of the color image pyramid to form a low frequency color image pyramid and merging each level of the high frequency panchromatic image pyramid and the low frequency color image pyramid to form the output image pyramid.

8. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels, wherein the color pixels are red, green and blue pixels;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image.

9. The method of claim 8 wherein step c) further includes using the interpolated panchromatic image in the process of computing the interpolated color image.

10. The method of claim 9 wherein the process of computing the interpolated color image includes forming an interpolated color difference image using color difference values formed from the interpolated panchromatic image and the color filter array image.

11. The method of claim 8 wherein the positions of the color pixels along the diagonal are arranged to minimize the maximum distance between color pixels of the same color.

12. The method of claim 8 wherein there are no panchromatic pixels on the diagonal of the minimal repeating unit that includes color pixels.

13. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels, wherein the color pixels are cyan, magenta and yellow pixels;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image.

14. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels, wherein the minimal repeating unit has three rows and three columns, and wherein one of the diagonals of the minimal repeating unit has one red pixel, one green pixel and one blue pixel;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image.

15. The method of claim 14 wherein step c) further includes using the interpolated panchromatic image in the process of computing the interpolated color image.

16. The method of claim 15 wherein the process of computing the interpolated color image includes forming an interpolated color difference image using color difference values formed from the interpolated panchromatic image and the color filter array image.

17. The method of claim 14 wherein the positions of the color pixels along the diagonal are arranged to minimize the maximum distance between color pixels of the same color.

18. The method of claim 14 wherein there are no panchromatic pixels on the diagonal of the minimal repeating unit that includes color pixels.

19. A method of forming a full-color output image from a color filter array image having a plurality of color pixels having at least two different color responses and panchromatic pixels, comprising one or more processors for providing the following:
a) capturing a color filter array image using an image sensor comprising a two dimensional array of light-sensitive pixels including panchromatic pixels and color pixels having at least two different color responses, the pixels being arranged in a repeating pattern having a square minimal repeating unit having at least three rows and three columns, the color pixels being arranged along one of the diagonals of the minimal repeating unit, and all other pixels within the minimal repeating unit being panchromatic pixels, wherein the minimal repeating unit has four rows and four columns, and wherein one of the diagonals of the minimal repeating unit has one red pixel, two green pixels and one blue pixel;
b) computing an interpolated panchromatic image from the color filter array image;
c) computing an interpolated color image from the color filter array image; and
d) forming the full color output image from the interpolated panchromatic image and the interpolated color image.

20. The method of claim 19 wherein the two green pixels are separated by either a red pixel or a blue pixel.

21. The method of claim 19 wherein step c) further includes using the interpolated panchromatic image in the process of computing the interpolated color image.

22. The method of claim 21 wherein the process of computing the interpolated color image includes forming an interpolated color difference image using color difference values formed from the interpolated panchromatic image and the color filter array image.

23. The method of claim 19 wherein the positions of the color pixels along the diagonal are arranged to minimize the maximum distance between color pixels of the same color.

24. The method of claim 19 wherein there are no panchromatic pixels on the diagonal of the minimal repeating unit that includes color pixels.