# Patent

## Title
Motion/saturation detection system and method for synthesizing high dynamic range motion blur free images from multiple captures

## Abstract

Motion/Saturation detection system and method for synthesizing high dynamic range motion blur free images from multiple captures, the system and method utilizing photocurrent estimation to reduce read noise and enhance dynamic range at the low illumination end, saturation detection to enhance dynamic range at the high illumination end, and motion blur detection to ensure the photocurrent estimation is not corrupted by motion. Motion blur detection also makes it possible to extend exposure time and to capture more images, which can be used to further enhance dynamic range at the low illumination end. The present invention operates completely locally, making it well suited for single chip digital camera implementations.

## Background
CROSS-REFERENCES TO RELATED APPLICATIONS
This application relates to a co-pending U.S. patent application Ser. No. 09/992,497 filed Nov. 13, 2001, and entiled, “Photocurrent Estimation from Multiple Captures for Simultaneous SNR and Dynamic Range Improvement in CMOS Image Sensors”, which is hereby incorporated herein by reference.
This application relates to U.S. patent application Ser. No. 09/962,804, titled “CMOS Image Sensor System with Self-Reset Digital Pixel Architecture for Improving SNR and Dynamic Range”, and Ser. No. 09/962,847, titled “Method for Improving SNR in Low Illumination Conditions in a CMOS Video Sensor System Using a Self-Resetting Digital Pixel”, both of which were filed on Sep. 24, 2001, are assigned to the same assignee as the present application, and are hereby incorporated herein by reference.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to photocurrent estimation and, more particularly, to photocurrent estimation from multiple captures for simultaneously improving signal-to-noise ratio (SNR) and dynamic range in complementary metal oxide semiconductor (CMOS) image sensor systems.
2. Description of the Related Art
An image sensor converts an optical image focused on the sensor into electrical signals. The electrical signals represent the intensity of the image. It is important that the image sensor be usable under a variety of lighting conditions because the wider the variety of lighting conditions under which the image sensor is usable the better the image quality. Consequently, the quality of an imaging system is commonly measured by the image sensor's dynamic range and its ability to mask noises, i.e., its SNR, under low light conditions.
The dynamic range of an image sensor measures how wide a range of lighting the sensor can accurately capture. For example, a scene including both a tree lit by bright sunlight and a person standing under the tree has a high dynamic range. This high dynamic range makes it difficult for the image sensor, such as one used in a camera, a video recorder, or a security monitor, to capture details of both the brightly lit tree and the person standing in the tree's shadow.
The wider the dynamic range of the image sensor, the more details can be shown under extreme conditions and thus the more versatile the associated imaging system becomes. For example, with a wide dynamic range, a novice or an inexperienced imaging system user can take great pictures or videos without worrying much about lighting conditions and/or corresponding settings. Even an advanced or experienced user is likely to enjoy the convenience and advantages of a wide dynamic range imaging system.
The SNR of an image sensor measures the ratio between the signal and its associated noise. An image sensor with low SNR will have an objectionable amount of static-like or grain-like noise appearing in the captured image, while an image sensor with high SNR can be used under low lighting conditions, such as in a room lit only by candlelight. Clearly, an ideal imaging system would desirably have a high SNR as well as a wide dynamic range.
Another desirable feature of an ideal imaging system is the prevention/elimination of motion blur, allowing a quality image to be captured from a moving subject. In the case of a camera, motion blur may be controlled by shutter speed. However, the effectiveness of this technique is dependent upon illumination level. As such, a highly desirable imaging system would be one that is capable of automatically adjusting itself in order to compensate a wide range of illumination levels and one that produces noise free and motion blur free high quality images even when the subject may be moving fast and/or unexpectedly. Virtually all imaging systems and image sensing devices can benefit from utilizing image sensors that offer wider dynamic range, higher SNR, and motion blur free images.
Most of today's imaging systems and image sensing devices such as video and digital cameras use charge-coupled device (CCD) image sensors. In CCD image sensors, the electric charge collected by the photo detector array during exposure time is serially shifted out of the sensor chip, resulting in slow readout speed and high power consumption. Furthermore, since CCDs are fabricated in a non-standard technology, other analog and digital camera functions such as A/D conversion, image processing and compression, control and storage cannot be integrated with the sensor on the same chip and must be implemented using several other chips. Such implementation can be quite expensive because of the specialized processing involved for CCDs.
CCD image sensors are well known in the art and thus are not described herein. An exemplary teaching can be found in U.S. Pat. No. 5,272,535, which is incorporated herein by reference, titled “Image Sensor with Exposure Control, Selectable Interlaced, Pseudo Interlaced or Non-Interlaced Readout and Video Compression”, issued to Elabd of Sunnyvale, Calif., and assigned to Loral Fairchild Corporation, Syosset, N.Y., December 1993.
The CMOS technology provides the possibility of integrating image sensing and digital signal processing on the same chip, resulting faster, smaller, less expensive, and lower power image sensing devices. The advantages of CMOS image sensors over CCD image sensors are well known. An exemplary teaching, which is incorporated herein by reference, can be found in Wong's “Technology and Device Scaling Considerations for CMOS Imagers”.
Recently developed CMOS image sensors are read out non-destructively and in a manner similar to a digital memory and can thus be operated at very high frame rates. Several high speed CMOS Active Pixel Sensors have been recently reported. In “A High Speed, 500 Frames/s, 1024×1024 CMOS Active Pixel Sensor”, Krymski et al. describe a 1024×1024 CMOS image sensor that achieves 500 frames per a second. Stevanovic et al. describe in “A CMOS Image Sensor for High Speed Imaging” a 256×256 sensor achieving 1000 frames per a second. In “A 10,000 Frames/s 10.18 μm CMOS Digital Pixel Sensor with Pixel-Level Memory”, Kleinfelder et al. describe a 352×288 CMOS Digital Pixel Sensor achieving 10,000 frames per a second.
Unlike CCD image sensors, a CMOS image sensor can be integrated with other camera functions on the same chip ultimately leading to a single-chip digital camera with very small size, low power consumption and additional functionality. The integration of processing and image capture coupled with high frame rate capability of CMOS image sensors enable efficient implementations of many still and standard video imaging applications. A drawback, however, is that CMOS image sensors generally suffer from lower dynamic range and SNR than CCDs due to their high readout noise and non-uniformity.
It has been proposed to enhance dynamic range via multiple image captures (multiple sampling). The idea is to capture several images at different times within the normal exposure time—shorter exposure time images capture the brighter areas of the scene while longer exposure time images capture the darker areas of the scene. (In video imaging applications, the video frame rate sets an upper bound on the exposure time. In digital still photography, the maximum exposure time is limited by possible motion of the digital camera, possible motion of the subject, and saturation of the sensors.) A high dynamic range image is then synthesized from the multiple captures by appropriately scaling each pixel's last sample before saturation.
In “Comparative Analysis of SNR for Image Sensors with Enhanced Dynamic Range”, which is hereby incorporated herein by reference, Yang et al. show that this scheme achieves higher SNR than other dynamic range enhancement implementations. However, this scheme does not take full advantage of the captured images. Since readout noise is not reduced, dynamic range is only extended at the high illumination end. Furthermore, according to this prior art scheme, although dynamic range can be extended at the low illumination end by increasing exposure time, such increase in exposure time results in unacceptable blur due to motion or change of illumination.
BRIEF SUMMARY OF THE INVENTION
Accordingly, it is a primary object of the present invention to provide a novel dynamic range enhancement that overcomes weaknesses and drawbacks of prior art dynamic range enhancement schemes.
It is an object of the present invention to provide novel apparatuses, systems, and methods for synthesizing high dynamic range, motion blur free images from multiple captures in a CMOS image sensor system.
It is another object of the present invention to provide photocurrent estimation systems and methods for estimating photocurrent from multiple captures, the inventive photocurrent estimation systems and methods improving both the SNR and dynamic range in a CMOS image sensor even under low illumination.
It is yet another object of the present invention to provide motion/saturation detection systems and methods for improving the SNR and enhancing the dynamic range in a CMOS image sensor system while ensuring the integrity of the inventive photocurrent estimation, the motion/saturation detection updates the photocurrent estimation in accordance with a determination whether motion blur/saturation has occurred.
It is a further object of the present invention to provide imaging system and apparatuses capable of generating high quality images without motion blur and/or noise even at high speed, with longer exposure time beyond standard, and/or under low illumination.
It is another object of the present invention to anticipate easy, fast, simple, efficient and economical implementations of the inventive algorithms. The algorithms operate completely locally, i.e., each image pixel's final value is computed using only its captured values, and recursively, thereby requiring only a small constant number of values per pixel be stored, the constant number being independent to the number of images captured.
It is therefore a further object of the present invention to implement the inventive algorithms on a single chip digital camera with increased SNR and enhanced dynamic range, the digital camera capable of capturing multiple samples in an exposure time and generating high quality images without motion blur even under low illumination.
Still further objects and advantages of the present invention will become apparent to one of ordinary skill in the art upon reading and understanding the following drawings and detailed description of the preferred embodiments. As it will be appreciated by one of ordinary skill in the art, the present invention may take various forms and may comprise various components and steps and arrangements thereof. Accordingly, the drawings are for purposes of illustrating a preferred embodiment(s) of the present invention and are not to be construed as limiting the present invention.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic representation of an image sensor model that can be implemented to benefit from embodiments of the present invention.
FIG. 2 shows electric charge vs. time for pixel under three lighting conditions.
FIG. 3 shows (a) a scene where a bright square object moving diagonally across still dark background; (b) the final image generated with long exposure time; (c) the final image generated with short exposure time; and (d) the final image generated in accordance with an embodiment of the present invention.
FIG. 4 is a high level flow chart showing high dynamic range, motion blur free synthesis from multiple captures according to another embodiment of the present invention.
FIG. 5 is a diagram showing estimation weights used in the recursive embodiment of the present invention.
FIG. 6 is a diagram showing equivalent readout noise versus number of samples according to various embodiments of the present invention.
FIG. 7 is a diagram showing soft decision motion detection according to yet another embodiment of the present invention.
FIG. 8 is a diagram showing optimal integration time under motion according to the principles of the present invention.
FIG. 9 is a diagram showing SNR and dynamic range being enhanced in accordance with an embodiment of the present invention.
FIG. 10 shows an example of motion blur elimination achieved with an embodiment of the present invention were (a) shows a first position of a dancer at start of an exposure time, (b) shows a second position of the dancer at end of the exposure time, (c) is a final image generated by a conventional sensor, and (d) is a final image generated in accordance with the teachings of the present invention.
FIG. 11 shows an exemplary recursive estimation system according to an aspect of the present invention.



