# Patent

## Title
Method for creating high resolution color image, system for creating high resolution color image and program creating high resolution color image

## Abstract

A limitation in the physical resolution of an image sensor offers a motivation to improve the resolution of an image. Super-resolution is mainly applied to gray scale images, and it has not been thoroughly investigated yet that a high resolution color image is reconstructed from an image sensor having a color filter array. An object of the invention is to directly reconstruct a high resolution color image from color mosaic obtained by an image sensor having a color filter array. A high resolution color image reconstruction method according to the invention is based on novel technique principles of color image reconstruction that an increase in resolution and demosaicing are performed at the same time. The verification and effective implement of the invention are also described.

## Background
TECHNICAL FIELD
The present invention relates to a image reconstruction method, a image reconstruction apparatus and a image reconstruction program, particularly to a high resolution color image reconstruction method, a high resolution color image reconstruction apparatus and a high resolution color image reconstruction program for reconstructing a high resolution color image from a single-chip CCD array.
BACKGROUND TECHNIQUE
In a single-chip color camera, each pixel of a CCD is covered with color filter. Red, Green, and Blue are typical colors used for color filter. The color filters are arranged in a mosaic pattern, and only one primary color is captured for every pixel. The mosaic pattern is referred to as a CFA (“CFA” means Color Filter Array) pattern. Therefore, data obtained through a CFA is an image in color mosaic, and it is imperfect as a full color image.
In order to produce a full color image, missing color channels need to be estimated from raw data of color mosaic. Generally, this color reconstruction process is referred to as demosaicing. The simplest demosaicing method is linear interpolation applied to every color channel. More sophisticated demosaicing methods (see Reference Literatures [1] and [2]) have also been reported, which have the accuracy of image reconstruction higher than that of linear interpolation.
Generally, the major problem in demosaicing is false colors that occur in the resulting color image. Although an image is filtered through an optical low-pass filter to reduce false color, it results in causing a problem that band limitation is interposed. Particularly, when an image is magnified for display on a high resolution screen, a problem arises that the degradation of image quality caused by band limitation is noticeable.
The resolution of a color image reconstructed by the demosaicing method is equal to the physical resolution of a CCD. For example, in the case of display, printing, post-processing, etc., a much higher resolution is required. Interpolation is a traditional solving method for such demands.
However, when compared with an image obtained by a CCD having higher resolution, interpolation results in a low quality image. This is caused that the interpolation process does not substantially add information. Interpolation has a problem that it cannot reconstruct the detail of the image. In other words, interpolation cannot reconstruct high frequency signals.
Super-resolution (see Reference Literatures [3] to [5]) is a method different from interpolation, and super-resolution can detailedly reconstruct high frequencies contained in a captured scene. Super-resolution is an image processing technique that combines a high resolution image from multiple low resolution images. Among various methods for super-resolution in literatures, a frequency domain method that had proposed by Tsay and Huang first proposed a theory of super-resolution (see Reference Literature [3]). Peleg et al. proposed a spatial domain method based on a recursive back projection method (see Reference Literature [4]). First, image capturing process of a high resolution image is simulated to generate a measurement value, and simulation error is used for updating temporary image estimation error.
Up to now, super-resolution has been applied for gray scale images or full color images, but it has not been yet applied to raw data obtained by a single-chip CCD. Although demosaicing and super-resolution are sequentially executed to obtain a high resolution color image, such methods cause damage because of false color and blur effect seen in a demosaiced image. Since data available for a user is a demosaiced (and also compressed) image, such damage is often seen when a consumer camera is used.
The invention has been made in view of the circumstances described above. An object of the invention is to provide a high resolution color image reconstruction method, a high resolution color image reconstruction apparatus, and a high resolution color image reconstruction program, which can overcome the limitation described above, and directly use a raw color mosaic image captured by a CFA-masked CCD to reconstruct a high resolution color image from a single-chip CCD array.
The invention is characterized by a single step process for offering a spatial resolution higher than the physical resolution of a CCD. Accordingly, the invention allows an effective integration of demosaicing and an increase in resolution.
DISCLOSURE OF THE INVENTION
A high resolution color image reconstruction method according to the invention is a high resolution color image reconstruction method which reconstructs a high resolution color image based on a single input image or a sequence of multiple input images captured by an image capturing device employing an image sensor and a color filter array, said high resolution color image reconstruction method comprising the steps of: reconstructing said high resolution color image having a predetermined resolution equal to or larger than a physical resolution of said image capturing device, and conducting known or unknown geometric transformation between said sequence of multiple input images; and reconstructing said high resolution color image in which even a high spatial frequency component contained in said subject is truly reproduced and occurrence of false color is suppressed by conducting an optimization process of an evaluation function.
Furthermore, said evaluation function according to the invention is comprised of: a first term which evaluates fidelity of said high resolution color image being an estimated image with respect to said input images by using an image formation model expressing generation of said high resolution color image from said input images; a second term which evaluates smoothness in said estimated image by penalizing said estimated image within which neighboring pixel values change abruptly in said input images; and a third term which evaluates smoothness of chrominance of said estimated image by penalizing said estimated image within which chrominance components change abruptly in said input images. Said second term serves to obtain a smooth estimated image with preserved edges; and said third term serves to obtain a smooth estimated image with local chrominance continuity and preserved edges. Alternatively, it further comprises the step of estimating geometrical transform between said input images at the same time as said high resolution color image. Therefore, the invention is effectively achieved.
Moreover, a high resolution color image reconstruction apparatus according to the invention is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to the invention. Therefore, the invention is achieved.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram illustrating an exemplary flow of a signal process used in the invention;
FIG. 2 is a flow chart illustrating an overall process of the invention;
FIG. 3 is a flow chart illustrating steepest-descent method used in a recursive minimization process of an objective function shown in FIG. 2;
FIG. 4 is an illustrative diagram of R component (a solid line), G component (a broken line), and B component (a dotted line) of an edge model;
FIG. 5 is a diagram illustrating property of an energy function relating to chrominance;
FIG. 6 is a block diagram of an image capturing device using an image processing method according to the invention;
FIG. 7 is a detailed diagram of signal processor shown in FIG. 6;
FIG. 8 is a diagram illustrating images used in experiment in the invention;
FIG. 9 is a diagram illustrating images reconstructed by the invention;
FIG. 10 is a diagram illustrating images reconstructed by traditional method;
FIG. 11 is a diagram illustrating relationship between RMS error and number of input images;
FIG. 12 is a diagram illustrating a reference image used in experiment;
FIG. 13 is a diagram illustrating a simulated input image used in experiment;
FIG. 14 is a diagram illustrating an image reconstructed by linear interpolation;
FIG. 15 is a diagram illustrating an image reconstructed by traditional demosaicing method;
FIG. 16 is a diagram illustrating an image reconstructed by the invention;
FIG. 17 is a diagram illustrating a simulated input image used in experiment;
FIG. 18 is a diagram illustrating an image reconstructed by linear interpolation;
FIG. 19 is a diagram illustrating an image reconstructed by traditional demosaicing method;
FIG. 20 is a diagram illustrating an image reconstructed by the invention;
FIG. 21 is a diagram illustrating experimental results using an image whose subject is a text document (hereinafter referred to as “text-document-image”); and
FIG. 22 is a diagram illustrating experimental results using images whose subject is nature (hereinafter referred to as “nature-image”).



BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, preferred embodiments according to the invention will be described with reference to the drawings and equations.
<1> Observation Model
<1-1> Introduction
For example, consider a single raw image or multiple raw images captured by an image capturing device such as a digital camera. A single captured image is the result that geometrical transform with respect to an absolute coordinate system, blur effect by an optical system and the aperture of a CCD, downsampling, and CFA masking are applied to a true image (that, is, a captured scene).
<1-2> Image Formation Model
Here, modeling is started without consideration of CFA effect. In this section, a gray scale image is considered.
In an image formation model for an image capturing system, an input image is continuous, whereas output data (“output data” referred here means a CFA masked raw image) is discrete. Thus, it can be expressed by a continuous-discrete model.
The image formation model for the image capturing system can be expressed by the following Equation 1.

u(i1,i2)=∫∫p(i1−x,i2−y)I(x,y)dxdy  [Equation 1]

Where u(i1,i2) expresses a digital image captured by a CCD, and I(x,y) expresses a true image (scene). (i1,i2) is a discrete coordinate system, and (x,y) is a continuous coordinate system. p(x,y) is a point spread function. PSF (“PSF” means a point spread function) is derived from optical transfer characteristics formed of an optical system and a CCD aperture in the image capturing system, but in practice, it can be approximately modeled by a Gaussian function expressed by the following Equation 2.




  
    
      
        
          p
          ⁡
          
            (
            
              x
              ,
              y
            
            )
          
        
        =
        
          
            1
            
              
                
                  2
                  ⁢
                  π
                
              
              ⁢
              σ
            
          
          ⁢
          exp
          ⁢
          
            {
            
              -
              
                
                  
                    x
                    2
                  
                  +
                  
                    y
                    2
                  
                
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    2
                  
                
              
            
            }
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          2
        
        ]
      
    
  




Where σ2 is a variance.
Integration in Equation 1 is performed with respect to (x, y).
Consider coordinate transformation from (x,y) to (ξ,η). Where (ξ,η) is coordinates where a high resolution image is defined.
For example, it can be considered that a three-parameter model having the following parameter expresses the translation and rotational motion of the entire image.

r=[δx,δy,θ]  [Equation 3]

