Abstract:
An intensity image is collected at each of a plurality of locations spaced apart in a propagation direction of a light beam. Information from the intensity images is combined using a Kalman filter which assumes that at least one co-variance matrix has a diagonal form. This leads to considerable reduction in computational complexity. An augmented Kalman filter model (augmented space state model) is used in place of the standard Kalman filter model. The augmented Kalman filter improves the robustness to noise.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to methods and apparatus to obtain phase information characterizing light, using a plurality of images encoding information about the intensity of the light. 
       BACKGROUND OF THE INVENTION 
       [0002]    When coherent (laser) light passes through or reflects from an object, its amplitude and phase are altered as it continues to propagate. Phase perturbations contain important information about an object. For example, transparent biological cells are invisible in a focused microscope, but impart distinct phase changes. Data about these phase changes can find useful applications in morphology analysis of cell, or cell-cycle analysis without labelling. Such applications are relevant for biology and biomedical engineering, e.g., for detecting cancer cells. Moreover, there are various applications in materials science. 
         [0003]    It is noteworthy that only the intensity of light can be measured directly, since phase oscillates far too quickly, and therefore, the phase needs to be reconstructed computationally. This “phase problem” of optical imaging has been around for decades, but only recently has been posed as an inference problem [1, 2]. This breakthrough, in principle, allows for much more experimental noise in the images, and as a consequence, enables applications of phase imaging where there is little light and much background noise (e.g., underwater imaging). 
         [0004]    Traditional methods for phase recovery include phase contrast microscopy, differential interference contrast microscopy, and digital holography [3,4,5]. All of the three methods use a reference wavefront to obtain the amplitude and phase information. The phase image recovered by phase contrast microscopy is a function of the optical path length magnitude of the object. Differential interference contrast microscopy obtains the gradients of the optical length, but it can only be used when the object has a similar refractive index to the surroundings. Digital holography uses an interferometer setup to record the interference between a reference beam and a beam which has interacted with an object to be imaged. A computer is used to calculate the object image with a numerical reconstruction algorithm. So digital holography has the advantage of giving quantifiable information about optical distance, while phase contrast microscopy and differential interference contrast microscopy just provide a distorting of the bright field image with phase shift information. However, the experimental setup for digital holography is usually complicated, and has high requirements on the wave path [6,7]. For instance, the reference beam and target beam need to be accurately aligned. 
         [0005]    An alternative approach is based on exploiting the physics of wavefront propagation. Consider the experimental arrangement shown in  FIG. 1 , which is taken from [1]. A laser  1  generates a beam  2  of light, which propagates in a direction z and passes through a collimator  3 , and a lens  4 . An object to be imaged can be placed in the object plane  5 , such that the light beam passes through it. The light then passes through a further pair of lenses lens  6 ,  7  forming a “4f system”, and the light then passes into a camera  8  which collects an intensity image of the light reaching it in the propagation direction z. The 4f system has the effect of enlarging the beam (which is important if the object which was imaged is small, such as a cell) and of making it clear where the position of the object plane is in relation to the focal plane of the lenses  6 ,  7  (this information is important, so that it is possible to propagate the complex plane back into the object plane) The camera  8  or the object  5  can be moved parallel to the light propagation direction, and collects a plurality of two-dimensional intensity images  9  at respective locations spaced apart in this direction. Each intensity image shows the light intensity at respective points in a two-dimensional plane (x,y) perpendicular to the light propagation direction z. Note that the distance by which the camera or object  5  is moved is very small (of the order of 10-100 micrometers) so there is no collision with the lenses. The focal plane is determined by the focal length of the lenses  6 ,  7  in the 4f system. The complex field at the focal plane is an enlarged or reduced version of the complex field at the object plane  5 , so recovering the complex field at the focal plane is the same as recovering the complex field at the plane  5 . At the focal plane, the intensity image  9   a  contains no information about the phase. 
         [0006]    The object to be imaged, which is placed at the object plane  5 , modifies the light passing through it, producing, at each point in the object plane  5 , a corresponding amplitude contrast and phase difference. In example, the phase difference produced by the object at each point in the 2-D object plane is as shown as  10   a  in  FIG. 1 , where the level of brightness indicates a corresponding phase difference. The amplitude contrast produced by the object in the object plane is shown as  10   b  (a moustache and hat). The amplitude contrast diffracts symmetrically through the focal point, while the phase defocuses in an anti-symmetric fashion. The phase and amplitude are estimated from the intensity images  9  captured by the camera  4  by a computational numerical algorithm. 
         [0007]    One method for doing this is the Gerchberg-Saxton (GS) method [9.10], which treats the problem as convex optimization and iterates back and forth between two domains (an in-focus image and a Fourier domain image) to reduce error at each iteration. It is strongly sensitive to the noise in the latter image. An alternative method is a direct method [11,12,13] which exploits the Transport of Intensity Equation (TIE); it is based on first- and higher-order derivatives, and it is not robust to noise. Thus, although the GS and direct methods are computationally efficient, they are both very sensitive to noise. 
         [0008]    A few statistical approaches have been proposed as well; an approximation to the maximum likelihood estimator is derived in [2, 14]. However, it easily gets stuck in local maxima, and sometimes leads to poor results. In [1] an augmented complex extended Kalman filter (ACEKF) was used to solve for phase with significant noise corruption. 
         [0009]    However, the memory requirements are of order N 2  where N is the number of pixels in each intensity image, which is unfeasible for practical image sizes of multiple megapixels, and the long computation times are impractical for real-time applications, such as in biology, biomedical engineering and beyond. In [8] a diagonalized complex extended Kalman filter (diagonalized CEKF) was proposed to alleviate those issues, without jeopardizing the reconstruction accuracy. The diagonalized CEKF is iterative: it needs to cycle through the set of intensity images repeatedly, yielding more accurate phase reconstruction after each cycle. On the other hand, the computational complexity increases with each cycle. 
       SUMMARY OF THE INVENTION 
       [0010]    The present invention aims to provide new and useful methods and apparatus for obtaining phase information concerning a light beam, and in particular a light beam which has interacted with an object to be imaged. 
         [0011]    The invention relates to an experimental situation in which an intensity image is collected at each of a plurality of locations spaced apart in a propagation direction of a light beam. Thus, typical embodiments of the invention do not require a reference beam, or rely on interference phenomena. Wavefront propagation means that that plurality of images encode phase information, and the intensity images are used in combination to extract the phase information. The invention proposes in general terms that information from the intensity images is combined using a Kalman filter which assumes that at least one co-variance matrix has a diagonal form. This leads to considerable reduction in computational complexity. 
         [0012]    In another aspect, the invention further proposes that an augmented Kalman filter model (augmented space state model) is used in place of the standard Kalman filter model. The augmented Kalman filter improves the robustness to noise. 
         [0013]    The result of combining these aspects of the invention is a sparse ACEKF (Sparse augmented complex extended Kalman filter) which can efficiently recover amplitude and phase of an optical field from a series of noisy defocused images. The approach is inspired by [1], which is rooted in statistics and yields reliable phase estimation methods that are robust to noise. However, whereas the ACEKF method of [1] is computationally unwieldy and impractical, preferred embodiments of the present invention are very efficient. The embodiment employs the augmented state space model, and reconstructs the phase by conducting Kalman filtering approximately yet much more efficiently, without losing accuracy in the phase reconstruction. The sparse ACEKF algorithm employs two covariance matrices which are each approximated as a diagonal matrices, or a diagonal matrix multiplied by a permutation matrix. One of these covariance matrices is a pseudo-covariance matrix. For a given matrix A we refer to A* as its “conjugate”. The two diagonal covariance matrices, and their conjugates are the four components of a composite covariance matrix. As a result, the phase estimation method is very efficient, and no iterations are needed. It seems to be feasible for phase recovery in real-time, which is entirely unfeasible with ACEKF. In other words, the proposed method provides robust recovery of the phase, while being fast and efficient. 
         [0014]    The advantages of preferred embodiments are as follows:
       Besides the ordinary bright field image, a phase shift image is created as well. The phase shift image gives quantifiable information about optical distance.   Transparent objects, like living biological cells, are traditionally viewed in a phase contrast microscope or in a differential interference contrast microscope. These methods visualize phase shifting transparent objects by distorting the bright field image with phase shift information. Instead of distorting the bright field image, transmission DHM creates a separate phase shift image showing the optical thickness of the object. Digital holographic microscopy thus makes it possible to visualize and quantify transparent objects and is therefore also referred to as quantitative phase contrast microscopy.   Traditional phase contrast or bright field images of living unstained biological cells have proved themselves to be very difficult to analyze with image analysis software. On the contrary, phase shift images obtained by digital holography and wave propagation methods are readily segmented and analyzed by image analysis software based on mathematical morphology, such as CellProfiler.   The preferred embodiments directly take the noise in the measurement into consideration through the augmented state space model, and therefore, it is robust to strong noise.   The complexity of each iteration in the preferred embodiments of the proposed algorithm is in the order of N log N, where N is the number of pixels per image. The storage required scales linearly with N. In contrast, the complexity of existing statistical phase inference algorithms [1] scales with N 3  and the required storage with N 2 ; it literally takes several hours to reconstruct a phase image, which is entirely impractical. Since the preferred embodiment is very fast and achieves phase reconstructions in a fraction of a second, it may enable real-time estimation of optical fields from noisy intensity images. That is required for almost any practical application, since one would want to see the phase reconstruction instantaneously while imaging the object of interest, e.g., a migrating or growing biological cell.   The experimental setup for wave propagation based methods is simpler, compared to the interference methods (phase contrast microscopy, differential interference contrast microscopy, and digital holography microscopy). Fewer optical components are required. It also avoids the phase unwrapping problem associated with those methods. The needed components are inexpensive optics and semiconductor components, such as a laser diode and an image sensor. The low component cost in combination with the auto focusing capabilities of the preferred embodiments, make it possible to manufacture such system for a very low cost.       
 
         [0021]    In summary, the advantages and disadvantages of the various methods are given in Table 1 
         [0000]    
       
         
               
               
               
               
             
           
               
                 TABLE 1 
               
               
                   
               
               
                   
                 Phase Contrast 
                   
                 Preferred 
               
               
                 Property 
                 Microscopy 
                 Digital Holography 
                 embodiment 
               
               
                   
               
             
             
               
                 Digital processing 
                 Difficult 
                 Yes 
                 Yes 
               
               
                 Phase wrapping 
                 No 
                 Yes 
                 No 
               
               
                 problem 
               
               
                 Quantitative 
                 No 
                 Yes 
                 Yes 
               
               
                 Noise resilient 
                 No 
                 No 
                 Yes 
               
               
                 Experimental set-up 
                 Complicated 
                 Complicated 
                 Simple 
               
               
                 Real-time imaging 
                 Yes 
                 Potentially 
                 Yes 
               
               
                   
               
             
          
         
       
     
     
    
     
       BRIEF DESCRIPTION OF THE FIGURES 
         [0022]    An embodiment of the invention will now be described for the sake of example only with reference to the following figures, in which: 
           [0023]      FIG. 1  shows a prior art experimental arrangement which is used in the embodiment; 
           [0024]      FIG. 2  shows a flow-chart of the steps of the embodiment; 
           [0025]      FIG. 3  shows data used in experimental tests of the embodiment, and is composed of  FIG. 3(   a ) which shows simulated images with high noise,  FIG. 3(   b ) which is experimental data acquired by a microscope, and  FIG. 3(   c ) which is experimental data of large size obtained by a microscope; 
           [0026]      FIG. 4  shows recovered intensity and phase images obtained by processing the dataset of  FIG. 3(   a ) by ACEKF, diagonalized CEKF, and the embodiment; 
           [0027]      FIG. 5  shows the estimated intensity and phase obtained by processing the dataset of  FIG. 3(   b ) by ACEKF, diagonalized CEKF, and the embodiment; 
           [0028]      FIG. 6  is composed of  FIG. 6(   a ) which shows the estimated phase [nm] when the dataset of  FIG. 3(   c ) is processed by ACEKF, diagonalized CEKF, and the embodiment, and  FIG. 6(   b ) which shows the respective depth for each of the images along the black line in  FIG. 6(   a ). 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0029]    A flow chart of the embodiment is shown in  FIG. 2 . Step  11  is to set up experimental conditions, such as those in  FIG. 1 , to collect a series of intensity images in different parallel planes. The images are M 1 ×M 2  pixels. Step  12  is to use the parameters of the experimental set-up to generate a physical model describing it. These steps are the same as used, for example, in [1], as described above. 
         [0030]    The remaining steps employ a novel augmented state space model. In step  13  parameters of the model are initialised. In step  14 , the data for a first of the series of images is used to update the model. As described below this makes use of a novel phase reconstruction algorithm, assuming a diagonal covariance matrix. Step  14  is performed repeatedly for successive ones of the series of images, until all images have been processed. 
       1. Problem Description and Physical Model 
       [0031]    We aim at estimating the 2D complex-field A(x,y,z 0 ) at the focal plane z 0 , from a sequence of noisy intensity images I(x,y,z) captured at various distances z 0 , z 1 , z 2 , . . . , z n  . . . , z N . In the following explanation it is assumed, for simplicity, that the focal plane z 0  is at one end of the series of images, but in fact it is straightforward to generalise this to a situation in which it is in the middle of the set of images (as shown in  FIG. 1 ). We assume a linear medium with homogenous refractive index and coherent (laser) illumination, such that the complex-field at z 0  fully determines the complex-field at all other planes. The complex optical field at z is A(x, y, z)=|A(x, y, z)|e iφ(x,y,z)  where |A(x,y,z)| is the intensity, and φ(x, y, z) is the phase. Propagation is modeled by the homogeneous paraxial wave equation: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       ∂ 
                       
                         A 
                          
                         
                           ( 
                           
                             x 
                             , 
                             y 
                             , 
                             z 
                           
                           ) 
                         
                       
                     
                     
                       ∂ 
                       x 
                     
                   
                   = 
                   
                     
                       
                          
                          
                         
                             
                         
                          
                         λ 
                       
                       
                         4 
                          
                         π 
                       
                     
                      
                     
                       
                         ∇ 
                         ⊥ 
                         2 
                       
                        
                       
                         A 
                          
                         
                           ( 
                           
                             x 
                             , 
                             y 
                             , 
                             z 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where λ is the wavelength of the illumination, and ∇ ⊥  is the gradient operator in the lateral (x,y) dimensions. The noisy measurements I(x,y,z) usually adhere to a (continuous) Poisson distribution: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       p 
                        
                       
                         [ 
                         
                           
                             I 
                              
                             
                               ( 
                               
                                 x 
                                 , 
                                 y 
                                 , 
                                 z 
                               
                               ) 
                             
                           
                           | 
                           
                             A 
                              
                             
                               ( 
                               
                                 x 
                                 , 
                                 y 
                                 , 
                                 z 
                               
                               ) 
                             
                           
                         
                         ] 
                       
                     
                     = 
                     
                       
                          
                         
                           
                             - 
                             γ 
                           
                            
                           
                             
                                
                               
                                 A 
                                  
                                 
                                   ( 
                                   
                                     x 
                                     , 
                                     y 
                                     , 
                                     z 
                                   
                                   ) 
                                 
                               
                                
                             
                             2 
                           
                         
                       
                        
                       
                         
                           
                             ( 
                             
                               γ 
                                
                               
                                 
                                    
                                   
                                     A 
                                      
                                     
                                       ( 
                                       
                                         x 
                                         , 
                                         y 
                                         , 
                                         z 
                                       
                                       ) 
                                     
                                   
                                    
                                 
                                 2 
                               
                             
                             ) 
                           
                           
                             I 
                              
                             
                               ( 
                               
                                 x 
                                 , 
                                 y 
                                 , 
                                 z 
                               
                               ) 
                             
                           
                         
                         
                           I 
                            
                           
                             ( 
                             
                               x 
                               , 
                               y 
                               , 
                               z 
                             
                             ) 
                           
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where γ is the photon count detected by the camera. The measurement at each pixel I(x,y,z) is assumed statistically independent of any other pixel (conditioned on the optical field A(x,y,z)). 
       2. State Space Model of the Optical Field 
       [0032]    We can discretize the optical field A(x,y,z) as a raster-scanned complex column vector a n , and similarly discretize the intensity measurement I(x,y,z) as column vector I n . We denote by b(u,v,z) the 2-D Fourier transform of A(x,y,z). The column vector b n  is again raster-scanned from b(u,v,z), and hence can be expressed as b n =Ka n , where K where is the discrete Fourier transform matrix. Since K is unitary, we can write KK H =K H K=U (with normalization), where U is the identity matrix and K H  denotes the hermitian of K. 
         [0033]    We can define the propagation matrix at z n  as [15]: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       H 
                       n 
                     
                     = 
                     
                       diag 
                        
                       
                         ( 
                         
                           
                             exp 
                              
                             
                               [ 
                               
                                 
                                   - 
                                    
                                 
                                  
                                 
                                     
                                 
                                  
                                 λ 
                                  
                                 
                                     
                                 
                                  
                                 
                                   π 
                                    
                                   
                                     ( 
                                     
                                       
                                         
                                           u 
                                           1 
                                           2 
                                         
                                         
                                           L 
                                           x 
                                           2 
                                         
                                       
                                       + 
                                       
                                         
                                           v 
                                           1 
                                           2 
                                         
                                         
                                           L 
                                           y 
                                           2 
                                         
                                       
                                     
                                     ) 
                                   
                                 
                                  
                                 
                                   Δ 
                                   n 
                                 
                                  
                                 z 
                               
                               ] 
                             
                           
                           , 
                           … 
                            
                           
                               
                           
                           , 
                           
                             exp 
                              
                             
                               [ 
                               
                                 
                                   - 
                                   λ 
                                 
                                  
                                 
                                     
                                 
                                  
                                 
                                   π 
                                    
                                   
                                     ( 
                                     
                                       
                                         
                                           u 
                                           
                                             M 
                                             1 
                                           
                                           2 
                                         
                                         
                                           L 
                                           x 
                                           2 
                                         
                                       
                                       + 
                                       
                                         
                                           v 
                                           
                                             M 
                                             2 
                                           
                                           2 
                                         
                                         
                                           L 
                                           y 
                                           2 
                                         
                                       
                                     
                                     ) 
                                   
                                 
                                  
                                 
                                   Δ 
                                   n 
                                 
                                  
                                 z 
                               
                               ] 
                             
                           
                         
                         ) 
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where L x  and L y  are the width and height of the image, respectively. The relation between two images with distance Δ n z in the Fourier domain can be written as: 
         [0000]        b   n   =H   n   b   n-1   (4)
 
         [0034]    We approximate the Poisson observation (2) with a Gaussian distribution of same mean and covariance. In particular, we consider the approximate observation model: 
         [0000]        I   n   =γ|a   n | 2   +v   (5)
 
         [0000]    where v is a Gaussian vector with zero mean and covariance R=γdiag(a* n )diag(a n ). 
         [0035]    The nonlinear observation model in (5) is linearized as: 
         [0000]        I   n =γdiag( a*   n ) a   n   +v   (6)
 
         [0036]    The embodiment uses an augmented state space model given as: 
         [0000]    
       
         
           
             
               
                 
                   
                     state 
                      
                     
                       
                         : 
                       
                        
                       
                           
                       
                       [ 
                       
                         
                           
                             
                               b 
                               n 
                             
                           
                         
                         
                           
                             
                               b 
                               n 
                               * 
                             
                           
                         
                       
                       ] 
                     
                   
                   = 
                   
                     
                       [ 
                       
                         
                           
                             
                               H 
                               n 
                             
                           
                           
                             0 
                           
                         
                         
                           
                             0 
                           
                           
                             
                               H 
                               n 
                               * 
                             
                           
                         
                       
                       ] 
                     
                      
                     
                       [ 
                       
                         
                           
                             
                               b 
                               
                                 n 
                                 - 
                                 1 
                               
                             
                           
                         
                         
                           
                             
                               b 
                               
                                 n 
                                 - 
                                 1 
                               
                               * 
                             
                           
                         
                       
                       ] 
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       observation 
                        
                       
                         : 
                       
                        
                       
                           
                       
                        
                       
                         I 
                         n 
                       
                     
                     = 
                     
                       
                         
                           [ 
                           
                             
                               J 
                                
                               
                                 ( 
                                 
                                   b 
                                   n 
                                 
                                 ) 
                               
                             
                              
                             
                                 
                             
                              
                             
                               
                                 J 
                                 * 
                               
                                
                               
                                 ( 
                                 
                                   b 
                                   n 
                                 
                                 ) 
                               
                             
                           
                           ] 
                         
                          
                         
                           [ 
                           
                             
                               
                                 
                                   b 
                                   n 
                                 
                               
                             
                             
                               
                                 
                                   b 
                                   n 
                                   * 
                                 
                               
                             
                           
                           ] 
                         
                       
                       + 
                       v 
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where v is a Gaussian variable with zero mean and covariance R, 
         [0000]    
       
         
           
             
               
                 
                   R 
                   = 
                   
                     
                       γ 
                        
                       
                           
                       
                        
                       
                         diag 
                          
                         
                           ( 
                           
                             a 
                             n 
                             * 
                           
                           ) 
                         
                       
                        
                       
                         diag 
                          
                         
                           ( 
                           
                             a 
                             n 
                           
                           ) 
                         
                       
                        
                       
                           
                       
                        
                       and 
                        
                       
                           
                       
                        
                       
                         J 
                          
                         
                           ( 
                           
                             b 
                             n 
                           
                           ) 
                         
                       
                     
                     = 
                     
                       
                         1 
                         2 
                       
                        
                       γ 
                        
                       
                           
                       
                        
                       
                         diag 
                          
                         
                           ( 
                           
                             
                               K 
                               T 
                             
                              
                             
                               b 
                               n 
                               * 
                             
                           
                           ) 
                         
                       
                        
                       
                         
                           K 
                           H 
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
       3. State Estimation by Sparse ACEKF 
       [0037]    The state covariance matrix of the augmented state has the form: 
         [0000]    
       
         
           
             
               
                 
                   
                     S 
                     n 
                   
                   = 
                   
                     [ 
                     
                       
                         
                           
                             S 
                             n 
                             Q 
                           
                         
                         
                           
                             S 
                             n 
                             P 
                           
                         
                       
                       
                         
                           
                             
                               ( 
                               
                                 S 
                                 n 
                                 P 
                               
                               ) 
                             
                             * 
                           
                         
                         
                           
                             
                               ( 
                               
                                 S 
                                 n 
                                 Q 
                               
                               ) 
                             
                             * 
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0038]    Here S n   Q  or S n   P  are covariance matrices (S n   P  is in fact a pseudo-covariance matrix). From the update equations of ACEKF [1,16], we have the following steps: 
         [0039]    1. Initialize: b 0 , S Q   0  and S P   O . 
         [0040]    2. Predict: {circumflex over (b)} n =Hb n-1 , Ŝ n   Q =HS n-1   Q H H  and Ŝ n   P =HS n-1   P H H    
         [0041]    3. Update: 
         [0000]        S   n   Q   =Ŝ   n   Q −( Ŝ   n   Q   J   H   +Ŝ   n   P   J   T )( JŜ   n   Q   J   H   +JŜ   n   P   J   T   +J *( Ŝ   n   Q )* J   T   +J *( Ŝ   n   P )* J   H   +R ) −1 ( JŜ   n   Q   +J ( Ŝ   n   P )*)  (11)
 
         [0000]        S   n   P   =Ŝ   n   P −( Ŝ   n   Q   J   H   +Ŝ   n   P   J   T )( JŜ   n   Q   J   H   +JŜ   n   P   J *( Ŝ   n   Q )* J   T   +J *( Ŝ   n   P )* J   H   +R ) −1 ( JŜ   n   P   +J ( Ŝ   n   Q )*)  (12)
 
         [0000]        G   n =( S   n   Q   J   H   +S   n   P   J   T ) R   −1   (13)
 
         [0000]        b   n   ={circumflex over (b)}   n   +G   n ( I   n   −γ|a   n | 2 )  (14)
 
         [0042]    The size of S n   Q  or S n   P , is N 2 , where N is the number of the pixels in the image. The inversion of the covariance matrix has a computational complexity of O(N 3 ) in each step. Both the storage requirement and computational burden make the above update algorithm impractical for real applications. 
         [0043]    Accordingly, the embodiment makes some constraints and derivations as described below, resulting in a low-complexity algorithm with reduced storage requirement. 
         [0044]    After some derivation, we can get Lemma 1 and Theorem 1 and 2. 
       Lemma 1 
       [0045]    If H is diagonal and the diagonal entries of H are rotationally symmetric in 2-D, then EHE=H where E=KK T , and K is the Discrete Fourier Transform Matrix. 
       Theorem 1 
       [0046]    Let us consider how to initialize the covariance matrix S 0 . First note that a priori one would expect 
         [0000]    
       
      
       S 
       n 
       Q 
       =E[b 
       n 
       b 
       n 
       H 
       ]=E[Ka 
       n 
       a 
       n 
       H 
       K 
       H 
       ]=KE[a 
       n 
       a 
       n 
       H 
       ]K 
       H  
      
     
         [0000]    
       
      
       S 
       n 
       P 
       =E[b 
       n 
       b 
       n 
       T 
       ]=E[Ka 
       n 
       a 
       n 
       T 
       K 
       T 
       ]=KE[a 
       n 
       a 
       n 
       T 
       ]K 
       T  
      
     
         [0047]    Here E[ . . . ] denotes expectation value. It is assumed that in the complex field every pixel is independently Poisson distributed, we can assume that E[a n  a n   T ] is equal to a scalar times the identity matrix. Thus, the covariance matrix can be initialized as: 
         [0000]    
       
      
       S 
       0 
       Q 
       =Q 
       0 
       KK 
       H 
       =Q 
       0  
      
     
         [0000]    
       
      
       S 
       0 
       T 
       =P 
       0 
       KK 
       T 
       =P 
       0 
       E  
      
     
         [0000]    where Q 0  and P 0  are a scalar times the identity matrix. E=KK T  can be shown to be a permutation matrix, and symmetric. 
         [0048]    More generally, we write 
         [0000]        S   n-1   Q   =Q   n-1 , and  (15)
 
         [0000]        S   n-1   P   =P   n-1   E   (16)
 
         [0000]    where Q n-1  and P n-1  are diagonal. The covariance matrix can be updated as follows 
         [0049]    Predict: 
         [0000]        {circumflex over (Q)}   n   =Q   n-1   (17)
 
         [0000]        {circumflex over (P)}   n   =HP   n-1   H   (18)
 
         [0050]    Update: 
         [0000]        Q   n   ={circumflex over (Q)}   n −( {circumflex over (Q)}   n   +{circumflex over (P)}   n )( {circumflex over (Q)}   n   +{circumflex over (P)}   n +( {circumflex over (Q)}   n )*+( {circumflex over (P)}   n )*+ qI ) −1 ( {circumflex over (Q)}   n +( {circumflex over (P)}   n )*)  (19)
 
         [0000]        P   n   ={circumflex over (P)}   n −( {circumflex over (Q)}   n   +{circumflex over (P)}   n )( {circumflex over (Q)}   n   +{circumflex over (P)}   n +( {circumflex over (Q)}   n )*+( {circumflex over (P)}   n )*+ qI ) −1 ( {circumflex over (P)}   n +( {circumflex over (Q)}   n )*)  (20)
 
         [0000]        S   n   Q   =Q   n   (21)
 
         [0000]        S   n   P   =P   n   E   (22)
 
         [0000]    where 
         [0000]    
       
         
           
             q 
             = 
             
               
                 1 
                 
                   
                     0.5 
                     2 
                   
                    
                   γ 
                 
               
               . 
             
           
         
       
     
         [0000]    Note that Q n  and P n  are diagonal. The covariance matrix S n   Q  and S n   P  has the same form as the covariance S n-1   Q  and S n-1   P . Therefore once the first covariance matrix are initialized as S 0   Q =Q 0  and S 0   P =P 0 E, the other matrices in the following steps has the same form. 
         [0051]    The proof of theorem 1 requires the assumption that the value of the phase is small so that, defining D by 
         [0000]    
       
         
           
             D 
             = 
             
               
                 1 
                 2 
               
                
               γ 
                
               
                   
               
                
               
                 diag 
                  
                 
                   ( 
                   
                     a 
                     n 
                     * 
                   
                   ) 
                 
               
             
           
         
       
     
         [0000]    it can be approximated that D*D −1  equals the identity matrix. 
       Theorem 2 
       [0052]    The Kalman gain and update formula for the state are 
         [0000]        G   n =( S   n   Q   J   H   +S   n   P   J   T ) R   −1 =+( Q   n   +P   n )( J ) −1   q   (23)
 
         [0000]        b   n   ={circumflex over (b)}   n   +G   n ( I   n   −γ|a   n | 2 )  (24)
 
         [0053]    Using these results, the algorithm presented above can be reformulated as a Sparse augmented complex extended Kalman filter algorithm, used by the embodiment:
       (i) Initialization of b 0 , Q 0  and P 0 .   (ii) Prediction:       
 
         [0000]        {circumflex over (b)}   n   =Hb   n-1   (25)
 
         [0000]        {circumflex over (Q)}   n   =Q   n-1   (26)
 
         [0000]        {circumflex over (P)}   n   =HP   n-1   H   (27)
       (iii) Update:       
 
         [0000]        â   n   =K   H   {circumflex over (b)}   n   (28)
 
         [0000]        Q   n   ={circumflex over (Q)}   n −( {circumflex over (Q)}   n   +{circumflex over (P)}   n )( {circumflex over (Q)}   n   +{circumflex over (P)}   n +( {circumflex over (Q)}   n )*+( {circumflex over (P)}   n )*+ qI ) −1 ( {circumflex over (Q)}   n +( {circumflex over (P)}   n )*)  (29)
 
         [0000]        P   n   ={circumflex over (P)}   n −( {circumflex over (Q)}   n   +{circumflex over (P)}   n )( {circumflex over (Q)}   n   +{circumflex over (P)}   n +( {circumflex over (Q)}   n )*+( {circumflex over (P)}   n )*+ qI ) −1 ( {circumflex over (P)}   n +( {circumflex over (Q)}   n )*)  (30)
 
         [0000]        b   n   ={circumflex over (b)}   n +( Q   n   +P   n )( J ) −1   q ( I   n   −γ|a   n | 2 ) 
         [0057]    Matrices Q, and P n  are diagonal, hence they can be stored as two vectors. The storage burden of equations (11), (12) in the update step is reduced from N 2  to N. The inverse of J in equation (31) can be computed by a Fast Fourier Transform (FFT). Since Q n  and P n  are diagonal, the matrix multiplications and inversions in equations (29) and (30) have a computational complexity of O(N). The overall computational complexity of the sparse ACEKF is at the scale of O(N z  N log(N)) due to the FFT. 
       4. Experimental Results of Sparse ACEKF 
       [0058]    Three sets of data have been considered to assess the performance the augmented Kalman filter. Data Set  1  consists of 100 images of size 100×100 pixels artificially generated to simulate a complex field propagating from focus in 0.5 μm steps over a distance of 50 μm with illumination wavelength of 532 nm. Pixels are corrupted by Poisson noise so that, on average, each pixel detects γ=0.998 photons. 
         [0059]    Data Set  2  comprises 50 images of size 150×150 pixels acquired by a microscope. The wavelength was again 532 nm, and the defocused intensity images were captured by moving the camera axially with a step size of 2 μm over a distance of 100 μm. 
         [0060]    Data Set  3  has 101 images of size 492×656 pixels acquired by a microscope. The wavelength was 633 nm, and the images were captured by moving the camera axially with a step size of 2 μm.  FIG. 3  shows the images of simulated data Data Set  1  ( FIG. 3(   a )) and experimental data Data Set  2  ( FIG. 3(   b )) and Data Set  3  ( FIG. 3(   c )). 
       4.1 Data Set  1   
       [0061]    Table 2 summarizes the results of Data Set  1  using three methods: ACEKF (augmented complex extended Kalman filter) [1], diagonalized CEKF (diagonalized complex extended Kalman filter) [8], and the method sparse ACEKF (Sparse augmented complex extended Kalman filter) used in the embodiment. The ACEKF method has a high computational complexity of O(N z N 3 ) and storage requirement of O(N 2 ). In order to alleviate the computational burden of ACEKF, the images are divided into independent blocks of size 50×50, but it still takes 13562.8 seconds by a general personal computer. On the other hand, the computational complexity of the sparse ACEKF is 0(N z N log N), and it takes 0.40 seconds to process the 100 (full) images.  FIG. 4  shows recovered intensity and phase images obtained by processing the dataset of  FIG. 3(   a ) by ACEKF, diagonalized CEKF, and the embodiment. The results shown are those at the focal plane. 
         [0000]    
       
         
               
               
               
               
               
               
             
               
               
               
               
               
               
             
           
               
                   
                 TABLE 2 
               
               
                   
                   
               
               
                   
                   
                   
                   
                 Inten- 
                   
               
               
                   
                   
                   
                   
                 sity 
                 Phase error 
               
               
                   
                 Complexity 
                 Time[s] 
                 Storage 
                 error 
                 [radian] 
               
               
                   
                   
               
             
             
               
                   
               
             
          
           
               
                 ACEKF [1] 
                 O(N z N 3 ) 
                 13562.80 
                 O(N 2 ) 
                 0.0091 
                 0.0139 
               
               
                   
                   
                 (in block) 
               
               
                 Diagonal- 
                 O(N z NlogN) 
                   0.30 
                 O(N) 
                 0.0079 
                 0.0166 
               
               
                 ized 
               
               
                 CEKF [8] 
               
               
                 Sparse 
                 O(N z NlogN) 
                   0.40 
                 O(N) 
                 0.0071 
                 0.0143 
               
               
                 ACEKF 
               
               
                 (Embodi- 
               
               
                 ment) 
               
               
                   
               
             
          
         
       
     
         [0062]    As illustrated in Table 2, the computational complexity of the diagonalized CEKF is lower than that of ACEKF. However, the latter yields better results in terms of phase error. In order to reduce the error of the diagonalized CEKF, forward and backward sweeps (iterations) are applied in [8]. However, the iteration increases the computational complexity linearly, and makes the method no longer recursive. The sparse ACEKF method has an intensity error of 0.0071, and a phase error of 0.0143 (radian). Compared with the diagonalized CEKF, the sparse ACEKF has the same computational complexity and storage requirement, but returns lower error images. 
         [0063]    The error is here calculated by root mean square error (MSE). However, MSE might not be optimal to evaluate the error. The proposed sparse ACEKF has an error near to ACEKF, while the recovered phase and intensity images of the sparse ACEKF in  FIG. 4  might look better. The images recovered by ACEKF exhibit a block effect as straight lines crossing the images, whereas the result of sparse ACEKF is free of this block effect. It is because the sparse ACEKF has a much lower complexity that the embodiment avoids the need to divide the images into independent blocks. The images recovered by ACEKF and the diagonalized CEKF contain traces of phase in the intensity images. However, the trace of phase is almost removed on the estimated intensity image of the sparse ACEKF. 
       4.2 Experimental Data (Datasets  2  and  3 ) 
       [0064]      FIG. 5  compares the estimated intensity image and phase image of Data Set  2  using ACEKF, the diagonalized CEKF, and the sparse ACEKF. Stripes in the phase image recovered by the diagonalized CEKF look darker, while the strips in the recovered phase image of the sparse ACEKF method have stronger contrast. All images are as at the focal plane. 
         [0065]      FIG. 6(   a ) shows the recovered phase [nm] of the Data Set  3  by ACEKF, the diagonalized CEKF, and the sparse ACEKF. The real depth of the sample in Data Set  3  is around 75 nm±5 nm. The proposed embodiment takes 20.24 seconds to process 101 images of size 492×656. However, the ACEKF method takes 54.15 hours and each image is separated into 117 pieces of 50×50 blocks.  FIG. 6  ( b ) compares the depth along the black line in  FIG. 6(   a ). The sparse ACEKF method shows a result much closer to the true value, compared to ACEKF and the diagonalized CEKF. 
       5. Variations of the Embodiment 
       [0066]    There are other state space models for which the concept of a diagonal covariance matrix can be applied. For example, based on (4)-(6) we have a state space model: 
         [0000]      State:  b   n   =H   n   b   n-1 ; 
         [0000]      Observation:  I   n =γdiag( a*   n ) a   n   +v  
 
         [0067]    We can define the follow three steps using a standard Kalman filter [16]: 
         [0068]    (1) Initialization: b 0  and error covariance matrix, M O . 
         [0069]    (2) Prediction: {circumflex over (b)} n =Hb n-1 ; {circumflex over (M)} n =HM n-1 H H    
         [0070]    (3) Update: G n ={circumflex over (M)} n J H (J{circumflex over (M)} n J H +R) −1    
         [0000]        b   n   ={circumflex over (b)}   n   +G   n ( I   n   −J{circumflex over (b)}   n ) 
         [0000]    
       
      
       M 
       n 
       ={circumflex over (M)} 
       n 
       −G 
       n 
       J{circumflex over (M)} 
       n  
      
     
         [0071]    It can be shown that provided M 0  is initialized with a diagonal covariance matrix (specifically M 0  is a scalar times U), the state covariance matrix for all n is diagonal. In this case the update procedure becomes simply: 
         [0000]    
       
         
           
             
               
                 a 
                 ^ 
               
               n 
             
             = 
             
               
                 K 
                 H 
               
                
               
                 
                   b 
                   ^ 
                 
                 n 
               
             
           
         
       
       
         
           
             
               M 
               n 
             
             = 
             
               
                 
                   α 
                   n 
                 
                  
                 U 
                  
                 
                     
                 
                  
                 with 
                  
                 
                     
                 
                  
                 
                   α 
                   n 
                 
               
               = 
               
                 
                   α 
                   
                     n 
                     - 
                     1 
                   
                 
                 
                   
                     γ 
                      
                     
                         
                     
                      
                     
                       α 
                       
                         n 
                         - 
                         1 
                       
                     
                   
                   + 
                   1 
                 
               
             
           
         
       
       
         
           
             
               b 
               n 
             
             = 
             
               
                 
                   ( 
                   
                     1 
                     - 
                     
                       
                         α 
                         n 
                       
                        
                       γ 
                     
                   
                   ) 
                 
                  
                 
                   
                     b 
                     ^ 
                   
                   n 
                 
               
               + 
               
                 
                   α 
                   n 
                 
                  
                 γ 
                  
                 
                     
                 
                  
                 
                   J 
                   
                     - 
                     1 
                   
                 
                  
                 
                   I 
                   n 
                 
               
             
           
         
       
     
         [0072]    The inverse of J can be computed efficiently by means of a Fast Fourier Transform (FFT) algorithm. Both the embodiment described in the previous sections, and this variation, are low-complexity algorithms. As compared the embodiment, this variation takes more iterations to converge, but it has the advantage of being more stable. 
       6. Commercial Applications 
       [0073]    The method could efficiently recover phase and amplitude from a series of noisy defocused images. It is recursive, and feasible for the real time application. The phase from intensity techniques could find applications in areas such as biology and surface profiling. Due to the scalability of the wave equations and the simplicity of the measurement technique, this method could find use in phase imaging beyond optical wavelengths (for example, X-ray or neutron imaging), where high-quality images are difficult to obtain and noise is significant and unavoidable. 
         [0074]    Digital holographic microscopy (DHM) has been successfully applied in a range of application areas [5]. However, due to DHM&#39;s capability of non-invasively visualizing and quantifying biological tissue, biomedical applications have received most attention. Wave propagation based methods, and the proposed method in particular, may be applied to the same range of applications. Examples of biomedical applications are [5]:
       Label-free cell counting in adherent cell cultures. Phase imaging makes it possible to perform cell counting and to measure cell viability directly in the cell culture chamber. Today, the most commonly used cell counting methods, hemocytometer or Coulter counter, only work with cells that are in suspension.   Label-free viability analysis of adherent cell cultures. Phase imaging has been used to study the apoptotic process in different cell types. The refractive index changes taking place during the apoptotic process are easily measured through phase imaging.   Label-free cell cycle analysis. The phase shift induced by cells has been shown to be correlated to the cell dry mass. The cell dry mass can be combined with other parameters obtainable by phase imaging, such as cell volume and refractive index, to provide a better understanding of the cell cycle.   Label-free morphology analysis of cells. Phase imaging has been used in different contexts to study cell morphology using neither staining nor labeling. This can be used to follow processes such as the differentiation process where cell characteristics change. Phase imaging has also been used for automated plant stem cell monitoring, and made it possible to distinguish between two types of stem cells by measuring morphological parameters.   Label free nerve cell studies. Phase imaging makes it possible to study undisturbed processes in nerve cells as no labeling is required. The swelling and shape changing of nerve cells caused by cellular imbalance was easily studied.   Label-free high content analysis. Fluorescent high content analysis/screening has several drawbacks. Label-free alternatives based on phase shift images have therefore been proposed. The capability of phase imaging to obtain phase shift images rapidly over large areas opens up new possibilities of very rapid quantitative characterization of the cell cycle and the effects of specific pharmacological agents.   Red blood cell analysis. Phase shift images have been used to study red blood cell dynamics. Red blood cell volume and hemoglobin concentration has been measured by combining information from absorption and phase shift images to facilitate complete blood cell count by phase imaging. It has furthermore been shown that phase shift information discriminates immature red blood cells from mature, facilitating unstained reticulocyte count.   Flow cytometry and particle tracking and characterization. Phase images are calculated from the recorded intensity images at any time after the actual recording and at any given focal plane. By combining several images calculated from the same intensity images, but at different focal planes, an increased depth of field may be obtained, which is vastly superior to what can be achieved with traditional light microscopy. The increased depth of field makes it possible to image and characterize the morphology of cells and particles while in suspension. Observations may be done directly in a microfluidic channel or statically in an observation chamber.   Time-lapse microscopy of cell division and migration. The autofocus and phase shift imaging capabilities of DHM and the proposed method makes it possible to effortlessly create label-free and quantifiable time-lapse video clips of unstained cells for cell migration studies.   Tomography studies. Phase imaging allows for label-free and quantifiable analysis of subcellular motion deep in living tissue.       
 
       REFERENCES 
       [0000]    
       
         [1] L. Waller, M. Tsang, S. Ponda, S. Yang, and G. Barbastathis, “Phase and amplitude imaging from noisy images by Kalman filtering,” Optics Express 19, 2805-2814 (2011). 
         [2] R. Paxman, T. Schulz, and J. Fienup. “Joint estimation of object and aberrations by using phase diversity”, J. Opt. Soc. Am. A, 9(7):1072-1085, 1992. 
         [3] Phase contrast microscopy, http://en.wikipedia.org/wiki/Phase_contrast_microscopy 
         [4] Differential interference contrast microscopy. http://en.wikipedia.org/wiki/Differential_interference_contrast_microscopy 
         [5] Digital holographic microscopy, http://en.wiipedia.org/wiki/Digital_holographic_microscopy. 
         [6] J. M. Huntley, “Phase Unwrapping: Problems and Approaches”,  Proc. FASIG, Fringe Analysis  94. York University, 391-393, 1994a. 
         [7] M. Takeda, “Recent Progress in Phase-Unwrapping Techniques”,  Proc. SPIE,  2782:334-343, 1996. 
         [8] Zhong Jingshan, Justin Dauwels, Manuel A. Vazquez, Laura Waller. “Efficient Gaussian Inference Algorithms for Phase Imaging”,  Proc. IEEE ICASSP,  617-620, 2012. 
         [9] R. Gerchberg and W. Saxton, “A practical algorithm for the determination of phase from image and diffraction plane picture”,  Optik,  35:273-246, 1972. 
         [10] J. Fienup, “Phase retrieval algorithms: a comparison”,  Appl. Opt.,  21, 1982. 
         [11] M. Teague, “Deterministic phase retrieval: a Green&#39;s function solution”,  J. Opt. Soc. Am. A,  73(11):1434, 1983. 
         [12] M. Soto and E. Acosta, “Improved phase imaging from intensity measurements in multiple planes”,  Appl. Opt.,  46(33):7978-7981, 2007. 
         [13] L. Waller, L. Tian, and G. Barbastathis. “Transport of intensity phase-amplitude imaging with higher order intensity derivatives”,  Opt. Express,  18(12):12552-12561, 2010. 
         [14] R. Paxman and J. Fienup. “Optical misalignment sensing and image reconstruction using phase diversity”,  J. Opt. Soc. Am. A,  5(6):914-923, 1988. 
         [15] J. Goodman, Introduction to Fourier Optics, McGraw-Hill. 
         [16] R. Kalman et al., “A new approach to linear filtering and prediction problems”,  J. basic Eng.,  82(1): 35-45, 1960.