DETAILED DESCRIPTION OF THE INVENTION
CMOS image sensors are known to be capable of non-destructive readout at very high frame rate. This high speed image readout capability, which makes it possible to capture multiple images within a normal exposure time, and the potential of integrating memory and signal processing with the image sensor on the same chip enable the implementation of many new imaging applications.
Prior implementations have demonstrated the use of this capability to enhance the image sensor dynamic range. The idea is to capture several frames during a normal exposure time and combine them into one single dynamic range image. These prior implementations, however, do not reduce read noise and thus only enhance the image sensor's dynamic range at the high illumination end. For example, as described herein, it has been proposed to simply scale each pixel's last sample before saturation for the synthesis. However, because read noise is not reduced, this prior art method only increases dynamic range at high illumination end and it suffers from potential motion blur.
Overcoming the weaknesses and drawbacks of prior art teachings, the present invention provides novel apparatuses, systems and methods for synthesizing a high dynamic range image from multiple captures while avoiding motion blur. An image sensor model with which the present invention may be integrated will first be described and various embodiments will next be described herein.
An Image Sensor Model
As shown in FIG. 1, a typical image sensor 100 used in an analog or digital camera generally consists of a two dimensional (2D) array of pixels 110. Each pixel 120 may include a photodiode 121, a reset transistor 123, and several other readout transistors in readout circuit 125. The photodiode is reset before the beginning of capture. During capture, each pixel converts incident light into photocurrent iph(t), for 0≦t≦T, where T is the exposure time. This process is quite linear and thus iph(t) is a good measure of incident light intensity.
Since the photocurrent is too small to measure directly, it is integrated onto the photodiode parasitic capacitor 122 and the charge (or voltage) Q(T) 130 is read out at the end of exposure time T. Dark current idc and additive noise corrupt the output signal charge. The noise can be expressed as sum of following three independent components:

    
    
        Shot noise U(T), which is normalized (zero mean) Poisson distributed. Here the photocurrent is assumed to be large enough and thus shot noise can be approximated by a Gaussian
    
    






  
    
      U
      ⁢
      
        (
        T
        )
      
    
    ∼
    
      N
      ⁢
      
        (
        
          0
          ,
          
            q
            ⁢
            
              
                ∫
                0
                T
              
              ⁢
              
                
                  (
                  
                    
                      
                        i
                        ph
                      
                      ⁢
                      
                        (
                        t
                        )
                      
                    
                    +
                    
                      i
                      dc
                    
                  
                  )
                
                ⁢
                
                  d
                  t
                
              
            
          
        
        )
      
    
  
  ,




where q is the electron charge.

    
    
        Reset noise (including offset fixed pattern noise (FPN)) C ̃N(0,σCc).
        Readout circuit noise V(T) (including quantization noise) with zero mean and variance σV2.
    
    


Thus, the output charge from a pixel can be expressed as




  
    
      
        
          
            Q
            ⁡
            
              (
              T
              )
            
          
          =
          
            
              
                ∫
                0
                T
              
              ⁢
              
                
                  (
                  
                    
                      
                        i
                        ph
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    +
                    
                      i
                      dc
                    
                  
                  )
                
                ⁢
                
                  d
                  t
                
              
            
            +
            
              U
              ⁡
              
                (
                T
                )
              
            
            +
            
              V
              ⁡
              
                (
                T
                )
              
            
            +
            C
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




provided Q(T)≦Qsat, the saturation charge, also referred to as well capacity. If photocurrent is constant over exposure time, signal-to-noise ratio (SNR) is given by





  
    
      
        
          SNR
          ⁡
          
            (
            
              i
              ph
            
            )
          
        
        =
        
          20
          ⁢
          
            
          
          ⁢
          
            log
            10
          
          ⁢
          
            
              
                
                  i
                  ph
                
                ⁢
                T
              
              
                
                  
                    
                      q
                      ⁡
                      
                        (
                        
                          
                            i
                            ph
                          
                          +
                          
                            i
                            dc
                          
                        
                        )
                      
                    
                    ⁢
                    T
                  
                  +
                  
                    σ
                    V
                    2
                  
                  +
                  
                    σ
                    C
                    2
                  
                
              
            
            .
          
        
      
    
    
      
        (
        2
        )
      
    
  




Note that SNR increases with iph, first at 20 dB per decade when reset and readout noise variance dominates, and then at 10 dB per decade when shot noise variance dominates. SNR also increases with T. Thus it is always preferred to have the longest possible exposure time. Saturation and change in photocurrent due to motion, however, makes it impractical to make exposure time too long.
Dynamic range is a critical figure of merit for image sensors. It is defined as the ratio of the largest non-saturating photocurrent imax to the smallest detectable photocurrent imin, typically defined as the standard deviation of the noise under dark conditions. Using the sensor model, dynamic range can be expressed as




  
    
      
        DR
        =
        
          
            20
            ⁢
            
              
            
            ⁢
            
              log
              10
            
            ⁢
            
              
                i
                max
              
              
                i
                min
              
            
          
          =
          
            20
            ⁢
            
              
            
            ⁢
            
              log
              10
            
            ⁢
            
              
                
                  
                    Q
                    sat
                  
                  -
                  
                    
                      i
                      dc
                    
                    ⁢
                    T
                  
                
                
                  
                    
                      q
                      ⁢
                      
                        
                      
                      ⁢
                      
                        i
                        dc
                      
                      ⁢
                      T
                    
                    +
                    
                      σ
                      V
                      2
                    
                    +
                    
                      σ
                      C
                      2
                    
                  
                
              
              .
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