Coordinate transformation is expressed in the following model.




  
    
      
        
          s
          ⁡
          
            (
            
              ξ
              ,
              η
            
            )
          
        
        =
        
          
            
              
                1
                f
              
              ⁡
              
                [
                
                  
                    
                      
                        cos
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                    
                    
                      
                        
                          -
                          sin
                        
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                    
                  
                  
                    
                      
                        sin
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                    
                    
                      
                        cos
                        ⁢
                        
                          
                        
                        ⁢
                        θ
                      
                    
                  
                
                ]
              
            
            ⁡
            
              [
              
                
                  
                    ξ
                  
                
                
                  
                    η
                  
                
              
              ]
            
          
          +
          
            [
            
              
                
                  
                    δ
                    x
                  
                
              
              
                
                  
                    δ
                    y
                  
                
              
            
            ]
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          4
        
        ]
      
    
  




Where θ is a rotation angle, and δx,δy are a horizontal component and a vertical component of translation, respectively. f is a resolution enlargement ratio that can be specified freely.
When the coordinate transformation (x,y)=s(ξ,η) is used, the Equation 1 becomes the following Equation 5.




  
    
      
        
          u
          ⁡
          
            (
            
              
                i
                1
              
              ,
              
                i
                2
              
            
            )
          
        
        =
        
          ∫
          
            
              ∫
              p
            
            ⁢
            
              
                (
                
                  
                    (
                    
                      
                        i
                        1
                      
                      ,
                      
                        i
                        2
                      
                    
                    )
                  
                  -
                  
                    s
                    ⁡
                    
                      (
                      
                        ξ
                        ,
                        η
                      
                      )
                    
                  
                
                )
              
              ⁢
              
                I
                ⁡
                
                  (
                  
                    x
                    ,
                    y
                  
                  )
                
              
              ⁢
              
                
                
                  
                    ∂
                    s
                  
                  
                    ∂
                    
                      (
                      
                        ξ
                        ,
                        η
                      
                      )
                    
                  
                
                
              
              ⁢
              
                d
                ξ
              
              ⁢
              
                
              
              ⁢
              
                d
                η
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          5
        
        ]
      
    
  




In order to obtain discrete approximation of a model expressed by Equation 5, suppose true image I(x,y) is constant in the entire area that covers high resolution pixels positioned at lattice points (j1,j2) of high resolution. Thus, the integration of Equation 5 can be written in the form of Equation 6.




  
    
      
        
          u
          ⁡
          
            (
            
              
                i
                1
              
              ,
              
                i
                2
              
            
            )
          
        
        =
        
          
            ∑
            
              j
              1
            
          
          ⁢
          
            
          
          ⁢
          
            
              ∑
              
                j
                2
              
            
            ⁢
            
              
            
            ⁢
            
              
                z
                ⁡
                
                  (
                  
                    
                      j
                      1
                    
                    ,
                    
                      j
                      2
                    
                  
                  )
                
              
              ⁢
              
                h
                ⁡
                
                  (
                  
                    
                      i
                      1
                    
                    ,
                    
                      i
                      2
                    
                    ,
                    
                      j
                      1
                    
                    ,
                    
                      
                        j
                        2
                      
                      ;
                      s
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          6
        
        ]
      
    
  




Where z(j1,j2) is a constant value of the assumed true image I(x,y). Furthermore, Equation 7 is as below.




  
    
      
        
          h
          ⁡
          
            (
            
              
                i
                1
              
              ,
              
                i
                2
              
              ,
              
                j
                1
              
              ,
              
                
                  j
                  2
                
                ;
                s
              
            
            )
          
        
        =
        
          
            ∫
            
              
                j
                1
              
              -
              
                1
                /
                2
              
            
            
              
                j
                1
              
              +
              
                1
                /
                2
              
            
          
          ⁢
          
            
              ∫
              
                
                  j
                  2
                
                -
                
                  1
                  /
                  2
                
              
              
                
                  j
                  2
                
                +
                
                  1
                  /
                  2
                
              
            
            ⁢
            
              
                p
                ⁡
                
                  (
                  
                    
                      s
                      ⁡
                      
                        (
                        
                          ξ
                          ,
                          η
                        
                        )
                      
                    
                    -
                    
                      (
                      
                        
                          i
                          1
                        
                        ,
                        
                          i
                          2
                        
                      
                      )
                    
                  
                  )
                
              
              ⁢
              
                
                
                  
                    ∂
                    s
                  
                  
                    ∂
                    
                      (
                      
                        ξ
                        ,
                        η
                      
                      )
                    
                  
                
                
              
              ⁢
              
                
              
              ⁢
              
                d
                ξ
              
              ⁢
              
                
              
              ⁢
              
                d
                η
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          7
        
        ]
      
    
  




The integration of Equation 7 is performed with respect to the entire area that covers the high resolution pixels positioned at (j1,j2). The model expressed by Equation 6 is referred to as “zeroth-order hold”. Different modeling other than the zeroth-order hold is possible, and for example, linear approximation, higher order approximation, etc. can be considered.
Equation 6 can be expressed by a matrix vector notation. When a lexicographic notation is used for images u(i1,i2) and z(j1,j2), Equation 6 becomes the following Equation 8.

u=H(s)z  [Equation 8]

Where u and z are column vectors having the same size as the number of pixels in u(i1,i2) and z(j1,j2), respectively.
H(s) is matrix expression h(i1,i2,j1,j2;s) that associates u with z.
<1-3> Color Filter Array (CFA)
A color image can be expressed by multiple color channels of two-dimensional signals. Red, Green, and Blue are often used for a consumer camera such as a 3CCD digital still camera.
Let us expand the image formation model for the image capturing system described above (in the invention, it is also referred to as an image capturing model) to a color image. It can be considered that the model expressed by Equation 8 is a model for a single color channel. Therefore, an image formation model for each color channel can be similarly expressed.

uc=Hc(s)zc  [Equation 9]

Where matrix Hc(s) expresses an image formation model for color channel c∈{R,G,B}. Practically, matrices HR(s),HG(s),HB(s) can often be approximated by the same matrix H(s).
In the single-chip CCD camera, a color image is masked by CFA to generate color mosaic. In FIG. 1(a), a single image therein shows CFA that is well known as a Bayer pattern. This process is modeled as sampling applied to a color image u by CFA.
Consider a single two-dimensional arrangement including 1 or 0 at every element. The element having value 1 has sensitivity with respect to color c∈{R,G,B}. The arrangements below show a sampling arrangement for a Bayer pattern. More specifically, these sensitivity arrangements express a Bayer pattern having an image size of 5×5.




  
    
      
        
          
            m
            R
          
          ⁡
          
            (
            
              i
              ,
              j
            
            )
          
        
        ⁢
        
          :
        
        ⁢
        
          (
          
            
              
                0
              
              
                1
              
              
                0
              
              
                1
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                1
              
              
                0
              
              
                1
              
              
                0
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                0
              
              
                1
              
              
                0
              
              
                1
              
              
                0
              
            
          
          )
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          10
        
        ]
      
    
  
  
    
      
        
          
            m
            G
          
          ⁡
          
            (
            
              i
              ,
              j
            
            )
          
        
        ⁢
        
          :
        
        ⁢
        
          (
          
            
              
                1
              
              
                0
              
              
                1
              
              
                0
              
              
                1
              
            
            
              
                0
              
              
                1
              
              
                0
              
              
                1
              
              
                0
              
            
            
              
                1
              
              
                0
              
              
                1
              
              
                0
              
              
                1
              
            
            
              
                0
              
              
                1
              
              
                0
              
              
                1
              
              
                0
              
            
            
              
                1
              
              
                0
              
              
                1
              
              
                0
              
              
                1
              
            
          
          )
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          11
        
        ]
      
    
  
  
    
      
        
          
            m
            B
          
          ⁡
          
            (
            
              i
              ,
              j
            
            )
          
        
        ⁢
        
          :
        
        ⁢
        
          (
          
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                1
              
              
                0
              
              
                1
              
              
                0
              
              
                1
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
            
              
                1
              
              
                0
              
              
                1
              
              
                0
              
              
                1
              
            
            
              
                0
              
              
                0
              
              
                0
              
              
                0
              
              
                0
              
            
          
          )
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          12
        
        ]
      
    
  




The sampling arrangements for image sensors (in the embodiment, a CCD capturing element) using other CFA patterns can be similarly configured.
When consider vector expressions mR(i,j),mG(i,j),mB(i,j), the following Equation 13 is made.

mR=(0,1,0,1,0,0,0, . . . 0)

mG=(1,0,1,0,1,0,1, . . . 1)

mB=(0,0,0,0,0,1,0, . . . 0)  [Equation 13]

The sampling by CFA can be expressed by a form of the following diagonal matrix.

Mc=diag(mc)  [Equation 14]

Where c∈{R,G,B}.
As described above, the sampling model by CFA is given by effecting matrices to full color image uc.

yc=Mcuc  [Equation 15]