Note that dynamic range decreases as exposure time increases due to the adverse effects of dark current. To increase dynamic range, one needs to either increase well capacity Qsat, and/or decrease read noise σV2. Prior art methods for enhancing sensor dynamic range have focused on effectively increasing well capacity by reducing exposure time T, which only increases dynamic range at the high illumination end. The present invention provides increased dynamic range and reduced read noise even at the low illumination end.
High Dynamic Range Image Synthesis
Referring now to FIG. 2 where the effect of three different lighting conditions with respect to photocurrent estimation is illustrated. As shown in the top plot of FIG. 2, under a constant low light, the photocurrent can be well estimated from Q(T). In a case of a constant high light, as shown in the middle plot of FIG. 2, where Q(T)=Qsat, the photocurrent cannot be well estimated from Q(T). The bottom plot of FIG. 2 shows that the lighting condition changes during exposure time, e.g., due to motion. In this case, photocurrent at the beginning of exposure time iph(0) again cannot be well estimated from Q(T).
To avoid saturation and the change of iph(t) due to motion, exposure time may be shortened, e.g., to T in FIG. 2. Since in conventional sensor operation, exposure time is set globally for all pixels, this results in reduction of SNR, i.e., much noisier, especially for pixels under low light.
Such weakness of conventional pixel operation is further demonstrated in FIG. 3 where a bright square object moves diagonally across a dark background. Ideally, an image captured during such movement should be free of noise and motion blur as shown in (a). In conventional pixel operation, however, setting long exposure time achieves high SNR (less noise) but results in significant motion blur as shown in (b). On the other hand, if exposure time is set short to reduce motion blur, SNR deteriorates resulting in noisy image as shown in (c). As shown in (d), image captured according to the principles of the present invention does not suffer from motion blur, as in (b), or noise, as in (c), and is substantially close to ideal, as in (a). The present invention disclosed herein clearly and advantageously overcomes the shortcomings of the conventional pixel operation.
With recent advances in CMOS image sensor technology, it is now possible to capture and nondestructively read out, i.e., without resetting, several images within a normal exposure time. As such, pixel exposure time can be “adapted” to its lighting condition so that pixels with high light have short exposure times while pixels with low light have long exposure times. For example, referring to FIG. 2, if four images are captured at τ, 2τ, 3τ, and T=4τ, the photocurrent for the high light pixel can be estimated using the images captured at τ and 2τ, while for the low light pixel it can be estimated using the four images. Motion blur in the third case can be reduced by using the first capture only to estimate photocurrent at the beginning of exposure time iph(0).
Prior art studies have shown that it is possible to estimate photocurrent at the beginning of exposure time using captured image. Yang et al. disclose an estimation method in “A 640×512 CMOS image sensor with ultra-wide dynamic range floating-point pixel level ADC” in which a last sample before saturation is used to estimate photocurrent. This estimation method, however, does not address motion blur. Accordingly, this method produces images similar to one that is shown in (b) of FIG. 3. The novel photocurrent estimation algorithms described herein employ all samples before saturation and produce almost blur free and less noisy images such as one that is shown in (d) of FIG. 3.
Referring now to FIG. 4, wherein a high level flow chart of a high dynamic range, motion blur free image synthesis with multiple captures utilizing the novel estimation and motion/saturation detection algorithms according to the present invention is provided. The image synthesis algorithm according to the present invention essentially operates on n images captured at times τ, 2τ, . . . , nτ=T as follows:

    1. Capture a first image, set k=1;
    2. Estimate, for each pixel, photocurrent Îk from Q(τ);
    3. Capture next image;
    4. Determine, for each pixel, whether motion/saturation has occurred.
    5. Repeat steps 3 and 4 until k=n.


In step 4, if motion is detected, set final photocurrent estimate: În=Îk. On the other hand, if no motion is detected, or if a decision is deferred, the system finds a current estimate Îk+1 from Q((k+1)τ) and Îk and set k=k+1.
Note this image synthesis algorithm actually operates on n+1 images. The first image, which is ignored here, is taken at t=0 and is used to reduce reset noise and offset FPN as discussed in detail herein.
Photocurrent Estimation Dynamic range at the low illumination end can be enhanced using multiple captures by appropriately averaging each pixel's photocurrent samples to reduce readout noise. Since the sensor noise depends on the signal and the photocurrent samples are dependent, equal weight averaging may not reduce readout noise and can in fact be worse than simply using the last sample before saturation to estimate photocurrent. The present inventive estimation system avoids this potential pitfall by utilizing linear mean square estimation (MSE) to derive optimal weights used in the averaging process. Furthermore, the present invention provides means for determining whether to include the last sample before saturation/motion in the estimation.
To maximize the likelihood of finding the best and most unbiased estimate and achieve the smallest probability of error, the present invention provides estimation solutions for the following three scenarios:
(1) when reset noise and offset FPN are ignored;
(2) when reset noise and FPN are considered; and
(3) when reset noise as well as FPN are considered without the need to store all the samples (a recursive solution).
These scenarios can be formulated as follows. Assume n+1 pixel charge samples Qk are captured at times 0, τ, 2τ, . . . , nτ=T. Define the pixel current i=iph+idc. The kth charge sample is thus given by




  
    
      Q
      k
    
    =
    
      
        ik
        ⁢
        
          
        
        ⁢
        τ
      
      +
      
        
          ∑
          
            j
            =
            1
          
          k
        
        ⁢
        
          U
          j
        
      
      +
      
        V
        k
      
      +
      C
    
  
  ,
  
    
      for
      ⁢
      
        
      
      ⁢
      0
    
    ≤
    k
    ≤
    n
  
  ,




where Vk is the readout noise of the kth sample, Uj is the shot noise generated during the time interval ((j−1)τ, jτ), and C is the reset noise. The Uj's, Vk, and C are independent zero mean random variables with

E(Vk2)=σV2>0, for 0≦k≦n,

E(Uj2)=σU2=qiτ, for 1≦j≦k, and

E(C2)=σC2.

Ideally, the signal i is estimated from n+1 samples. Due to motion and/or saturation, however, the estimation may not use all n+1 samples. Note estimation parameters can be formulated using several criteria, such as likelihood ratio and mean square error. As is known in the art, maximum likelihood estimation achieves the smallest probability of error, but is generally difficult to derive and may lead to non-linear solutions that are not easy to implement in practice. An exemplary teaching, which is hereby incorporated herein by reference, on the principles and problems related to parameter estimation can be found in “Parameter Estimation, Principles and Problems” by H. Sorenson. Accordingly, the present invention focuses on linear minimum mean square estimation (MMSE).
A preferred goal of the present invention is to find, at time kτ, the best unbiased linear mean square estimate Îk of the parameter I, given {Q0, Q1, . . . , Qk}, i.e., find coefficients b0(k), b1(k), . . . , bk(k) such that




  
    
      
        
          
            
              I
              ^
            
            k
          
          =
          
            
              ∑
              
                j
                =
                0
              
              k
            
            ⁢
            
              
                b
                j
                
                  (
                  k
                  )
                
              
              ⁢
              
                Q
                j
              
            
          
        
        ,
      
    
    
      
        (
        4
        )
      
    
  




minimizes mean square error (MSE) Φk2=E(Îk−i)2,

subject to a linear constraint E(Îk)=i where superscript (k) represents number of captures used while subscript k serves as index of the coefficients for each capture.

Having stated the preferred goal, estimation solutions for the three scenarios will now be described. For exhaustive details on respective mathematical models and corresponding calculations, readers are referred to Applicants' publication, “Photocurrent Estimation from Multiple Non-Destructive Samples in a CMOS Image Sensor”, Proc. of SPIE, Vol. 4306, March 2001, the publication of which is hereby expressly incorporated herein by reference in its entirety.
Estimation for Scenario (1)—A Recursive Solution
Ignoring reset noise and offset FPN, i.e., setting C=0, although not realistic for CMOS sensors, is reasonable for high-end CCD's with very high resolution analog to digital converter (ADC). With this reasonable assumption, optimal estimate can be formed in a recursive manner, which is not the case when reset noise is considered. To derive the best estimate, the pixel current samples is defined as




  
    
      
        I
        ~
      
      k
    
    =
    
      
        
          Q
          k
        
        
          k
          ⁢
          
            
          
          ⁢
          τ
        
      
      =
      
        i
        +
        
          
            
              ∑
              
                j
                =
                1
              
              k
            
            ⁢
            
              U
              j
            
          
          
            k
            ⁢
            
              
            
            ⁢
            τ
          
        
        +
        
          
            V
            k
          
          
            k
            ⁢
            
              
            
            ⁢
            τ
          
        
      
    
  
  ,
  
    
      for
      ⁢
      
        
      
      ⁢
      1
    
    ≤
    k
    ≤
    
      n
      .
    
  




That is, given samples {Î1, Î2, . . . , Îk}, the goal is to find the best unbiased linear estimate Îk of the parameter i, i.e., weights a1(k), a2(k), . . . , ak(k), such that




  
    
      
        
          
            
              I
              ^
            
            k
          
          =
          
            
              ∑
              
                j
                =
                1
              
              k
            
            ⁢
            
              
                a
                j
                
                  (
                  k
                  )
                
              
              ⁢
              
                
                  I
                  ~
                
                j
              
            
          
        
        ,
      
    
    
      
        (
        5
        )
      
    
  




that minimizes mean square error (MSE) Φk2=E(Îk−i)2, subject to a linear constraint E(Îk)=i.

Exemplary teachings on finding optimal weights using predefined conditions can be found in the previously referenced and incorporated Applicants' publication, “Photocurrent Estimation from Multiple Non-Destructive Samples in a CMOS Image Sensor”.
The optimal estimate Îk in this case can be cast in a recursive form. For example, define a set of weights as bj, such that




  
    
      
        
          
            b
            1
          
          =
          1
        
        ,
        
          

        
        ⁢
        
          
            b
            j
          
          =
          
            
              
                jb
                1
              
              +
              
                
                  j
                  
                    j
                    -
                    1
                  
                
                ⁢
                
                  b
                  
                    j
                    -
                    1
                  
                
              
              +
              
                
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    
                      σ
                      U
                      2
                    
                  
                  
                    σ
                    V
                    2
                  
                
                ⁢
                
                  (
                  
                    
                      ∑
                      
                        l
                        =
                        1
                      
                      
                        j
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        b
                        l
                      
                      l
                    
                  
                  )
                
                ⁢
                
                  
                
                ⁢
                for
                ⁢
                
                  
                
                ⁢
                j
              
            
            ≥
            2.
          
        
      
    
    
      
        (
        6
        )
      
    
  




Accordingly, aj(k) can be represented in terms of bj such that





  
    a
    j
    
      (
      k
      )
    
  
  =
  
    
      
        
          b
          j
        
        
          
            ∑
            
              l
              =
              1
            
            k
          
          ⁢
          
            b
            l
          
        
      
      ⁢
      for
      ⁢
      
        
      
      ⁢
      1
    
    ≤
    j
    ≤
    
      k
      .
    
  




As such, the optimal photocurrent estimate Îk can be written in a recursive form in terms of bk, the latest photocurrent sample Îk, and the previous estimate Îk−1 as




  
    
      
        
          
            
              
                I
                ^
              
              k
            
            =
            
              
                
                  I
                  ^
                
                
                  k
                  -
                  1
                
              
              +
              
                
                  h
                  x
                
                ⁡
                
                  (
                  
                    
                      
                        I
                        ~
                      
                      k
                    
                    -
                    
                      
                        I
                        ^
                      
                      
                        k
                        -
                        1
                      
                    
                  
                  )
                
              
            
          
          ,
          
            

          
          ⁢
          where
        
        ⁢
        
          

        
        ⁢
        
          
            h
            k
          
          =
          
            
              
                
                  b
                  k
                
                
                  g
                  k
                
              
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              
                g
                k
              
            
            =
            
              
                ∑
                
                  l
                  =
                  1
                
                k
              
              ⁢
              
                
                  b
                  l
                
                .
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




The MSE can also be expressed in a recursive form such that




  
    
      
        
          Φ
          k
          2
        
        =
        
          
            
              
                g
                
                  k
                  -
                  1
                
                2
              
              
                g
                k
                2
              
            
            ⁢
            
              Φ
              
                k
                -
                1
              
              2
            
          
          +
          
            
              1
              
                g
                k
                2
              
            
            ⁢
            
              (
              
                
                  
                    (
                    
                      
                        2
                        ⁢
                        
                          b
                          k
                        
                        ⁢
                        
                          g
                          
                            k
                            -
                            1
                          
                        
                      
                      +
                      
                        b
                        k
                        2
                      
                    
                    )
                  
                  ⁢
                  
                    
                      σ
                      U
                      2
                    
                    
                      k
                      ⁢
                      
                        
                      
                      ⁢
                      
                        τ
                        2
                      
                    
                  
                
                +
                
                  
                    b
                    k
                    2
                  
                  ⁢
                  
                    
                      σ
                      V
                      2
                    
                    
                      
                        (
                        
                          k
                          ⁢
                          
                            
                          
                          ⁢
                          τ
                        
                        )
                      
                      2
                    
                  
                
              
              )
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




This is important because the MSE is also used in the novel motion/saturation detection algorithm described herein.
The initial conditions for computing the estimate and its MSE are as follows: b1=1; approximate the first estimator Î1 by Ĩ1 and




  
    Φ
    1
    2
  
  =
  
    
      
        σ
        U
        2
      
      
        τ
        2
      
    
    +
    
      
        
          σ
          V
          2
        
        
          τ
          2
        
      
      .
    
  




To compute the estimate Îk+1 and the MSE Φ2k+1, one needs to know σU2=qiτ, which means that one needs to know the parameter i. In equations (6) and (8), σU2=qiτ is approximated using the latest estimate of i, Îk, i.e., σU2=qÎkτ. This approximation yields a MSE that is very close to the optimal case, i.e., when i is known.

Estimation for Scenario (2)—A Non-Recursive Solution

Taking reset noise and offset FPN into consideration, Ĩk is redefined as




  
    
      
        
          
            
              I
              ~
            
            k
          
          =
          
            
              
                Q
                k
              
              -
              
                wQ
                0
              
            
            
              k
              ⁢
              
                
              
              ⁢
              τ
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            1
          
          ≤
          k
          ≤
          
            n
            .
          
        
      
    
    
      
        (
        9
        )
      
    
  




The weight w is obtained by solving for the optimal b0 in equation (4), which yields





  w
  =
  
    
      
        σ
        C
        2
      
      
        
          σ
          C
          2
        
        +
        
          σ
          V
          2
        
      
    
    .
  




Note that Ĩk corresponds to an estimate with a weighted correlated double sampling (CDS) operation. The weighting has the effect of reducing the additional readout noise due to CDS.