Where yc includes pixel values in raw data captured by a CFA masked CCD. An overall forward model for a single-chip CCD is written in the following form by using the above Equation 9 and Equation 15.




  
    
      
        
          [
          
            
              
                
                  y
                  R
                
              
            
            
              
                
                  y
                  G
                
              
            
            
              
                
                  y
                  B
                
              
            
          
          ]
        
        =
        
          
            diag
            ⁡
            
              (
              
                
                  
                    M
                    R
                  
                  ⁢
                  
                    
                      H
                      R
                    
                    ⁡
                    
                      (
                      s
                      )
                    
                  
                
                ,
                
                  
                    M
                    G
                  
                  ⁢
                  
                    
                      H
                      G
                    
                    ⁡
                    
                      (
                      s
                      )
                    
                  
                
                ,
                
                  
                    M
                    B
                  
                  ⁢
                  
                    
                      H
                      B
                    
                    ⁡
                    
                      (
                      s
                      )
                    
                  
                
              
              )
            
          
          ⁡
          
            [
            
              
                
                  
                    z
                    R
                  
                
              
              
                
                  
                    z
                    G
                  
                
              
              
                
                  
                    z
                    B
                  
                
              
            
            ]
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          16
        
        ]
      
    
  




<1-4> Multi-Frame Observation Model

Consider a sequence of raw color mosaic images captured by a single-chip CCD. An expression in consideration of geometric transformation with respect to Equation 16 can be used.




  
    
      
        
          
            [
            
              
                
                  
                    y
                    R
                  
                
              
              
                
                  
                    y
                    G
                  
                
              
              
                
                  
                    y
                    B
                  
                
              
            
            ]
          
          k
        
        =
        
          
            diag
            ⁡
            
              (
              
                
                  
                    M
                    R
                  
                  ⁢
                  
                    
                      H
                      R
                    
                    ⁡
                    
                      (
                      
                        s
                        k
                      
                      )
                    
                  
                
                ,
                
                  
                    M
                    G
                  
                  ⁢
                  
                    
                      H
                      G
                    
                    ⁡
                    
                      (
                      
                        s
                        k
                      
                      )
                    
                  
                
                ,
                
                  
                
                ⁢
                
                  
                    M
                    B
                  
                  ⁢
                  
                    
                      H
                      B
                    
                    ⁡
                    
                      (
                      
                        s
                        k
                      
                      )
                    
                  
                
              
              )
            
          
          ⁡
          
            [
            
              
                
                  
                    z
                    R
                  
                
              
              
                
                  
                    z
                    G
                  
                
              
              
                
                  
                    z
                    B
                  
                
              
            
            ]
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          17
        
        ]
      
    
  




Where Sκ, κ=1, . . . , M expresses the coordinate transformation in Equation 5, with respect to each frame in an image column.
In Equation 17, consider stack expression of vectors, and then it is the following Equation 18.

yk=Akz  [Equation 18]

Where Ak is a block diagonal matrix on the right side of Equation 17 that expresses the relationship between a high resolution image and an observed frame.
Vector yk includes pixel values that are not observed by Z. It should be noted that a valid row for Ak is a row that corresponds to elements for yk that are observed from elements having compensated motion of z. The remaining invalid rows are removed to generate a system of a reduced equation. Thus, this process removes elements that do not have meanings as input data.
Now, suppose there is a sequence of equations that expresses an image capturing model for multiple images having M input images.




  
    
      
        
          
            
              
                y
                1
              
              =
              
                
                  A
                  1
                
                ⁢
                z
              
            
          
        
        
          
            ⋮
          
        
        
          
            
              
                y
                k
              
              =
              
                
                  A
                  k
                
                ⁢
                z
              
            
          
        
        
          
            ⋮
          
        
        
          
            
              
                y
                M
              
              =
              
                
                  A
                  M
                
                ⁢
                z
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          19
        
        ]
      
    
  




When stacked equations are used, the following Equation 20 is made.

y=Az+n  [Equation 20]

On the right side of the above Equation 20, an additional term that expresses noise is considered. A is a forward observation model in the entire image capturing process for image sequence, which is referred to as a system matrix in the invention.
<2> Formulation of Problems
<2-1> Introduction
In the invention, a greatest object is to provide a novel high resolution color image reconstruction method, a reconstruction apparatus and a reconstruction program, in which a raw color mosaic image captured by an image capturing device using an image sensor (in the embodiment, a single-chip CCD) and a color filter array can be input to directly reconstruct a full color high resolution image as output. The important technique principles in the invention that adopts this direct method are to incorporate priori knowledge about the correlation between color channels into image reconstruction problems.
In the invention, multi-channel constraint uses operators in order to model piecewise smooth data in color channels, and includes a spectral energy function in order to reveal the correlation between cross channels.
<2-2> Image Reconstruction as an Inverse Problem
The image reconstruction method (it is also referred to as an image generation method) according to the invention aims to obtain a high resolution image from a low resolution image or a sequence of several low resolution images. However, this often turns to an ill-posed inverse problem. Therefore, it is necessary to this application to include a priori constraint. This ensures the image estimation that is acceptable under conditions of limited data or bad quality data.
An estimated image for zt can be obtained by solving an inverse problem with the forward observation model discussed in the above section. When an optimization approach that is made appropriate to solving the inverse problem is applied, the following Equation 21 is obtained.




  
    
      
        
          z
          ^
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              z
            
            ⁢
            
              {
              
                
                  
                    f
                    1
                  
                  ⁡
                  
                    (
                    z
                    )
                  
                
                +
                
                  λ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      f
                      p
                    
                    ⁡
                    
                      (
                      z
                      )
                    
                  
                
              
              }
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          21
        
        ]
      
    
  




Where:




  
    
      
        
          
            f
            1
          
          ⁡
          
            (
            z
            )
          
        
        =
        
          
            
              
              
                y
                -
                Az
              
              
            
            2
          
          =
          
            
              ∑
              k
              M
            
            ⁢
            
              
            
            ⁢
            
              
                
                
                  
                    y
                    k
                  
                  -
                  
                    
                      A
                      k
                    
                    ⁢
                    z
                  
                
                
              
              2
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          22
        
        ]
      
    
  




Parameter λ controls a weight between a priori constraint and the compatibility of observed data.
An energy function formed of two terms, which expresses the correlation between a space and a spectrum, is as below.

fp(z)=f2(z)+μf3(z)  [Equation 23]

Where f2(z) expresses spatial energy, and f3(z) expresses spectral energy. Parameter μ adjusts a relative significance between two terms.
<2-3> Spatial Energy Function
Generally, piecewise smoothness can be assumed for every color channel. This assumption is incorporated into the spatial energy function, and then much higher priority can be obtained as a signal is smoother.
The model below expresses the correlation between spaces.

f2(z)=∥Pz∥2 

Where P is a linear operator being differential approximation with respect to a Laplacian operator applied to every color channel.
The function expressed by Equation 24 expresses spatial activity. In a smooth image, f2(z) is a small value, whereas f2(z) is great with respect to an image having an edge. f2(z) gives penalty to discontinuity in an image. In this model, a smooth signal is matched with spatial assumption to provide high performance.
<2-3-1> Edge Preserving Operator
The above described appropriateness model serves as a function as constraint for smoothness. The constraint results in an estimated image unnecessarily smoothed. In order to cope with this problem, edge preserving constraint can be used in image estimation.
Consider an edge detection function that provides edge direction in an image. Quadratic differential is applied in different directions to select a direction that minimizes the detection function for every pixel, and then an edge direction map is generated.
Accordingly, an adaptive operator that evaluates quadratic differential in the edge direction for every pixel serves as edge preserving constraint, and Equation 24 can be replaced.
<2-4> Spectral Energy Function
Each color plane contains edges of an object that have high connection and are matched at positions with each other. The correlation can be explained by in terms of another color space. Consider a color space decomposition into luminance component and chrominance component.




  
    
      
        
          [
          
            
              
                
                  z
                  R
                
              
            
            
              
                
                  z
                  G
                
              
            
            
              
                
                  z
                  B
                
              
            
          
          ]
        
        =
        
          
            
              [
              
                
                  
                    I
                  
                
                
                  
                    I
                  
                
                
                  
                    I
                  
                
              
              ]
            
            ⁢
            
              z
              L
            
          
          +
          
            [
            
              
                
                  
                    z
                    p
                  
                
              
              
                
                  
                    z
                    q
                  
                
              
              
                
                  
                    z
                    r
                  
                
              
            
            ]
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          25
        
        ]
      
    
  




Where I is a unit matrix, zL is a luminance signal component for Z, and [zp,zq,zr]T is a chrominance signal component for z. The luminance signal is defined so as to express light intensity. Linear combination of the RGB signals provides luminance.

zL=αzR+βzG+γzB  [Equation 26]

Coefficients are set as below.

    α=1⁄3, β=1⁄3, γ=1⁄3


In a specific example using a Bayer CFA pattern, a weight can be placed on a green channel that includes the greatest information in CFA. For example, for a Bayer pattern, coefficients can be set so as to be α=0, β=1, γ=0 or α=1⁄4, β=1⁄2, γ=1⁄4.
Equation 25 and Equation 26 decide the following transformation relating to the RGB signals and the chrominance signals.




  
    
      
        
          [
          
            
              
                
                  z
                  p
                
              
            
            
              
                
                  z
                  q
                
              
            
            
              
                
                  z
                  r
                
              
            
          
          ]
        
        =
        
          T
          ⁡
          
            [
            
              
                
                  
                    z
                    R
                  
                
              
              
                
                  
                    z
                    G
                  
                
              
              
                
                  
                    z
                    B
                  
                
              
            
            ]
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          27
        
        ]
      
    
  




Where Equation 28 is an RGB-chrominance transformation matrix.




  
    
      
        T
        =
        
          [
          
            
              
                
                  
                    (
                    
                      1
                      -
                      α
                    
                    )
                  
                  ⁢
                  I
                
              
              
                
                  
                    -
                    β
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
              
                
                  
                    -
                    γ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
            
            
              
                
                  
                    -
                    α
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
              
                
                  
                    (
                    
                      1
                      -
                      β
                    
                    )
                  
                  ⁢
                  I
                
              
              
                
                  
                    -
                    γ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
            
            
              
                
                  
                    -
                    α
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
              
                
                  
                    -
                    β
                  
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
              
              
                
                  
                    (
                    
                      1
                      -
                      γ
                    
                    )
                  
                  ⁢
                  I
                
              
            
          
          ]
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          28
        
        ]
      
    
  




Function f3(z) gives penalty to sudden change in the chrominance signal.

f3(z)=∥QTz∥2  [Equation 29]

Where Q is a linear operator being differential approximation with respect to a Laplacian operator applied to every chrominance signal.
This results in that the estimated image where the chrominance signal is resulted to have local continuity obtains much higher priority. In order to derive a desirable estimated image, coefficients in color space transformation can be corrected.
Since chrominance is the difference between luminance and the RGB signals (see Equation 25), a spectral energy function detects the correlation between these signals. Therefore, the spectral energy function takes into account of correlation characteristics between luminance and chrominance, and provides a ground for a signal process between color channels.
For a Bayer CFA, color correlation constraint functions properly when the window size of a kernel for filter Q is set to 3f×3f, where f is a resolution enlargement ratio. When the number of input images that can be used is small, this process is particularly necessary. When the window size is not properly adjusted, there is a tendency to show false color.
The edge preserving operator analog to the edge preserving operator used for the spatial energy function can also be used for the spectral energy function.
<3> Parameter Estimation and an Optimization Technique
<3-1> PSF Estimation
In order to construct an observation model, it is necessary to determine the point spread function described above.
The knowledge of the optical system and the CCD aperture of the image capturing device can theoretically derive PSF.
An edge image or an edge spread function can be used to experimentally estimate PSF as well.
Rough estimation with respect to PSF is also possible, and the resulting estimated image is tested to bring much better estimation with respect to PSF.
<3-2> Motion estimation
Geometrical transform sk in the observation model has to be identified prior to the image reconstruction process. Resolution enlargement requires motion estimation having subpixel accuracy. The greater a desired resolution enlargement ratio is, the greater limitation this requirement puts on image reconstruction.
Furthermore, the computation efficiency and reliability of a motion estimation method is an important problem in implement. A simple motion model having a fewer number of parameters is suitable for this requirement.
A block matching technique based on interpolation provides motion estimation in subpixels. In one of well-known approaches, image data itself is interpolated, and then the block matching technique is applied. Another approach interpolates a matching criterion such as the sum of square differences (SSD) error, the sum of absolute differences (SAD) error, and a cross-correlation function (CC).
Shimizu et al. proposed a novel subpixel matching technique (EEC method) (see Reference Literature [6]). The method can be used in the invention. As compared with the traditional technique based on interpolation of matching criteria, the EEC method can reduce estimation error. In order to cancel estimation error, anti-phase estimation is used in the method. Another advantage of the method is to have much higher computation efficiency than the method that interpolates image data itself.
<3-3> Steepest Descent Optimization
By Equation 21, a high-resolution estimated image can be obtained by minimizing the following objective function (in the invention, this objective function is also referred to as an evaluation function).

f(z)=f1(z)+af2(z)+bf3(z)  [Equation 30]

Where a=λ or b=λμ is held.
This is expressed as a large-scale optimization problem, and a large-sized system matrix causes a problem in implement step.
A recursive method is well suitable for this optimization. The steepest descent technique is used to give the following recursive update with respect to a high resolution image.




  
    
      
        
          z
          
            (
            
              n
              +
              1
            
            )
          
        
        =
        
          
            z
            
              (
              n
              )
            
          
          +
          
            
              α
              
                (
                n
                )
              
            
            ⁢
            
              d
              
                (
                n
                )
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          31
        
        ]
      
    
  
  
    
      
        
          
            
              d
              
                (
                n
                )
              
            
            =
            
              
                ∂
                
                  f
                  ⁡
                  
                    (
                    z
                    )
                  
                
              
              
                ∂
                z
              
            
          
          
        
        
          z
          =
          
            z
            
              (
              n
              )
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          32
        
        ]
      
    
  




Where n means the n-th repetition. d(n) is a gradient of the objective function. The step size α(n) is adjusted for stable computation. The first image estimation z(0) can be obtained by interpolating y1.
Here, in the embodiment, the steepest-descent method is used as the optimization technique, but the optimization technique used in the invention is not limited thereto, and the other optimization techniques can be used as well.
<3-4> Flow of a Signal Process in the Invention
FIG. 1 shows an exemplary flow of a signal process used in the invention. FIG. 1(a) shows input image sequence of a raw color mosaic image captured through a Bayer color filter array. The high resolution color image reconstruction method according to the invention is used to reconstruct a high resolution full color image shown in FIG. 1(b) from data of the input image sequence shown in FIG. 1(a).
In FIG. 2, a flow of the overall process of the high resolution color image reconstruction method according to the invention is shown in detail. First, raw color mosaic image sequence can be obtained from a single-chip CCD. Subsequently, simple demosaicing is performed that applies linear interpolation for every color channel. Then, motion estimation is applied to a predetermined color channel (in the embodiment, a Green channel). In the embodiment, since a Bayer color filter array is used, a predetermined color channel is a green channel. However, when the other CFAs are used, the other color channels decided based on that CFA are to be used.
After color space transformation, a luminance signal can be used instead of motion estimation. The estimated motion parameter and the specified resolution enlargement ratio f can be used for constructing system matrix W along with PSF and CFA patterns. Since a recursive minimization process of the objective function requires the initial value z(0) of a high resolution estimated image, the high resolution image is set to the initial value z(0) in which a single input image having undergone the linear demosaicing process goes through a preparation process for interpolation, and up sampled for reconstruction.
Finally, the initial value of the estimated image is updated through the recursive minimization process of the objective function (in the embodiment, it is the steepest-descent method described in detail in FIG. 3). Since the objective function is a quadratic equation, the computation of the gradient is simple. When the estimated image {circumflex over (z)} is converged, or the specified conditions expressed in Equation 33 are satisfied, repetition is terminated. The estimated image {circumflex over (z)} can be obtained by the recursive minimization process of the objective function.

∥d(n)∥/∥z(n)∥<ε  [Equation 33]

Where ε is a threshold.

<4> Combination of High Resolution Color Images

Another embodiment according to the invention will be disclosed as below.
First, based on the forward observation model described above, inverse problem analysis is conducted to estimate a high resolution image. When an optimization method of the objective function added with a regularization term (in the invention, it is also referred to as an evaluation function) is used, the high resolution color image {circumflex over (z)} to be estimated is given by the following Equation 34.




  
    
      
        
          z
          ^
        
        =
        
          arg
          ⁢
          
            
              min
              z
            
            ⁢
            
              {
              
                
                  
                    f
                    1
                  
                  ⁡
                  
                    (
                    z
                    )
                  
                
                +
                
                  
                    f
                    p
                  
                  ⁡
                  
                    (
                    z
                    )
                  
                
              
              }
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          34
        
        ]
      
    
  




Where a first term of the objective function is the term that expresses goodness of fit to measured data:




  
    
      
        
          
            f
            1
          
          ⁡
          
            (
            z
            )
          
        
        =
        
          
            ∑
            
              k
              =
              1
            
            M
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  y
                  k
                
                -
                
                  
                    A
                    k
                  
                  ⁢
                  z
                
              
              
            
            2
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          35
        
        ]
      
    
  




The second term of the objective function is a regularization term. It can be considered that the regularization term is an evaluation equation which expands a term having been used for super-resolution of gray scale images and evaluating the local smoothness of a signal to a color signal.
Generally, in a nature-image, it is known that each component of the RGB signals has a strong positive correlation and edge positions are also matched. Therefore, it is undesirable to use independent evaluation equations for individual color channels. For example, when an evaluation equation having smoothing effect is used (independently) for the individual RGB signals, a color shift is generated.
This phenomenon is generated by the same cause as false color seen in an image applied to linear demosaicing. More specifically, it is the cause that the individual color channels having different sampling positions are independently interpolated to vary the correlation between the RGB signals greatly. This is caused that each color channel of raw data is not densely sampled as 3CCD. Accordingly, when input images y1, . . . , yM, (M>2) where multiple positions are shifted are obtained in Equation 35, the same effect as doing dense sampling can be obtained, and the generation of color shifts can be reduced. It is revealed that this is almost the same as the fact that a 3CCD image is virtually obtained. Color shifts are to be reduced as input images where multiple positions are shifted are more sufficiently obtained and Equation 35 comes closer to over-determined.
However, it is in fact confirmed that false color is generated even though Equation 35 is over-determined. The causes are that independent noise enters each color channel and that the estimation of the position shift between input images is inaccurate. Moreover, in the invention, the color shift caused by the influence of chromatic aberration is not considered.
In order to suppress the generation of such false color, it is suitable to use a color space having a color component of small correlation than that of RGB. Then, consider the following transformation from RGB space to YCbCr space.

zy=0.299zR+0.587zG+0.114zB 

zCb=−0.1687zR−0.331zG+0.5zB 

zCr=0.5zR−0.4187zG−0.0813zB  [Equation 36]

With the use of the above transformation, the regularization term is defined by terms for a luminance component and a chrominance component.