The pixel current estimate Îk, given the first k samples, can be expressed as Îk=AkĨk, where optimal coefficient vector Ak=[a1(k)a2(k) . . . ak(k)] and photocurrent sample vector Ĩk=[Ĩ1Ĩ2 . . . . Ĩk]T. Note that since this estimation algorithm cannot be expressed in a recursive form, finding the optimal current estimate Îk requires the storage of the vector Ĩk and inverting a k×k matrix. Exemplary teachings on solving such matrices and finding Lagrange multiplier for the linear constraint can be found in the previously referenced and incorporated Applicants' publication, “Photocurrent Estimation from Multiple Non-Destructive Samples in a CMOS Image Sensor”.
Estimation for Scenario (3)—A Suboptimal Recursive Solution
Taking the reset noise and FPN into consideration, a suboptimal recursive estimation, i.e., without the need to store all samples, will now be described. This estimation solution utilizes the recursive optimal photocurrent estimate of the first scenario, i.e.,

Îk=Îk−1+hk(Ĩk−Îk−1),  (7)

and the redefined pixel current samples of the second scenario, i.e.,





  
    
      
        
          
            
              I
              ~
            
            k
          
          =
          
            
              
                Q
                k
              
              -
              
                wQ
                0
              
            
            
              k
              ⁢
              
                
              
              ⁢
              τ
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            1
          
          ≤
          k
          ≤
          
            n
            .
          
        
      
    
    
      
        (
        9
        )
      
    
  




The coefficient hk can be found by solving the equations





  
    
      
        
          
            
              d
              
                Φ
                k
                2
              
            
            
              d
              
                h
                k
              
            
          
          =
          
            
              
                d
                
                  
                    E
                    ⁡
                    
                      (
                      
                        
                          
                            I
                            ^
                          
                          k
                        
                        -
                        i
                      
                      )
                    
                  
                  2
                
              
              
                d
                
                  h
                  k
                
              
            
            =
            0
          
        
        ⁢
        
          

        
        ⁢
        and
        ⁢
        
          

        
        ⁢
        
          
            E
            ⁢
            
              
                I
                ^
              
              k
            
          
          =
          
            i
            .
          
        
      
    
    
      
        (
        10
        )
      
    
  




Define the MSE of Ĩk as





  
    
      
        
          Δ
          k
          2
        
        =
        
          
            
              E
              ⁡
              
                (
                
                  
                    
                      I
                      ~
                    
                    k
                  
                  -
                  i
                
                )
              
            
            2
          
          =
          
            
              1
              
                
                  k
                  2
                
                ⁢
                
                  τ
                  2
                
              
            
            ⁢
            
              (
              
                
                  k
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    U
                    2
                  
                
                +
                
                  
                    (
                    
                      1
                      +
                      w
                    
                    )
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
              
              )
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