fp(z)=f2(zy)+f3(zCb,zCr)  [Equation 37]

In a nature-image, the variation in the chrominance component is smaller than that in the luminance component, and the greatest information is included in the luminance component. Furthermore, in many applications, it is demanded that the structure of a subject expressed by luminance information is expressed in higher definition than color information. Moreover, from a reason that a human visual system is relatively low in sensitivity with respect to color variation, the following conditions are taken into the regularization term.
First, for luminance, an edge preserving anisotropic smoothness condition is taken into the regularization term to prevent the structure of a subject from degrading due to excessive smoothing. For a smoothness condition that satisfies this requirement, a regularization operator is used that smoothes in the direction along with an edge (see Reference Literature [7]). More specifically, it is expressed by the following Equation 38 using a high-pass operator Pd, d ∈ D that evaluates smoothness in direction Din each pixel: {horizontal, vertical, and diagonal (two ways) directions, no direction (equal to all directions).




  
    
      
        
          
            f
            2
          
          ⁡
          
            (
            
              z
              Y
            
            )
          
        
        =
        
          
            ∑
            
              d
              ∈
              D
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  Λ
                  d
                
                ⁢
                
                  P
                  d
                
                ⁢
                
                  z
                  Y
                
              
              
            
            2
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          38
        
        ]
      
    
  




Each element in diagonal matrix Λd expresses a weight with respect to a high-pass operation in the edge direction d in each pixel zy. The weight is determined by detecting the edge direction and intensity in each pixel.
On the other hand, the regularization term on chrominance considers isotropic smoothness. This is because when the number of input images is small and Equation 35 is underdetermined with respect to an unknown, an anisotropic smoothness condition is given to chrominance, and then it is difficult to estimate the true edge direction. The following regularization term using isotropic high-pass filter H is defined.

f3(zCb,zCr)=λc(∥HzCb∥2+∥HzCr∥2)  [Equation 39]

Where λc is a weighting parameter.
Even when Equation 35 is over-determined, false color is generated that is caused by motion estimation error and color channel independent noise. Therefore, the above regularization term expressed by Equation 39 serves an important role in color image reconstruction.
The cut-off frequency of the high-pass filter is set to a color channel band where the sampling intervals of a color filter are the coarsest, and thus false color can be suppressed. When multiple input images are given and Equation 35 comes close to over-determined, a greater cut-off frequency is set to suppress the excessive smoothing of chrominance. In addition, in an experiment described later, a Gaussian high-pass filter (that, is, a filter that can give frequency characteristics by H(u,v)=1−exp(−(u2+v2)/2σ2c)) is used, and a regularization operator that the standard deviation is the cut-off frequency is used.
It can be verified by an experiment described later that the regularization term with respect to the above-described chrominance has the property of suppressing the edge shift between the color channels. First, for a model of the edge portion where two color areas are adjacent in an image, consider the following one-dimensional RGB signals.

zR(j)=erf(j)+2,

zG(j)=a1zR(j−Dg)+b1,

zB(j)=a2zR(j−Db)+b2  [Equation 40]

erƒ(•) expresses an error function:




  
    erf
    ⁡
    
      (
      ξ
      )
    
  
  =
  
    
      2
      
        π
      
    
    ⁢
    
      
        ∫
        0
        ξ
      
      ⁢
      
        
          exp
          ⁡
          
            (
            
              -
              
                t
                2
              
            
            )
          
        
        ⁢
        
          
        
        ⁢
        
          d
          t
        
      
    
  




a1, a2, b1, b2 are a constant. Dg, Db express the amount of shift at edge positions of G component and B component with respect to R component, respectively (FIG. 4). When the edge positions in RGB are aligned, (Dg=Db=0) is a model where two color areas are adjacent, but when the edge positions are slightly shifted (Dg≠0, Db ≠0), a color shift can be generated on the border part.
FIG. 5 shows the variation in the evaluation value f3(zCb,zCr) when Dg, Db of a model expressed by Equation 40. Constants are (a1,a2,b1,b2)=(1.2,0.8,0.1,0.1). FIG. 5 reveals that the evaluation value of the regularization term takes the minimum value when the edge positions are completely matched. It can be easily confirmed that the property of the regularization term like this is held with respect to given a1, a2, b1, b2 of a1, a2>0 (it is held when the RGB signals have positive correlations).
FIG. 6 shows an exemplary configuration of an image capturing device to which the high resolution color image reconstruction method according to the invention is applied. As shown in FIG. 6, the image capturing device to which the invention is applied is configured of an optical system formed of a lens and an optical low-pass filter, a color filter, an image sensor (in the embodiment, a CCD capturing element), a drive circuit which drives the entire image capturing device, an AD converting module, a signal processing module, and memory.
The operation of the image capturing device shown in FIG. 6 is as follows. First, light receiving signals in color mosaic are inputted to a CCD by the optical system and the color filter. Subsequently, continuous image capturing for a fixed time period generates a time series of light receiving signals in the CCD. Then, the time series of the light receiving signals in color mosaic is quantized in the AD converting module, and then stored in the memory. In the signal processing module, multiple color mosaic signals y1, y2, . . . , yM are combined by a matching process and a super-resolution process, and RGB components {circumflex over (z)}R {circumflex over (z)}G {circumflex over (z)}B of the resulting high resolution image are generated.
Next, the detail of the signal process in the signal processor shown in FIG. 6 is shown in FIG. 7. Here, an image reconstruction method for combining a high resolution color image will be described as below with reference to FIG. 7.

    Step 1:


Raw image sequence y1, . . . , yM to be input are obtained.

    Step 2:


Calibration for sensitivity arrangement mc(i1,i2) is performed when the arrangement of a CFA pattern is unknown.

    Step 3:


Input raw image sequence are colored by simple demosaicing using linear interpolation. The displacement of image dk=[dxk,dyk] is estimated with respect to the luminance component of the obtained color image.

    Step 4:


A desired resolution magnification ƒ is set. Then, Equation 34 is optimized. In the invention, various optimization methods can be used. For example, when the steepest-descent method is used as an optimization method, it becomes the subsequent step 5.

    Step 5:


Set n=0. A high resolution color image is generated from a single input image to be reference by linear interpolation. This image is set to the initial value z(0) for a reconstructed image.

    Step 6:


The weight Λd for the regularization term f2(zY) is computed by edge direction analysis of the luminance component of the image z(n) (see Reference Literature [7]).

    Step 7:


The image z(n) is updated by the following Equations 41 to Equation 44.




  
    
      
        
          z
          
            (
            
              n
              +
              1
            
            )
          
        
        =
        
          
            z
            
              (
              n
              )
            
          
          -
          
            
              α
              ⁡
              
                [
                
                  
                    ∂
                    
                      ∂
                      z
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        m
                        =
                        1
                      
                      3
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        f
                        m
                      
                      ⁡
                      
                        (
                        z
                        )
                      
                    
                  
                
                ]
              
            
            
              z
              =
              
                z
                
                  (
                  n
                  )
                
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          41
        
        ]
      
    
  
  
    
      
        
          
            
              
                ∂
                
                  
                    f
                    1
                  
                  ⁡
                  
                    (
                    z
                    )
                  
                
              
              
                ∂
                z
              
            
            
          
          
            z
            =
            
              z
              
                (
                n
                )
              
            
          
        
        =
        
          
            ∑
            
              k
              =
              1
            
            M
          
          ⁢
          
            
          
          ⁢
          
            
              A
              k
              T
            
            ⁡
            
              (
              
                
                  Az
                  
                    (
                    n
                    )
                  
                
                -
                
                  y
                  k
                
              
              )
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          42
        
        ]
      
    
  
  
    
      
        
          
            
              
                ∂
                
                  
                    f
                    2
                  
                  ⁡
                  
                    (
                    
                      z
                      Y
                    
                    )
                  
                
              
              
                ∂
                z
              
            
            
          
          
            z
            =
            
              z
              
                (
                n
                )
              
            
          
        
        =
        
          
            ∑
            
              d
              ∈
              D
            
          
          ⁢
          
            
          
          ⁢
          
            
              T
              Y
              T
            
            ⁢
            
              Λ
              d
              T
            
            ⁢
            
              P
              d
              T
            
            ⁢
            
              P
              d
            
            ⁢
            
              Λ
              d
            
            ⁢
            
              T
              Y
            
            ⁢
            
              z
              
                (
                n
                )
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          43
        
        ]
      
    
  
  
    
      
        
          
            
              
                ∂
                
                  
                    f
                    3
                  
                  ⁡
                  
                    (
                    
                      
                        z
                        Cb
                      
                      ,
                      
                        z
                        Cr
                      
                    
                    )
                  
                
              
              
                ∂
                z
              
            
            
          
          
            z
            =
            
              z
              
                (
                n
                )
              
            
          
        
        =
        
          
            λ
            c
          
          ⁢
          
            
              ∑
              
                C
                ∈
                
                  {
                  
                    Cb
                    ,
                    Cr
                  
                  }
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                T
                C
                T
              
              ⁢
              
                H
                T
              
              ⁢
              
                HT
                C
              
              ⁢
              
                z
                
                  (
                  n
                  )
                
              
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          44
        
        ]
      
    
  




Where TT, TCb, TCr are matrices expressing an operation that determines Y, Cb, and Cr components from the RGB signals, respectively. Since the computation from Equation 41 to Equation 44 can be implemented by the combinations of image processing such as linear filtering, sampling, coordinate transformation, and color space transformation, it is unnecessary to actually perform the matrix operation.

    Step 8:


Place n=n+1, and return to step 6.

    Step 9:


For the termination condition for repetition computation from step 6 to step 8, convergence of repetition computation is determined, or it is stopped by a predetermined number of times of repetition.
Furthermore, the high resolution color image reconstruction method (image generation method) according to the invention described above can be further expanded to estimate a high resolution image and inter-picture displacement at the same time. This concurrent optimization method (that, is, a concurrent estimation method) is an effective method when the estimation accuracy of displacement between input images is insufficient. The concurrent estimation method of a high resolution image and inter-picture displacement will be described as below.
First, since an evaluation function f(z) is actually a function f(z, s) for an high resolution image and inter-picture displacement, an optimization method that estimates these unknowns at the same time is used to estimate the high resolution image and inter-picture displacement highly accurately.
Subsequently, in order to estimate the high resolution image and inter-picture displacement at the same time, that is, in order to implement concurrent optimization, it is fine to add step A, and step B below after step 8 in the repetition computation described above.

    Step A: Image z(n+1) is fixed to estimate the inter-picture displacement s by the following Equation 45.






  
    
      
        
          s
          
            (
            
              n
              +
              1
            
            )
          
        
        =
        
          arg
          ⁢
          
            
              min
              s
            
            ⁢
            
              
                
                
                  y
                  -
                  
                    
                      A
                      ⁡
                      
                        (
                        s
                        )
                      
                    
                    ⁢
                    
                      z
                      
                        (
                        
                          n
                          +
                          1
                        
                        )
                      
                    
                  
                
                
              
              2
            
          
        
      
    
    
      
        [
        
          Equation
          ⁢
          
            
          
          ⁢
          45
        
        ]
      
    
  




    Step B: Image capturing model A(s(n)) is updated to be A(s(n+1)).

<5> Experiments for Verifying Effectiveness of the Invention and Experimental Results

<5-1> Preparation of Input Image



The high resolution color image reconstruction method according to the invention requires multiple images having undergone aliasing with slightly different motion between individual images. Furthermore, each image has to have an overlap area where image reconstruction is applied. In order to generate an input image like this, for example, it is preferable to continuously shoot scenes by holding a digital still camera (or a digital video camera) in slight vibrations.
Moreover, capturing a single still image of text also provides useful information with respect to the high resolution color image reconstruction method according to the invention. Since a text-document-image includes the same letters or words positioned at different places, it can be considered that this is equal to capturing multiple images having different motions.
<5-2> Evaluation by Simulation
FIG. 8(a) is a standard image (it is also referred to as a reference image) used in simulation. FIG. 8(b) shows a raw color mosaic image generated by simulation from the standard image shown in FIG. 8(a).
FIG. 9 shows image reconstruction results by the high resolution color image reconstruction method according to the invention under various conditions. FIGS. 9(a), (b), (c) and (d) show four reconstructed images where the number M of input images and the resolution enlargement ratio f are varied. The number of input images in FIGS. 9(a) and (c) is one, and the number of input images in FIGS. 9(b) and (d) is eight. Moreover, the resolution enlargement ratio in FIGS. 9(a) and (b) is one, and the resolution enlargement ratio in FIGS. 9(c) and (d) is two. In the image reconstructed by the high resolution color image reconstruction method according to the invention, it is confirmed that high spatial frequency components are truly reconstructed and the generation of false color is suppressed as well.
In the invention, resolution enlargement is not required, and image reconstruction referred to as multi-frame demosaicing can be performed in the particular case where multiple images can be used (see FIG. 9(b)). Besides, in the actual application of the invention, multiple input images are not always obtained. Also in this case, image reconstruction can be performed from a single input image as a special case of the high resolution color image reconstruction method according to the invention (see FIGS. 9(a) and (c)).
FIG. 10 shows images reconstructed by traditional image reconstruction methods. FIGS. 10(a) and (b) show images reconstructed by typical traditional demosaicing techniques. FIGS. 10(c) and (d) show the results that FIGS. 10(a) and (b) are magnified by linear interpolation and bicubic interpolation, respectively. The magnification is two times both for horizontal and vertical directions. The results shown in FIG. 10 reveal well that high resolution is generated from raw data by a simple process and typical artifacts (blur, false color) are generated.
In the simulation experiment, the error between the standard image and the reconstructed image was computed by an RMS value as quantitative evaluation of the high resolution color image reconstruction method according to the invention. FIG. 11 shows relationship between number of input images and RMS value in the high resolution color image reconstruction method according to the invention. In FIG. 11, RMS values by traditional methods (that is, a single input image underwent demosaicing for magnification) are also shown. As apparent from FIG. 11, particularly when multiple input images are obtained, it is apparent that the effect of image reconstruction by the high resolution color image reconstruction method according to the invention significantly appears.
Furthermore, through FIGS. 12 to 20, the significant image reconstruction effect according to the invention described above can be further verified. FIG. 12 shows a reference image used in experiments. FIGS. 13 to 16 show the experimental results that resolution is magnified two times. FIG. 13 shows an input image generated by simulation and used in experiments. FIG. 14 shows an image reconstructed by linear interpolation. FIG. 15 shows an image reconstructed by traditional demosaicing method. FIG. 16 shows an image reconstructed by the invention. The number of input images of FIG. 16 is 16. FIGS. 17 to 20 show the experimental results that resolution is magnified four times. FIG. 17 shows an input image generated by simulation and used in experiments. FIG. 18 shows an image reconstructed by linear interpolation. FIG. 19 shows an image reconstructed by traditional demosaicing method. FIG. 20 shows an image reconstructed by the invention. The number of input images in FIG. 20 is 64.
<5-3> Experiment Using Text-document-image
Here, a single-chip CCD camera was actually used to conduct an experiment that reconstructs a high resolution image from moving pictures. FIG. 21(a) shows the first image of input images. A high resolution image to be reconstructed has resolution four times each in the horizontal and vertical directions with respect to the physical resolution of a CCD. FIG. 21(b) and FIG. 21(c) show the resulting images reconstructed by using traditional methods. In the images, FIG. 21(b) shows the resulting image reconstructed by using linear demosaicing and linear interpolation, and FIG. 21(c) shows the resulting image by using Kodak demosaicing and bicubic interpolation.
On the other hand, FIG. 21(d) shows the resulting image reconstructed by using the high resolution color image reconstruction method according to the invention. The number of input images of FIG. 21(d) is 64. It is apparent that by comparing FIGS. 21(b), (c) and (d) with reach other, the high resolution color image reconstruction method according to the invention brings a reconstructed image more highly excellent than that by the traditional methods.
<5-4> Experiment Using Nature-image
Here, the experimental results that various nature-images are subjects are shown. A 3CCD camera was used for image capturing, and raw data filtered by a Bayer filter on a computer was generated in simulation. FIGS. 22(a1), (a2) and (a3) show images in color mosaic as input images. Among them, FIGS. 22(a1) and (a2) show the results that stationary subjects were captured by using shakes of the camera by hands. FIG. 22(a3) shows the result that the camera was fixed to take a subject swinging in winds. In the case of FIG. 22(a3), since the entire image cannot be expressed by uniform motions, motion parameters are estimated with respect to a local block in the image.
In the experiment using true images, the reconstruction accuracy of an image is not always improved, even though many input images are used. The causes can be considered that the position shift between input images has estimation error, that the position shift cannot be accurately expressed by two parameters, and that the luminance is varied over time. Therefore, in the invention, it is preferable to select an input image from available input image sequence by the following criteria.

    (1) Images close in time are selected from reference input images in priority.
    (2) Images where d1 mod2, d2 mod2, . . . , dM mod2 are uniformly distributed in an area [0,2]×[0,2] are selected in priority.
    (3) Images that have a low matching evaluation value (SSD, SAD, etc.) of the images in the estimation of the position shift between the input images are not selected.