and the covariance between Ĩk and Îk as





  
    
      
        
          
            
              
                Θ
                k
              
              =
              
              ⁢
              
                
                  E
                  ⁡
                  
                    (
                    
                      
                        
                          I
                          ~
                        
                        k
                      
                      -
                      i
                    
                    )
                  
                
                ⁢
                
                  (
                  
                    
                      
                        I
                        ^
                      
                      k
                    
                    -
                    i
                  
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    (
                    
                      1
                      -
                      
                        h
                        k
                      
                    
                    )
                  
                  ⁢
                  
                    
                      k
                      -
                      1
                    
                    k
                  
                  ⁢
                  
                    Θ
                    
                      k
                      -
                      1
                    
                  
                
                -
                
                  
                    
                      
                        (
                        
                          1
                          -
                          
                            h
                            k
                          
                        
                        )
                      
                      ⁢
                      
                        h
                        
                          k
                          -
                          1
                        
                      
                    
                    
                      
                        k
                        ⁡
                        
                          (
                          
                            k
                            -
                            1
                          
                          )
                        
                      
                      ⁢
                      
                        τ
                        2
                      
                    
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
                +
                
                  
                    h
                    k
                  
                  ⁢
                  
                    
                      Δ
                      k
                      2
                    
                    .
                  
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




The MSE of Îk can be expressed in terms of Δk2 and Θk as





  
    
      
        
          
            
              
                Φ
                k
                2
              
              =
              
              ⁢
              
                
                  
                    
                      (
                      
                        1
                        -
                        
                          h
                          k
                        
                      
                      )
                    
                    2
                  
                  ⁢
                  
                    Φ
                    
                      k
                      -
                      1
                    
                    2
                  
                
                +
                
                  
                    
                      2
                      ⁢
                      
                        (
                        
                          k
                          -
                          1
                        
                        )
                      
                      ⁢
                      
                        (
                        
                          1
                          -
                          
                            h
                            x
                          
                        
                        )
                      
                      ⁢
                      
                        h
                        k
                      
                    
                    k
                  
                  ⁢
                  
                    Θ
                    
                      k
                      -
                      1
                    
                  
                
                -
              
            
          
        
        
          
            
              
              ⁢
              
                
                  
                    
                      2
                      ⁢
                      
                        
                          h
                          
                            k
                            -
                            1
                          
                        
                        ⁡
                        
                          (
                          
                            1
                            -
                            
                              h
                              k
                            
                          
                          )
                        
                      
                      ⁢
                      
                        h
                        k
                      
                    
                    
                      
                        k
                        ⁡
                        
                          (
                          
                            k
                            -
                            1
                          
                          )
                        
                      
                      ⁢
                      
                        τ
                        2
                      
                    
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
                +
                
                  
                    h
                    k
                    2
                  
                  ⁢
                  
                    
                      Δ
                      k
                      2
                    
                    .
                  
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




To minimize the MSE,





  
    
      d
      
        Φ
        k
        2
      
    
    
      d
      
        h
        k
      
    
  
  =
  0




is required, which gives





  
    
      
        
          h
          k
        
        =
        
          
            
              Φ
              
                k
                -
                1
              
              2
            
            -
            
              
                
                  (
                  
                    k
                    -
                    1
                  
                  )
                
                k
              
              ⁢
              
                Θ
                
                  k
                  -
                  1
                
              
            
            +
            
              
                
                  h
                  k
                
                -
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
              
              
                
                  k
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  τ
                  2
                
              
            
          
          
            
              Φ
              
                k
                -
                1
              
              2
            
            -
            
              
                
                  2
                  ⁢
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
                k
              
              ⁢
              
                Θ
                
                  k
                  -
                  1
                
              
            
            +
            
              
                
                  2
                  ⁢
                  
                    h
                    k
                  
                
                -
                
                  i
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
              
              
                
                  k
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  τ
                  2
                
              
            
            +
            
              Δ
              k
              2
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




Note that hk, Θk and Φk can all be recursively updated. For example, at each iteration,

Φk2=(1−hk)2Φk−12+2hkΘk−hk2Δk2.

With this suboptimal recursive algorithm, only the old estimate Îk−1, the new sample value Ĩk, and three parameters, hk, Θk and Φk, are needed in order to find the new estimate Îk. Thus, only a small amount of memory per pixel is required and the amount of pixel memory required is advantageously independent of the number of images captured.
The advantages such as improved SNR offered by the novel estimation algorithms can be further demonstrated with reference to FIGS. 5 and 6 where the following sensor parameters are used.

Qsat=18750 e−

idc=0.1 fA

σV=60 e−

σC=62 e−

T=32 ms

τ=1 ms

FIG. 5 plots the estimation weights used in the recursive estimation algorithm. The relationship between the number of samples k captured and the estimation weights as shown in FIG. 5 can be easily understood by one of ordinary skill in the art and thus is not described in details herein. FIG. 6 compares the equivalent readout noise (RMS) and SNR values at low illumination level corresponding to iph=2 fA as a function of the number of samples k for conventional sensor operation, i.e., no estimation, and using the recursive estimation algorithm described herein. As can be seen in FIG. 6, the equivalent readout noise after the last sample is reduced from 60 e−, when no estimation is used, to 18 e−, when the recursive estimator is used.
Advantages of the present invention including simultaneous SNR and dynamic range enhancement utilizing the inventive estimation system described herein can be seen in FIG. 7, especially when compared to conventional sensor operation where the last sample Ĩn is used.
FIG. 7 shows that SNR in an image sensor system that utilizes the inventive estimation system is consistently higher, due to the reduction in read noise. Such improvement is most pronounced at the low illumination end, i.e., under low light. More significantly, the sensor dynamic range, defined as the ratio of the largest signal imax to the smallest detectable signal imin, is increased compared to the convention sensor operation.
For example, assume in a conventional sensor operation imax=Qsat/T and imin=σv/T, where sensor parameters Qsat =18750e−; σv=60e−; T=32 ms; and sample number n=32. This yields a dynamic range of 47.4 dB. With the inventive estimation system, on the other hand, the dynamic range is advantageously extended to 85.5 dB—increasing 30.1 dB at the high illumination end and 8 dB at the low illumination end.
According to these described principles of the present invention, provided are the following embodiments:
1. An optimal recursive algorithm when reset noise and offset fixed pattern noise (FPN) are ignored. In this case, since the reset noise and FPN are ignored, the estimation algorithm can be cast in a recursive form, which, in turn, minimizes pixel storage required for the corresponding operation. That is, only the latest estimate and the new sample are needed to update the pixel photocurrent estimate. This estimation solution is well suited for, but not limited to, high-end CCD's using very high resolution ADC.
2. An optimal non-recursive algorithm when reset noise and FPN are considered. In this case, the estimation solution cannot be expressed in a recursive form. Accordingly, this estimation solution is well suited for, but not limited to, applications with reduction/elimination of readout noise and FPN being the main focus.
3. A suboptimal recursive estimator for the non-recursive algorithm. In this case, the reset noise and FPN are considered and the corresponding estimation solution can be cast in a recursive form. As described herein, the suboptimal recursive estimator yields mean square error close to the non-recursive algorithm without the need to store all the samples, requiring the storage of only a constant number of values per pixel. Furthermore, the pixel storage requirement can be independent of the number of image sample captured. As such, the suboptimal recursive estimator offers at least the following advantages: improved SNR and independent minimal pixel storage requirement.
Motion/Saturation Detection
The derivation of the recursive linear estimation algorithms operates advantageously when no motion blur or saturation occurs. That is, when i(t) is constant and saturation does not occur before kτ. Blurring due to object or camera motion during image capture can cause substantial degradation in image quality. To further enhance the quality of the image captured, the present invention provides a novel motion/saturation detection algorithm for updating the photocurrent estimate when motion blur is detected and/or saturation has occurred.
A great deal of research has been conducted on developing methods for restoring blurred images. An exemplary teaching on digital image restoration can be found in “Digital image restoration” by Banham et al. These methods make certain assumptions on the blurring process, the ideal image, and the noise. Various image processing techniques are then used to identify the blur and restore the image. However, due to the lack of sufficient knowledge of the blurring process and the ideal image, these known and developed image blur restoration methods have limited applicability and their computational burden can be quite substantial.
Without a complete knowledge of the statistics of the noise and specified motion model, it is not possible to derive an absolutely optimal detection algorithm. However, as previously described, particularly with reference to FIGS. 3 and 6, the present invention provides a best possible solution by performing the motion/saturation detection step prior to each estimation step, as shown and described with reference to FIG. 4, thereby forming a blur free high dynamic range image from the n+1 captured images, taking into consideration the tradeoffs between motion induced distortion and SNR improvement due to increased exposure time.
The novel motion/saturation detection algorithm operates on each pixel separately. After the kth capture, the best MSE linear estimate of i, Îk, and its MSE, Φk2, are computed as previously described with reference to the suboptimal recursive algorithm. If the current stays constant, the next observation Ik+1{tilde over (p)}re would be




  
    
      
        
          
            I
            ~
          
          
            k
            +
            1
          
          pre
        
        =
        
          i
          +
          
            
              
                ∑
                
                  j
                  =
                  1
                
                
                  k
                  +
                  1
                
              
              ⁢
              
                U
                j
              
            
            
              
                (
                
                  k
                  +
                  1
                
                )
              
              ⁢
              
                
              
              ⁢
              τ
            
          
          +
          
            
              
                V
                
                  k
                  +
                  1
                
              
              -
              
                wV
                0
              
            
            
              
                (
                
                  k
                  +
                  1
                
                )
              
              ⁢
              
                
              
              ⁢
              τ
            
          
          +
          
            
              
                (
                
                  1
                  -
                  w
                
                )
              
              ⁢
              C
            
            
              
                (
                
                  k
                  +
                  1
                
                )
              
              ⁢
              
                
              
              ⁢
              τ
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




and the best predictor of Ik+1{tilde over (p)}re is Îk with the prediction MSE given by





  
    
      
        
          
            
              
                Δ
                pre
                2
              
              =
              
                E
                ⁡
                
                  (
                  
                    
                      
                        (
                        
                          
                            
                              I
                              ~
                            
                            
                              k
                              +
                              1
                            
                            pre
                          
                          -
                          
                            
                              I
                              k
                            
                            ^
                          
                        
                        )
                      
                      2
                    
                    |
                    
                      
                        I
                        k
                      
                      ^
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
                
                  
                    
                      (
                      
                        k
                        
                          k
                          +
                          1
                        
                      
                      )
                    
                    2
                  
                  ⁢
                  
                    Δ
                    k
                    2
                  
                
                +
                
                  Φ
                  k
                  2
                
                -
                
                  
                    
                      2
                      ⁢
                      k
                    
                    
                      k
                      +
                      1
                    
                  
                  ⁢
                  
                    Θ
                    k
                  
                
                +
                
                  
                    
                      2
                      ⁢
                      
                        h
                        k
                      
                    
                    
                      
                        k
                        ⁡
                        
                          (
                          
                            k
                            +
                            1
                          
                          )
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        τ
                        2
                      
                    
                  
                  ⁢
                  
                    σ
                    V
                    2
                  
                
                +
                
                  
                    σ
                    U
                    2
                  
                  
                    
                      
                        k
                        ⁡
                        
                          (
                          
                            k
                            +
                            1
                          
                          )
                        
                      
                      2
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      τ
                      2
                    
                  
                
              
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




where Δk2, Θk, Φk2, and hk are given in equation (11), (12), (13), (14), respectively.

Thus, whether the input signal i changed between time kτ and (k+1)τ can be determined by comparing




  
    
      I
      ~
    
    
      k
      +
      1
    
  
  =
  
    
      
        Q
        
          k
          +
          1
        
      
      -
      
        wQ
        0
      
    
    
      
        (
        
          k
          +
          1
        
        )
      
      ⁢
      
        
      
      ⁢
      τ
    
  




with Îk. A simple decision rule would be to declare that motion has occurred if

|Ĩk+1Îk|≧mΔpre,  (17)

and to use Îk as the final estimate of i, otherwise to use Ĩk+1 to update the estimate of i, i.e., Îk+1.

For further details on respective mathematical models and corresponding calculations, readers are referred to Applicants' publication, “Simultaneous Image Formation and Motion Blur Restoration via Multiple Capture”, Proc. of ICASSP2001, Salt Lake City, May 2001, the publication of which is hereby expressly incorporated herein by reference in its entirety.
The constant m>0 is chosen to achieve the desired tradeoff between SNR improvement and motion blur. The higher m the more motion blur if i changes with time, but also the higher the SNR if i is a constant, and vice versa. One potential problem with this “hard” decision rule is that gradual drift in i can cause accumulation of estimation error resulting in undesired motion blur. Therefore, in a preferred embodiment, the present invention utilizes a novel “soft” decision rule.
Motion Detection Algorithm with Soft Decision Rule
In a preferred embodiment with high frame rate capture, the algorithm described herein employs a recursive “soft decision” algorithm to detect change in each pixel's signal due to motion or change in illumination. The decision to stop estimating after motion is detected is made locally and is independent of other pixel's signals.
With reference to FIG. 8, a soft decision motion detection algorithm according to an aspect of the present invention will now be described.
For each pixel, after the (k+1)st capture:

    1. If |Ĩk+1−Îk|≦m1Δpre, then declare that no motion detected. Use Ĩk+1 to update Îk+1 and set L+=0, L−=0.
    2. If |Ĩk+1−Îk|≧m2Δpre, L+=lmax, or L−=lmax, then declare that motion detected. Use Îk as the final estimate of i.
    3. If m1Δpre<Ĩk+1−Îk<m2Δpre, then defer the decision and set L+=L+1, L−=0.
    4. If −m2Δpre<Ĩk+1−Îk<−m1Δpre, then defer the decision and set L−=L−1, L+=0.


The counters, L+ and L−, record the number of times the decision is deferred, and 0<m1<m2 and lmax are chosen so to achieve a desirable balance between the highest possible SNR and the least possible motion blur.
To demonstrate such tradeoff between the SNR and motion blur distortion, turn now to FIG. 9 where optimal integration time under motion is illustrated. Consider a linearly varying photocurrent

i(t)=i0(1+ρt)  (18)

where i0=i(0) is the photocurrent at the beginning of exposure, 0≦t≦T is time during exposure, and ρ≧−1/T is the rate of photocurrent change. In a simplified analysis, assume that photocurrent is estimated by the most recent sample Ĩk. In this case, the MSE can be expressed as the sum of two components

MSE=Δ12+Δ22,





  
    
      Δ
      1
      2
    
    =
    
      
        (
        
          
            1
            2
          
          ⁢
          ρ
          ⁢
          
            
          
          ⁢
          
            i
            0
          
          ⁢
          t
        
        )
      
      2
    
  
  ,




where is the MSE due to motion distortion and





  
    
      Δ
      2
      2
    
    =
    
      
        
          σ
          V
          2
        
        
          t
          2
        
      
      +
      
        
          qi
          0
        
        t
      
      +
      
        
          1
          2
        
        ⁢
        q
        ⁢
        
          
        
        ⁢
        ρ
        ⁢
        
          
        
        ⁢
        
          i
          0
        
      
    
  
  ,




is the estimation MSE. As can be seen in FIG. 9, Δ12 increases with time, since the deviation from constant current due to motion increases with t, while Δ22 decreases with time, since estimation becomes more accurate as t increases. The parameters, m1, m2, L+, and L−, of the present invention can be set to achieve desired tradeoff between SNR and motion blur distortion.

FIG. 10 further demonstrates the advantages of the present invention such as simultaneous SNR and dynamic range improvement with multiple captures without motion blur. FIG. 10 shows an example of motion blur prevention with a rapid movement in the scene. Images (a) and (b) show respective positions of a dancer at the beginning and end of an exposure time. Image (c) illustrates a final image generated by a conventional sensor with normal exposure time. Image (d) comparably illustrates a final image generated by a sensor utilizing the present invention. As shown in FIG. 10, by applying the inventive algorithms described herein the image blur in (c) is almost completely eliminated in (d).
Turning to FIG. 11, where a recursive estimation system according to an embodiment of the present invention will now be described. In FIG. 11, a recursive estimation system 1100 recursively estimates the intensity of the illumination on a sensor by digitally latching pixel current (charge) Q(T) 130 or holding it as an analog voltage value. Similarly, recursive estimation system 1100 latches or holds photocurrent estimate 1101, weighting coefficient 1102, overall photocurrent variability 1103 and last sample photocurrent variability 1104.
Synchronously with the assertion of a reset signal, initial values for photocurrent estimate 1101, weighting coefficient 1102, overall photocurrent variability 1103 and last sample photocurrent variability 1104 are latched or held. In an embodiment of the invention, these initial values may depend on calibration parameters of an associated sensor array. In another embodiments of the invention, these initial values may depend on user preferences or settings that indicate the type of image being captured.
Operations of the recursive estimation system 1100 will now be described with reference to FIGS. 1 and 11. As previously described, FIG. 1 shows a conventional 2D sensor array 110 with pixel circuit 120. Integrating with the recursive estimation system 1100, after the assertion of the reset signal ends and before the accumulation of any charge, the voltage on capacitor 122 is measured. This initial measurement is used as the initial value of charge Q(T) 130.
When a new charge Q(T) 130 becomes available from the readout circuit 125, an arithmetic computation logic 1120 first perform motion/saturation detection. If no motion/saturation is detected based on this new charge Q(T) 130 and the previous values of pixel current estimate 1101, weighting coefficient 1102, overall photocurrent variability 1103 and last sample photocurrent variability 1104, the updated value 1130 is then calculated. These previous values, i.e., photocurrent estimate 1101, weighting coefficient 1102, overall photocurrent variability 1103 and last sample photocurrent variability 1104, are then replaced by the updated values 1130. If motion/saturation is detected, then the previous values are not updated. This process is recursively repeated for each capture within exposure time T. At the end of exposure time T, the arithmetic computation logic 1120 outputs photocurrent estimate 1101 as final photocurrent estimate 1140.
In sum, the photocurrent estimation according to an aspect of the present invention reduces read noise and thus enhances dynamic range at low illumination end. The motion/saturation detection according to another aspect of the present invention enhances dynamic range at the high illumination end. The inventive motion/saturation detection further ensures that the estimation is not corrupted by motion. As previously described, recent advances in CMOS image sensor technology enable digital high speed capture up to thousands of frames per second, enabling new imaging enhancement capabilities such as multiple sampling (multiple captures) for increasing the sensor dynamic range. The present invention further strengthens such multiple sampling capability in CMOS image sensors by providing apparatuses, systems, and methods for synthesizing high dynamic range, low or no noise, motion blur free images even under low illumination and/or with extended exposure time.
Furthermore, the present invention operates completely locally, i.e., each image pixel's final value is computed using only its captured values, and recursively, requiring only a constant number of values per pixel be stored. The storage requirement is thus small and independent of the number of images captured. These modest computation and storage requirements make the present invention well suited for single chip digital camera implementations.
It will be obvious to one skilled in the art that the present invention, including the non-recursive estimation, recursive estimation, suboptimal recursive estimation motion/saturation detection, soft decision rule, and high dynamic motion blur free image synthesis from multiple captures, along with respectively associated variables, parameters, values and circuitry designs, described in various embodiments of the present invention, may be implemented, calibrated and/or fabricated in various hardware and software implementations without departing from the principles, spirit, or scope of the present invention.
For example, either a non-recursive estimation system or a recursive estimation system such as the recursive estimation system 1100 may implement the computations needed based on analog approximations, digital approximations, estimators and heuristics, so as to reduce the size and complexity of the circuits involved and/or required, to speed up associated sensor operation, or both. In addition, some embodiments of the present invention may be integrated at pixel level, column level, or chip level. Furthermore, some aspects of the present invention may be integrated with a CCD or a CMOS image sensor system. In particular, the present invention may be advantageously implemented in a novel CMOS DPS image sensor system with self-reset pixel architecture as disclosed in Applicants' cross-referenced U.S. patent applications, titled “CMOS Image Sensor System with Self-Reset Digital Pixel Architecture for Improving SNR and Dynamic Range” and “Method for Improving SNR in Low Illumination Conditions in a CMOS Video Sensor System Using a Self-Resetting Digital Pixel”.
Although the present invention and its advantages have been described in detail, it should be understood that the resent invention is not limited to or defined by what is shown or discussed herein; rather, the invention may be practiced with the specific details herein omitted or altered. The drawings, description and discussion herein illustrate technologies related to the invention, show examples of the invention and provide examples of using the invention. Known methods, procedures, systems, circuits or components may be discussed or illustrated without giving details, so as to avoid obscuring the principles of the invention. One skilled in the art will realize that changes, substitutions, and alternations could be made in numerous implementations, modifications, variations, selections among alternatives, changes in form, and improvements without departing from the principles, spirit or legal scope of the invention. Accordingly, the scope of the present invention should be determined by the following claims and their legal equivalents.

## Claims

1. A method for preventing motion/saturation from corrupting image capturing during a global exposure time of a sensor, comprising:
performing for each pixel of said sensor:
a) determining a difference between an illumination measurement obtained during current image capturing and an illumination estimation generated during previous image capturing;
b) comparing said difference with a threshold value;
c) determining, based on step b), whether motion/saturation has occurred;
d1) accepting said illumination measurement and updating said illumination estimation if motion/saturation has not occurred;
d2) updating said illumination estimation with said illumination measurement if motion/saturation has occurred and if terminating said performing act is deferred; and
d3) terminating said performing act and outputting said illumination estimation as final illumination estimation if motion/saturation has occurred.

2. The method of claim 1, wherein said threshold value is generated based on a predetermined parameter and a prediction variable, said predetermined parameter being configured to achieve desired tradeoff between signal-to-noise ratio and motion blur.

3. The method of claim 1, wherein said image capturing occurs a multiplicity of times during said global exposure time thereby producing a multiplicity of measurements and wherein an optimal illumination estimation for said sensor is generated based on said multiplicity of measurements.

4. The method of claim 3, wherein said optimal illumination estimation is generated based on maximum likelihood.

5. The method of claim 3, wherein said optimal illumination estimation is generated based on linear minimum mean square error.

6. The method of claim 1, wherein said image capturing occurs a multiplicity of times during said global exposure time thereby producing a multiplicity of measurements and wherein an optimal illumination estimation for said sensor is generated based on selectively accepted multiplicity of measurements.

7. The method of claim 6, wherein said optimal illumination estimation is generated based on maximum likelihood.

8. The method of claim 6, wherein said optimal illumination estimation is generated based on linear minimum mean square error.

9. The method of claim 1, wherein each pixel's effective exposure time is adaptive to its own lighting condition thereby enabling performing for each pixel independently of other pixels' lighting conditions.

10. The method of claim 1, wherein each pixel is capable of terminating its own exposure time thereby enabling extending said global exposure time.