FIGS. 22(b1), (b2), (b3), (c1), (c2) and (c3) show the resulting images reconstructed by using traditional methods. Among them, FIGS. 22(b1), (b2) and (b3) show the resulting images reconstructed by using linear demosaicing and linear interpolation. FIGS. 22(c1), (c2) and (c3) show the resulting images reconstructed by using Kodak demosaicing and bicubic interpolation. On the other hand, FIGS. 22(d1), (d2) and (d3) show the resulting images reconstructed by using the high resolution color image reconstruction method according to the invention. The number of input images in FIGS. 22(d1) and (d2) is 64, and the number of input images in FIG. 22(d3) is 16.
Moreover, the reconstructed high resolution images have a resolution four times the physical resolution of the CCD both in the horizontal and vertical directions with respect to in FIGS. 22(b1), (b2), (c1), (c2), (d1) and (d2), and a resolution two times both in the horizontal and vertical directions in FIGS. 22(b3), (c3) and (d3). It was also confirmed from FIG. 22 that the high resolution color image reconstruction method according to the invention exerts significant effects in the experiment using nature-images as well.
<6> Conclusion
The invention is in which the relationship between raw data obtained from the image sensor (for example, the single-chip CCD) and a color image of a desired resolution is formulated by a direct model to reconstruct a high resolution color image. The invention is characterized in that a high resolution color image having a high resolution exceeding a physical resolution decided by the fabrication steps of an image capturing system can be generated afterward. Furthermore, in the invention, the number of input images and a resolution enlargement ratio can be set freely.
In the invention, the CFA pattern is not limited to the Bayer pattern. Other color systems such as any RGB arrangements or complementary color systems can be incorporated into an observation model. More specifically, the application range of the invention is significantly wide because it is a general method having general versatility in that the CFA pattern applicable in the invention is not specialized for the Bayer pattern and the like.
In addition, the high resolution color image reconstruction method according to the invention can be implemented by a computer program executed by a CPU. Furthermore, it is needless to say that the form where the high resolution color image reconstruction method according to the invention is implemented in a hardware is also included in the invention.
Moreover, in the embodiments described above, the CCD capturing element is taken as an example for the image sensor used for the image capturing system (that is, the image capturing device) in the invention. However, it is needles to say that the invention is not limited thereto, which can be applied to image capturing systems using the other single-chip capturing elements such as a MOS type capturing element, and an image capturing tube.
INDUSTRIAL APPLICABILITY
As described above, according to the invention, the following effect can be obtained.
First, the high resolution color image reconstruction method according to the invention can provide improvements in the image signal process based on the efficient use of input image data, and overcome limitation in the physical resolution of an image sensor used in an image capturing device. Since the high resolution color image reconstruction method according to the invention can magnify image resolution to any desired resolutions without changing hardware of the image capturing device, it is expected to greatly contribute to a reduction in fabrication costs of the image capturing device.
Furthermore, the high resolution color image reconstruction method according to the invention is not a simple combination of traditional techniques formed of demosaicing and gray scale super-resolution. The simple, sequential execution of the two types of traditional techniques results only in reconstructing a low quality image. The high resolution color image reconstruction method according to the invention is an effective image reconstruction method in which a single image process can truly reconstruct high spatial frequency components as well as efficiently suppress the generation of false color for reconstructing a high resolution color image.
Moreover, the high resolution color image reconstruction method according to the invention has general versatility that can set the number of input images and the resolution enlargement ratio to any desired numbers. In the special case where resolution does not need to be magnified, image reconstruction referred to as multi-frame demosaicing can also be conducted.
Besides, the invention can be applied to information devices equipped with a general image capturing device or image capturing function using an image sensor and a CFA array (for example, digital still camera, digital video camera, a cellular phone with a camera, a monitor camera, a celestial observation camera, an endoscope microscope, an industrial camera, etc.). In addition, when there is only raw data obtained from an image sensor (for example, a single-chip CCD), a computer program which the high resolution color image reconstruction method according to the invention is the embodiment of software (application) is executed to obtain a high resolution color image of a given desired resolution.
In the invention, when multiple input images are used, it is effective to shoot so as to generate displacement or deformation between input images. In the situations that generate displacement or deformation between the input images, the following cases are acceptable. For example, the case where an image capturing element is mechanically controlled to obtain an input image displaced by a known travel as well as the case where unknown displacement or deformation is generated between a subject and a camera. The typical cases are: the case where a camera is moved by shakes by hands, and the case where a moving subject is captured by a fixed camera. When displacement or deformation between input images is unknown, it can be estimated beforehand, or it can be computed by the concurrent optimization method described above.
REFERENCE LITERATURE


    [1] Cok, D. R., “Signal processing method and apparatus for producing interpolated chrominance values in a sampled color image signal”, U.S. Pat. No. 4,642,678 (1987)
    [2] Laroche, C. A, M. A., Prescott, “Apparatus and method for adaptively interpolating a full color image utilizing chrominance gradients”, U.S. Pat. No. 5,373,322 (1994)
    [3] T. S. Huang and R. Y. Tsay, “Multiple frame image restoration and registration”, in Advances in Computer Vision and Image Processing, Vol. 1, T. S. Huang, Ed. Greenwich, Conn.: JAI, pp. 317-339 (1984)
    [4] M. Irani and S. Peleg, “Improving resolution by Image Registration”, CVGIP: Graph. Models Image Process, Vol. 53, pp. 231-239, March (1991)
    [5] R. C. Hardie, K. J. Barnard and E. E. Amstrong, “Joint MAP Registration and High-Resolution Image Estimation using a Sequence of Undersampled Images”, IEEE Trans. on Image Processing, Vol. 6, pp. 1621-1633 (1997)
    [6] Masao Shimizu and Masatoshi Okutomi, “Precise sub-pixel estimation on area-based matching”, Proc. 8th IEEE International Conference on Computer Vision (ICCV2001), (Vancouver, Canada), pp. 90-97, July (2001)
    [7] J. Shin, J. Paik, J. R. Price and M. A. Abidi, “Adaptive regularized image interpolation using data fusion and steerable constraints”, In SPIE Visual Communications and Image Processing, Vol. 4310, January (2001)

## Claims

1. A high resolution color image reconstruction method which reconstructs a high resolution color image based on a single input image or a sequence of multiple input images captured by an image capturing device employing an image sensor and a color filter array,
said high resolution color image reconstruction method characterized by
reconstructing said high resolution color image having a predetermined resolution equal to or larger than a physical resolution of said image capturing device; and

comprising the step of:
conducting an image reconstruction process based on prior knowledge that relates to a model of an image capturing system or a subject including known or unknown displacement or deformation generated between said sequence of multiple input images, and then reconstructing said high resolution color image in which even a high spatial frequency component contained in said subject is truly reproduced and occurrence of false color is suppressed.

2. A high resolution color image reconstruction method according to claim 1, wherein in said image reconstruction process, said input image which is obtained from said image capturing device and is a raw data not color interpolated is directly processed.

3. A high resolution color image reconstruction method according to claim 1, wherein in said image reconstruction process, an optimization process of an evaluation function relating to said model of said image capturing system or a color component is conducted.

4. A high resolution color image reconstruction method which reconstructs a high resolution color image based on a single input image or a sequence of multiple input images captured by an image capturing device employing an image sensor and a color filter array,
said high resolution color image reconstruction method characterized by
reconstructing said high resolution color image having a predetermined resolution equal to or larger than a physical resolution of said image capturing device; and
comprising the step of:
conducting an image reconstruction process based on prior knowledge that relates to a model of an image capturing system or a subject including known or unknown displacement or deformation generated between said sequence of multiple input images, and then reconstructing said high resolution color image in which even a high spatial frequency component contained in said subject is truly reproduced and occurrence of false color is suppressed,
wherein in said image reconstruction process, an optimization process of an evaluation function relating to said model of said image capturing system or a color component is conducted,
wherein said evaluation function comprises:
a first term which evaluates fidelity of said high resolution color image being an estimated image with respect to said input images by using an image formation model expressing generation of said high resolution color image from said input images;
a second term which evaluates smoothness in said estimated image by penalizing said estimated image within which neighboring pixel values change abruptly in said input images; and
a third term which evaluates smoothness of chrominance of said estimated image by penalizing said estimated image within which chrominance components change abruptly in said input images.

5. A high resolution color image reconstruction method according to claim 4, wherein said second term serves to obtain a smooth estimated image with preserved edges; and said third term serves to obtain a smooth estimated image with local chrominance continuity and preserved edges.

6. A high resolution color image reconstruction method according to claim 5, wherein:
said evaluation function is determined by following equation:





  
    
      z
      ^
    
    =
    
      arg
      ⁢
      
        
          min
          z
        
        ⁢
        
          {
          
            
              
                f
                1
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                af
                2
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                bf
                3
              
              ⁡
              
                (
                z
                )
              
            
          
          }
        
      
    
  
  ;



said first term is determined by following equation:





  
    
      
        f
        1
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        ∑
        
          k
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              y
              k
            
            -
            
              
                A
                k
              
              ⁢
              z
            
          
          
        
        2
      
    
  
  ;



said second term is determined by following equation:


f2(z)=∥Pz∥2;


said third term is determined by following equation:


f3(z)=∥QTz∥2,


where
yk is a vector which contains pixel values in the k-th image in an input image sequence obtained from said image sensor and said color filter array,
M represents the number of images in said input image sequence,
z is a vector which contains pixel values in said high resolution color image to be estimated and is composed of vectors zR, zG, zB which contain pixel values in red, green, and blue channel of z respectively,
{circumflex over (z)} is a vector which contains pixel values of said high resolution color image obtained by said high resolution color image reconstruction method,
Ak is a matrix which relates yk to z and is determined by properties of said image capturing device,
said properties comprises motion between different said input images y1, y2, . . . , yM, a point spread function of said image capturing device, down-sampling factor by said image sensor and said color filter array,
P and Q are matrices which serve as adaptive or non-adaptive high-pass filter,
T is a matrix which transforms RGB signals to chrominance signals, and
a, b are weight parameters which control influence of f2(z) and f3(z) respectively.

7. A high resolution color image reconstruction method which reconstructs a high resolution color image based on a single input image or a sequence of multiple input images captured by an image capturing device employing an image sensor and a color filter array,
said high resolution color image reconstruction method characterized by
reconstructing said high resolution color image having a predetermined resolution equal to or larger than a physical resolution of said image capturing device; and
comprising the step of:
conducting an image reconstruction process based on prior knowledge that relates to a model of an image capturing system or a subject including known or unknown displacement or deformation generated between said sequence of multiple input images, and then reconstructing said high resolution color image in which even a high spatial frequency component contained in said subject is truly reproduced and occurrence of false color is suppressed,
wherein in said image reconstruction process, an optimization process of an evaluation function relating to said model of said image capturing system or a color component is conducted,
wherein said evaluation function is determined by following equations:





  
    
      z
      ^
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          min
          z
        
        ⁢
        
          {
          
            
              
                f
                1
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                f
                p
              
              ⁡
              
                (
                z
                )
              
            
          
          }
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        1
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        ∑
        
          k
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              y
              k
            
            -
            
              
                A
                k
              
              ⁢
              z
            
          
          
        
        2
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        p
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        
          f
          2
        
        ⁡
        
          (
          
            z
            Y
          
          )
        
      
      +
      
        
          f
          3
        
        ⁡
        
          (
          
            
              z
              Cb
            
            ,
            
              z
              Cr
            
          
          )
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        2
      
      ⁡
      
        (
        
          z
          Y
        
        )
      
    
    =
    
      
        ∑
        
          d
          ∈
          D
        
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              Λ
              d
            
            ⁢
            
              P
              d
            
            ⁢
            
              z
              Y
            
          
          
        
        2
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        3
      
      ⁡
      
        (
        
          
            z
            Cb
          
          ,
          
            z
            Cr
          
        
        )
      
    
    =
    
      
        λ
        c
      
      ⁡
      
        (
        
          
            
              
              
                Hz
                Cb
              
              
            
            2
          
          +
          
            
              
              
                Hz
                Cr
              
              
            
            2
          
        
        )
      
    
  



where:
yk is a vector which contains pixel values in the k-th image in an input image sequence obtained from said image sensor and said color filter array,
M represents the number of images in said input image sequence,
z is a vector which contains pixel values in said high resolution color image to be estimated and is composed of vectors zR, zG, zB which contain pixel values in red, green, and blue channel of z respectively,
{circumflex over (z)} is a vector which contains pixel values of said high resolution color image obtained by said high resolution color image reconstruction method,
Ak is a matrix which relates yk to z and is determined by properties of said image capturing device,
said properties comprises motion between different said input images y1, y2, . . . , yM, a point spread function of said image capturing device, down-sampling factor by said image sensor and said color filter array,
zy is a luminance signal of z, f2(zy) is a regularization term for zy,
zCb, zCr are chrominance signals of z, f2(zCb, zCr) is a regularization term for zCb, zCr,
d is a edge direction in each pixel of zy, i.e. represents any one direction of horizontal, vertical, and diagonal (two ways) directions, no direction (equal to all directions),
Pd is a high-pass operator that evaluates smoothness in said edge direction d,
Λd is a diagonal matrix whose element is a weight with respect to a high-pass operation in said edge direction d,
H is an isotropic high-pass filter, and
λc is a weighting parameter.

8. A high resolution color image reconstruction method according to claim 1, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

9. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 1.

10. A high resolution color image reconstruction apparatus according to claim 9, wherein said single-chip capturing element is a CCD.

11. A high resolution color image reconstruction computer program embodied in a computer-readable medium which reconstructs a high resolution color image based on a single input image or a sequence of multiple input images captured by an image capturing device employing an image sensor and a color filter array,
said high resolution color image reconstruction computer program is executable with a computer, comprising the function of:
reconstructing said high resolution color image having a predetermined resolution equal to or larger than a physical resolution of said image capturing device;

and further comprising the function of:
conducting an image reconstruction process based on prior knowledge that relates to a model of an image capturing system or a subject including known or unknown displacement or deformation generated between said sequence of multiple input images, and then reconstructing said high resolution color image in which even a high spatial frequency component contained in said subject is truly reproduced and occurrence of false color is suppressed.

12. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 11, wherein in said image reconstruction process, said input image which is obtained from said image capturing device and is a raw data not color interpolated is directly processed.

13. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 11, wherein in said image reconstruction process, an optimization process of an evaluation function relating to said model of said image capturing system or a color component is conducted.

14. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 13, wherein said evaluation function comprises:
a first term which evaluates fidelity of said high resolution color image being an estimated image with respect to said input images by using an image formation model expressing generation of said high resolution color image from said input images;
a second term which evaluates smoothness in said estimated image by penalizing said estimated image within which neighboring pixel values change abruptly in said input images; and
a third term which evaluates smoothness of chrominance of said estimated image by penalizing said estimated image within which chrominance components change abruptly in said input images.

15. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 14, wherein said second term serves to obtain a smooth estimated image with preserved edges; and
said third term serves to obtain a smooth estimated image with local chrominance continuity and preserved edges.

16. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 15, wherein:
said evaluation function is determined by following equation:





  
    
      z
      ^
    
    =
    
      arg
      ⁢
      
        
          min
          z
        
        ⁢
        
          {
          
            
              
                f
                1
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                af
                2
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                bf
                3
              
              ⁡
              
                (
                z
                )
              
            
          
          }
        
      
    
  
  ;



said first term is determined by following equation:





  
    
      
        f
        1
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        ∑
        
          k
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              y
              k
            
            -
            
              
                A
                k
              
              ⁢
              z
            
          
          
        
        2
      
    
  
  ;



said second term is determined by following equation:


f2(z)=∥Pz∥2; and


said third term is determined by following equation:


f3(z)=∥QTz∥2,


where
yk is a vector which contains pixel values in the k-th image in an input image sequence obtained from said image sensor and said color filter array,
M represents the number of images in said input image sequence,
z is a vector which contains pixel values in said high resolution color image to be estimated and is composed of vectors zR, zG, zB which contain pixel values in red, green, and blue channel of z respectively,
{circumflex over (z)} is a vector which contains pixel values of said high resolution color image obtained by said high resolution color image reconstruction method,
Ak is a matrix which relates yk to z and is determined by properties of said image capturing device,
said properties comprises motion between different said input images y1, y2, . . . , yM, a point spread function of said image capturing device, down-sampling factor by said image sensor and said color filter array,
P and Q are matrices which serve as adaptive or non-adaptive high-pass filter,
T is a matrix which transforms RGB signals to chrominance signals, and
a, b are weight parameters which control influence of f2(z) and f3(z) respectively.

17. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 13, wherein said evaluation function is determined by following equations:




  
    
      z
      ^
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          min
          z
        
        ⁢
        
          {
          
            
              
                f
                1
              
              ⁡
              
                (
                z
                )
              
            
            +
            
              
                f
                p
              
              ⁡
              
                (
                z
                )
              
            
          
          }
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        1
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        ∑
        
          k
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              y
              k
            
            -
            
              
                A
                k
              
              ⁢
              z
            
          
          
        
        2
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        p
      
      ⁡
      
        (
        z
        )
      
    
    =
    
      
        
          f
          2
        
        ⁡
        
          (
          
            z
            Y
          
          )
        
      
      +
      
        
          f
          3
        
        ⁡
        
          (
          
            
              z
              Cb
            
            ,
            
              z
              Cr
            
          
          )
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        2
      
      ⁡
      
        (
        
          z
          Y
        
        )
      
    
    =
    
      
        ∑
        
          d
          ∈
          D
        
      
      ⁢
      
        
      
      ⁢
      
        
          
          
            
              Λ
              d
            
            ⁢
            
              P
              d
            
            ⁢
            
              z
              Y
            
          
          
        
        2
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        f
        3
      
      ⁡
      
        (
        
          
            z
            Cb
          
          ,
          
            z
            Cr
          
        
        )
      
    
    =
    
      
        λ
        c
      
      ⁡
      
        (
        
          
            
              
              
                Hz
                Cb
              
              
            
            2
          
          +
          
            
              
              
                Hz
                Cr
              
              
            
            2
          
        
        )
      
    
  



where:
yk is a vector which contains pixel values in the k-th image in an input image sequence obtained from said image sensor and said color filter array,
M represents the number of images in said input image sequence,
z is a vector which contains pixel values in said high resolution color image to be estimated and is composed of vectors zR, zG, zB which contain pixel values in red, green, and blue channel of z respectively,
{circumflex over (z)} is a vector which contains pixel values of said high resolution color image obtained by said high resolution color image reconstruction method,
Ak is a matrix which relates yk to z and is determined by properties of said image capturing device,
said properties comprises motion between different said input images y1, y2, . . . , yM, a point spread function of said image capturing device, down-sampling factor by said image sensor and said color filter array,
zy is a luminance signal of z, f2(zy) is a regularization term for zy,
zCb,zCr are chrominance signals of z, f2(zCb,zCr) is a regularization term for zCb,zCr,
d is a edge direction in each pixel of zy, i.e. represents any one direction of horizontal, vertical, and diagonal (two ways) directions, no direction (equal to all directions),
Pd is a high-pass operator that evaluates smoothness in said edge direction d,
Λd is a diagonal matrix whose element is a weight with respect to a high-pass operation in said edge direction d,
H is an isotropic high-pass filter, and
λc is a weighting parameter.

18. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 11, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

19. A high resolution color image reconstruction method according to claim 2, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

20. A high resolution color image reconstruction method according to claim 3, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

21. A high resolution color image reconstruction method according to claim 4, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

22. A high resolution color image reconstruction method according to claim 5, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

23. A high resolution color image reconstruction method according to claim 6, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

24. A high resolution color image reconstruction method according to claim 7, further comprising the step of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

25. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 2.

26. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 3.

27. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 4.

28. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 5.

29. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 6.

30. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 7.

31. A high resolution color image reconstruction apparatus characterized in that it is a single-chip image capturing device employing a single-chip capturing element and using said high resolution color image reconstruction method according to claim 8.

32. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 12, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

33. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 13, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

34. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 14, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

35. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 15, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

36. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 16, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.

37. A high resolution color image reconstruction computer program embodied in a computer-readable medium according to claim 17, further comprising the function of:
estimating said displacement or deformation between said input images at the same time as said high resolution color image.