11. The method of claim 10, wherein said global exposure time is limited by motion and saturation only thereby enabling said sensor to achieve higher signal-to-noise ratio and dynamic range.

12. The method of claim 1, wherein said steps a)–c) are performed based on parameters calculated recursively, said parameters including a weighting coefficient, an overall variance, and a covariance.

13. The method of claim 1, wherein said steps a)–c) are performed based on parameters calculated non-recursively.

14. The method of claim 1, wherein said illumination estimation is generated based on maximum likelihood.

15. The method of claim 1, wherein said illumination estimation is generated based on linear minimum mean square error.

16. The method of claim 1, further comprising
utilizing a soft decision rule for preventing error accumulation due to slow motion.

17. The method of claim 16, wherein said threshold value is characterized by a first range of values and a second range of values that include said first range of values, wherein said first range of values is characterized by a first constant parameter m1 and said second range of values is characterized by a second constant parameter m2 where 0<m1<m2, and wherein m1, m2, and length of global exposure time are chosen so to achieve a desirable balance between highest possible signal-to-noise ratio and least possible motion blur.

18. The method of claim 17, wherein step c) further comprises:
c1) indicating no motion/saturation has occurred and updating said illumination estimation with said illumination measurement, if said difference falls within said first range of values; and
c2) indicating motion/saturation has occurred and,
1) if said difference falls outside said second range of values, terminating said performing act and using said illumination estimation for generating an optimal illumination estimation for said sensor; and
2) if said difference falls between said first range of values and said second range of values, deferring terminating said performing act and updating said illumination estimation with said illumination measurement.

19. A method for synthesizing from multiple captures high dynamic range motion blur free images, said method comprising the steps of:
a) capturing a first image sample;
b) generating for each pixel a current illumination estimation based on said first captured image sample;
c) capturing a next image sample;
d) determining for each pixel whether motion/saturation has occurred and whether to include said next image sample; wherein said step d) further comprises:
d1) if motion/saturation has occurred, using said current illumination as final illumination estimation; and
d2) if no motion/saturation has occurred or a decision is deferred, including said next image sample and updating said current illumination;

e) repeat steps c) and d) until no more image samples are to be captured.

20. A system having a sensor capable of capturing a multiplicity of image samples during a global exposure time, comprising:
motion/saturation detecting means for determining for each pixel whether motion/saturation has occurred between a previous capturing and a current capturing;
processing means for determining for each pixel whether to accept an image sample captured during said current capturing; estimating means for generating an optimal illumination estimation for said sensor based on selectively accepted multiplicity of image samples captured during said global exposure time thereby Preventing motion/saturation from corrupting image capturing;
means for determining for each pixel a difference between an illumination measurement obtained during said current capturing and an illumination estimation generated during said previous capturing;
means for comparing for each pixel said difference with a threshold value;
means for updating for each pixel said illumination estimation with an accepted or deferred illumination measurement; and
means for outputing for each pixel a final illumination estimation.

21. The system of claim 20, wherein said threshold value is generated based on a predetermined parameter and a prediction variable, said predetermined parameter is configured to achieve desired tradeoff between signal-to-noise ratio and motion blur.

22. The system of claim 20, wherein said threshold value is characterized by a first range of values and a second range of values that include said first range of values, wherein said first range of values is characterized by a first constant parameter mi and said second range of values is characterized by a second constant parameter m2 where 0>m1>m2, and wherein m1, m2, and length of global exposure time are chosen so to achieve a desirable balance between highest possible signal-to-noise ratio and least possible motion blur.

23. The system of claim 22, further comprising:
a soft decision means for preventing error accumulation due to slow motion, said soft decision means
indicating no motion/saturation has occurred and updating said illumination estimation with said illumination measurement, if said difference falls within said first range of values;
indicating motion/saturation has occurred and outputting said illumination estimation as said final illumination estimation, if said difference falls outside said second range of values; and
indicating motion/saturation has occurred and said illumination measurement is deferred, and updating said illumination estimation with said deferred illumination measurement, if said difference falls between said first range of values and said second range of values.

24. The system of claim 20, wherein each pixel's effective exposure time is adaptive to its own lighting condition thereby enabling performing for each pixel independently of other pixels' lighting conditions.

25. The system of claim 20, wherein each pixel is capable of terminating its own exposure time thereby enabling extending said global exposure time.

26. The system of claim 25, wherein said global exposure time is limited by motion and saturation only thereby enabling said sensor to achieve higher signal-to-noise ratio and dynamic range.

27. The system of claim 20, wherein said motion/saturation detecting means utilizes parameters calculated recursively.

28. The system of claim 20, wherein said motion/saturation detecting means utilizes parameters calculated non-recursively.

29. The system of claim 20, wherein said estimating means is characterized as recursive.

30. The system of claim 20, wherein said estimating means is characterized as non-recursive.

31. The system of claim 20, wherein said threshold value is generated based on a predetermination parameter and a prediction variable, said predetermined parameter being configured to achieve desired tradeoff between signal-to-noise ratio and motion blur.

32. The system of claim 20, wherein said estimating means is configured based on linear minimum mean square error.

33. The system of claim 20, wherein said motion/saturation detecting means and said estimating means are implemented based on a self-reset pixel architecture.

34. The system of claim 33, wherein said self-reset pixel architecture utilizes self-reset digital pixel sensors.

35. The system of claim 20, wherein said system is implemented on a single chip.

36. The system of claim 20, wherein said sensor is a digital pixel sensor.

37. The system of claim 20, wherein said sensor is a photodiode and said illumination measurement represents a charge accumulated from photocurrent produced by said photodiode.