Abstract:
To construct a video surveillance system, the Gaussian mixture modeling (GMM) is a popular choice among various background modeling approaches, for its capability of adaptation to background variations. However, the GMM often suffers from a tradeoff between robustness to background changes and sensitivity to foreground abnormalities, and is inefficient in managing the tradeoff for diverse surveillance scenarios. In the present invention, we identify that such a tradeoff can be easily controlled by a new computational scheme of two-type learning rate control for the GMM. Based on the proposed rate control scheme, a new video surveillance system that applies feedbacks of pixel properties computed in object-level analysis to the learning rate controls of the GMM in pixel-level background modeling is developed. Such a system gives better regularization of background adaptation and is efficient in resolving the tradeoff for many surveillance applications.

Description:
REFERENCES 
       [0000]    
       
         H.-T. Chen, H.-H. Lin, and T.-L. Liu,  Multi - object Tracking Using Dynamical Graph Matching , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 210-217, 2001. 
         M. Harville, Segmenting Video Input Using High-Level Feedback, U.S. Pat. No. 6,999,620 B1, February 2006. 
         D.-S. Lee, Adaptive Mixture Learning in a Dynamic System, U.S. Pat. No. 7,103,584 B2, September 2006. 
         D.-S. Lee,  Effective Gaussian Mixture Learning for Video Background Subtraction , IEEE Trans. Pattern Anal. Mach. Intell., Vol. 27, No. 5, pp. 827-832, 2005. 
         C. Stauffer and W. E. L. Grimson,  Adaptive background mixture models for real - time tracking , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Vol. 2, pp. 246-252, 1999. 
       
     
       BACKGROUND 
       [0006]    The present invention relates generally to the design of a video surveillance system rooted in the Gaussian mixture modeling for background subtraction-based applications. More particularly, the present invention relates to a novel computational scheme of two-type learning rate control for the Gaussian mixture modeling, wherein high-level feedbacks of pixel properties are applied to the adaptive adjustments of the learning rates. 
         [0007]    For video surveillance using static camera, background subtraction is often regarded as an effective and efficient method for differentiating foreground objects from a background scene. The performance of background subtraction highly depends on how a background scene is modeled. Ideally, an ideal design of background modeling should be able to tolerate various background variations without losing the sensitivity in detecting abnormal foreground objects. However, the tradeoff between model robustness and model sensitivity is commonly encountered in practice and is hard to be balanced within a single background modeling framework. 
         [0008]    Among various background modeling approaches, the Gaussian mixture modeling (GMM), proposed by C. Stauffer and W. E. L. Grimson,  Adaptive background mixture models for real - time tracking , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Vol. 2, pp. 246-252, 1999, is known to be effective in sustaining background variations, e.g., waving trees, due to its use of multiple buffers to memorize scene states. It is hence widely adopted as a base framework in many later developments, e.g., M. Harville, Segmenting Video Input Using High-Level Feedback, U.S. Pat. No. 6,999,620 B1, February 2006, and D.-S. Lee, Adaptive Mixture Learning in a Dynamic System, U.S. Pat. No. 7,103,584 B2, September 2006. However, the GMM often suffers from the tradeoff between model robustness to background changes and model sensitivity to foreground  20  abnormalities, abbreviated as R-S tradeoff. For instance, a Gaussian mixture model being tuned to tolerate quick changes in background may also adapt itself to stationary objects, e.g., unattended bags left by passengers, too quickly to issue reliable alarms. The lack of a simple and flexible way to manage the R-S tradeoff for various scenarios motivates this invention. 
         [0009]    In the GMM formulations, every image pixel, regardless of its intensity being changing or not, is given the same setting of learning rates in background model estimation, which is inefficient in managing the R-S tradeoff. (The definition of learning rate is inherited from C. Stauffer and W. E. L. Grimson,  Adaptive background mixture models for real - time tracking , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Vol. 2, pp. 246-252, 1999, and will be specifically defined later.) Considering a pixel of background that was just uncovered from occlusion of a moving object, the corresponding Gaussian mixture model for this pixel should be updated in a slower pace than that for a stable background pixel, to prevent false inclusion of moving shadows or motion blurs into background. Nonetheless, in the original GMM formulations, an identical learning rate setting is applied to all image pixels, leaving no space for tuning the background adaptation speeds for this case. We therefore highlight the importance of adaptive learning rates control in space and in time, and propose a new video surveillance system with a novel learning rate control scheme for the GMM. 
         [0010]    In the present invention related to a new learning rate control scheme for the GMM, high-level feedbacks of pixel properties are applies to adaptive adjustments of the learning rates in space and in time. Despite that the idea of adopting high-level feedbacks, such as foreground pixel type, in background modeling is not new, e.g., M. Harville, Segmenting Video Input Using High-Level Feedback, U.S. Pat. No. 6,999,620 B1, February 2006, to the best of our knowledge, the proposed learning rate control scheme is the first to utilize two types of learning rate controls for enhancing the model estimation accuracy and regularizing the R-S tradeoff simultaneously. In the present invention, high-level feedbacks are applied only to the learning rate control related to the R-S tradeoff, but not to the other related to the model estimation accuracy, which leads to a unique design of a robust surveillance system. 
       SUMMARY 
       [0011]    The present invention proposes a new design of a video surveillance system based on the GMM. Particularly, the present invention addresses a novel learning rate control scheme for the GMM, wherein two types of learning rates are adopted and high-level feedbacks of pixel types are used for adaptive adjustments of learning rate settings. With the present invention of a surveillance system design, the inherent tradeoff between model robustness to background changes and model sensitivity to foreground abnormalities for the GMM can be effectively and efficiently regularized for various needs in video surveillance. 
         [0012]    New features of the present invention are in three folds. Firstly, two types of learning rates are adopted in a Gaussian mixture model, one for controlling the model estimation accuracy and the other for regularizing the R-S tradeoff. Different from the general GMM formulations that use a single learning rate setting for both the learning needs, the present invention distinguishes two different types of learning rates and manipulates them independently. Secondly, the background adaptation rate for each image pixel is set individually in space. Image pixels at different locations may thus exhibit distinct behaviors in background adaptation for accommodating local scene changes. Thirdly, for every image pixel, its learning rate for regularizing the R-S tradeoff is computed based on the high level feedback of its latest pixel type, e.g., as background, stationary foreground, moving foreground, etc. Under this feedback control, the learning rate setting for an image pixel can be dynamically adjusted in time, according to the feedback type, and with respect to different application scenarios. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0013]      FIG. 1  shows a block diagram of the proposed, general-purposed video surveillance system in an embodiment of the present invention; 
           [0014]      FIG. 2  shows the simulated changes of the learning rate η t  for a pixel being persistent background, given β b =0.01 (solid line) and β b =0.1 (dotted line), respectively, where the initial learning rate η t=0  is set to 1/6000 and η b  is set to 0.025; and 
           [0015]      FIG. 3  shows experimental comparisons of D.-S. Lee,  Effective Gaussian Mixture Learning, for Video Background Subtraction , IEEE Trans. Pattern Anal. Mach. Intell., Vol. 27, No. 5, pp. 827-832, 2005, and the present invention with experimental scenarios of missing object and waving hand. Top row: foreground detection results; middle row: background maps; bottom row: foreground maps. While FIGS.  3 (A)-(C) are the compared results, FIGS.  3 (D)-(F) are ours. In  FIG. 3(F) , the cellular phone taken away is identified as missing object and enclosed by a double box. 
       
    
    
     DETAILED DESCRIPTION 
       [0016]    Reference will now be made in detail to the present embodiments of the invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the description to refer to the same or like parts. It is also to be understood that the detail description of the present embodiments is by examples and is intended to provide further explanation of the invention as claimed. 
       A. Model Accuracy, Robustness and Sensitivity 
       [0017]    To estimate a density distribution from a sequence of intensities I 0,x , . . . , T t,x  for an image pixel at a position x via GMM, three issues regarding model accuracy, robustness and sensitivity need to be addressed. (Here I t,x ε          denotes the 1-D pixel intensity. Yet, all our formulations can be easily extended to multi-dimensional color image processing.) Specifically, a mixture model consisting of N Gaussian distributions at time instance t can be denoted by 
         [0000]    
       
         
           
             
               
                 P 
                  
                 
                   ( 
                   
                     I 
                     
                       t 
                       , 
                       x 
                     
                   
                   ) 
                 
               
               = 
               
                 
                   ∑ 
                   
                     n 
                     = 
                     1 
                   
                   N 
                 
                  
                 
                   
                     w 
                     
                       
                         t 
                         - 
                         1 
                       
                       , 
                       x 
                       , 
                       n 
                     
                   
                    
                   
                     N 
                      
                     
                       ( 
                       
                         
                           
                             I 
                             
                               t 
                               , 
                               x 
                             
                           
                           ; 
                           
                             μ 
                             
                               
                                 t 
                                 - 
                                 1 
                               
                               , 
                               x 
                               , 
                               n 
                             
                           
                         
                         , 
                         
                           σ 
                           
                             
                               t 
                               - 
                               1 
                             
                             , 
                             x 
                             , 
                             n 
                           
                           2 
                         
                       
                       ) 
                     
                   
                 
               
             
             , 
           
         
       
     
         [0000]    in where N symbolizes a Gaussian probability density function, μ t−1,x,n  and σ t−1,x,n   2  are the Gaussian parameters of the nth model, and w t−1,x,n  is the respective mixture weight. For maintaining this mixture model, the parameters μ t−1 , σ t−1   2  and w t−1  need to be updated based on a new observation I t,x . In general GMM formulations, e.g., D.-S. Lee, Adaptive Mixture Learning in a Dynamic System, U.S. Pat. No. 7,103,584 is B2, September 2006, the update rules for the case that I t,x  matches the nth Gaussian model are 
         [0000]    
       
         
           
             
               
                 
                   
                     μ 
                     
                       t 
                       , 
                       x 
                       , 
                       n 
                     
                   
                   = 
                   
                     
                       
                         ( 
                         
                           1 
                           - 
                           
                             
                               ρ 
                               
                                 t 
                                 , 
                                 x 
                                 , 
                                 n 
                               
                             
                              
                             
                               ( 
                               α 
                               ) 
                             
                           
                         
                         ) 
                       
                        
                       
                         μ 
                         
                           
                             t 
                             - 
                             1 
                           
                           , 
                           x 
                           , 
                           n 
                         
                       
                     
                     + 
                     
                       
                         
                           ρ 
                           
                             t 
                             , 
                             x 
                             , 
                             n 
                           
                         
                          
                         
                           ( 
                           α 
                           ) 
                         
                       
                        
                       
                         I 
                         
                           t 
                           , 
                           x 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
             
               
                 
                   
                     σ 
                     
                       t 
                       , 
                       x 
                       , 
                       n 
                     
                     2 
                   
                   = 
                   
                     
                       
                         ( 
                         
                           1 
                           - 
                           
                             
                               ρ 
                               
                                 t 
                                 , 
                                 x 
                                 , 
                                 n 
                               
                             
                              
                             
                               ( 
                               α 
                               ) 
                             
                           
                         
                         ) 
                       
                        
                       
                         σ 
                         
                           
                             t 
                             - 
                             1 
                           
                           , 
                           x 
                           , 
                           n 
                         
                         2 
                       
                     
                     + 
                     
                       
                         
                           ρ 
                           
                             t 
                             , 
                             x 
                             , 
                             n 
                           
                         
                          
                         
                           ( 
                           α 
                           ) 
                         
                       
                        
                       
                         
                           ( 
                           
                             
                               I 
                               
                                 t 
                                 , 
                                 x 
                               
                             
                             - 
                             
                               μ 
                               
                                 t 
                                 , 
                                 x 
                                 , 
                                 n 
                               
                             
                           
                           ) 
                         
                         2 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
             
               
                 
                   
                     w 
                     
                       t 
                       , 
                       x 
                       , 
                       n 
                     
                   
                   = 
                   
                     
                       
                         ( 
                         
                           1 
                           - 
                           α 
                         
                         ) 
                       
                        
                       
                         w 
                         
                           
                             t 
                             - 
                             1 
                           
                           , 
                           x 
                           , 
                           n 
                         
                       
                     
                     + 
                     α 
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where ρ t,x,n (α) and α, both in [0,1], are learning rates that control how fast the estimates μ, σ 2  and w converge to new observations. In C. Stauffer and W. E. L. Grimson,  Adaptive background mixture models for real - time tracking , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Vol. 2, pp. 246-252, 1999, the relationship between the two learning rates ρ and α is defined as 
         [0000]      ρ t,x,n (α)=α N ( I   t,x ; μ t−1,x,n ,σ t−1,x,n   2 )
 
         [0000]    while in D.-S. Lee, Adaptive Mixture Learning in a Dynamic System, U.S. Pat. No. 7,103,584 B2, September 2006, a variant is given by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       ρ 
                       
                         t 
                         , 
                         x 
                         , 
                         n 
                       
                     
                      
                     
                       ( 
                       α 
                       ) 
                     
                   
                   = 
                   
                     ( 
                     
                       
                         
                           1 
                           - 
                           α 
                         
                         
                           t 
                           + 
                           1 
                         
                       
                       + 
                       α 
                     
                     ) 
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
         [0000]    From the two definitions of ρ, one can see that α is actually the only parameter that controls the convergence speeds for all the three update rules regarding μ, σ 2  and w. 
         [0018]    In updating the Gaussian parameters μ and σ 2 , their values should reflect the up-to-date statistics of a scene as accurately as possible. It is thus preferable to set their learning rates to large values to quickly derive Gaussian distributions that fit new observations. As also noted in D.-S. Lee,  Effective Gaussian Mixture Learning for Video Background Subtraction , IEEE Trans. Pattern Anal. Mach. Intell., Vol. 27, No. 5, pp. 827-832, 2005, using (4) gives a higher learning rate ρ of at the beginning of the GMM estimation process, and improves model accuracy in estimating μ and σ 2 . 
         [0019]    While the model estimation accuracy depends on the learning rates for the Gaussian parameters μ and σ 2 , the model robustness and sensitivity, as identified by the present invention, are affected by the learning rate for the mixture weight w. In the GMM, the classification of Gaussian models (for an image pixel) into foreground and background is done by evaluating their mixture weights through thresholding. The Gaussian models that appear more often will receive larger weights in the model updating process via (3), and will possibly be labeled as background. However, we notice that the frequency of model occurrence should not be the only factor that guides the changes of the mixture weights. For example, one may prefer to give large weights to the Gaussian models of tree shadows (for background adaptation) while to keep small weights to those of stopped cars (for foreground detection), despite the similar frequencies of occurrence of these two stilt objects. Using the weight update rule (3) with simply a constant learning rate α fails to fulfill such needs of adaptive tuning model weights, and leads to difficulties in the regularization of the R-S tradeoff. 
         [0020]    Unlike general GMM-based background modeling approaches that applies a shared parameter α to the updating of all the three estimates μ, σ 2  and w, we instead propose to separate the learning rate for the Gaussian parameters (μ and σ 2 ) from that for the mixture weight (w). In contrast with (3), a new update rule for w is given by 
         [0000]        w   t,x,n =(1−η t,x (β)) w   t−1,x,n +η t,x (β),
 
         [0000]    where η t,x (β)ε[0,1] is a new learning rate introduced for the updating of the mixture weight. Now, we have two scalars α and β acting as hyper-parameters over the two types of learning rates ρ(α) and η(β), respectively, for tuning, their values. By introducing the two independent learning rates ρ(α) and η(β) into the GMM, the controls of the model accuracy and the R-S tradeoff can be decoupled, which makes the simultaneous fulfillments of speedy model convergence and R-S tradeoff regularization possible. 
         [0021]    Furthermore, the high-level information, e.g., the pixel types of shadow or car, can be imposed on the settings of η t,x (β)s at different pixel locations and time instances. For example, if an image pixel at x is detected as shadow- (car-) type at the time instance t, the corresponding learning rate η t,x  can be set to a large (small) value for quick (slow) background adaptation. As more pixel types are designated by a surveillance system, more appropriate controls on weight changes are able to be advised accordingly, which will help resolving the R-S tradeoff in background modeling. Besides, the model estimation accuracy will not be affected by such adaptive learning rate tuning due to the separation of the learning rate ρ from η. 
       B. Background Model Maintenance 
       [0022]    Before addressing the whole design of the proposed surveillance system, one of the system modules, background model maintenance, that embodies the two-type learning rate control scheme is detailed first. Given a new observation of pixel intensity I t,x , the task of background model maintenance is to match this new observation to existing Gaussian distributions, if possible, and to renew all the parameters of the Gaussian mixture model for this pixel. The detailed steps of background model maintenance based on the GMM for the design of a surveillance system is shown in Algorithm 1. 
         [0000]    
       
         
               
             
               
               
             
               
               
               
               
             
               
               
             
               
               
               
             
               
               
             
               
               
               
             
               
               
             
           
               
                   
               
               
                 Algorithm 1: Background model maintenance 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 Given: T σ , σ 0   2 , w 0   
               
               
                   
                 // Model matching 
               
               
                   
                 M t,x,n  = 0, ∀n = 1, . . ., N 
               
               
                   
                 d t,x,n  = inf, ∀n = 1, . . ., N 
               
               
                   
                 for n = 1, . . ., N do 
               
             
          
           
               
                   
                   
                   
                 if |I t,x  − μ t−1,x,n | ≦ T σ σ t−1,x,n  then d t,x  = −w t−1,x,n   
               
             
          
           
               
                   
                 l(t, x) = arg min n=1, . . ., N  d t,x,n   
               
               
                   
                 If d t,x  ≠ inf then M t,x,l(t,x)  = 1 else l(t, x) = 0 
               
               
                   
                 // Model maintenance 
               
               
                   
                 w t,x,n  = (1 − η t,x (β))w t−1,x,n  + η t,x (β)M t,x,n , ∀n 
               
               
                   
                 If M t,x,n  = 1 then 
               
             
          
           
               
                   
                   
                 // Update phase 
               
               
                   
                   
                 ρ t,x,l(t,x) (α) = α N(I t,x ; μ t−1,x,l(t,x) , σ t−1,x,l(t,x)   2 ) 
               
               
                   
                   
                 u t,x,l(t,x) (α) = (1 − ρ t,x,l(t,x) (α)) u t−1,x,l(t,x)  + ρ t,x,l(t,x)  I t,x   
               
               
                   
                   
                 σ t,x,l(t,x)   2 (α) = (1 − ρ t,x,l(t,x )(α)) σ t−1,x,l(t,x)   2  + ρ t,x,l(t,x)  (I t,x  − u t,x,l(t,x) ) 2   
               
             
          
           
               
                   
                 else 
               
             
          
           
               
                   
                   
                 // Replacement phase 
               
               
                   
                   
                 k = arg min n=1, . . ., N  w t−1,x,n   
               
               
                   
                   
                 u t,x,n  = I t,x   
               
               
                   
                   
                 σ t,x,n   2  = σ 0   2   
               
               
                   
                   
                 w t,x,n  = w 0   
               
               
                   
                   
               
             
          
           
               
                   
                 
                   
                     
                       
                         
                           
                             w 
                             
                               t 
                               , 
                               x 
                               , 
                               n 
                             
                           
                           = 
                           
                             
                               w 
                               
                                 t 
                                 , 
                                 x 
                                 , 
                                 n 
                               
                             
                              
                             
                               / 
                             
                              
                             
                               
                                 ∑ 
                                 
                                   n 
                                   = 
                                   1 
                                 
                                 N 
                               
                                
                               
                                   
                               
                                
                               
                                 w 
                                 
                                   t 
                                   , 
                                   x 
                                   , 
                                   n 
                                 
                               
                             
                           
                         
                         , 
                         
                           ∀ 
                           n 
                         
                       
                     
                   
                 
               
               
                   
                   
               
             
          
         
       
     
         [0023]    In Algorithm 1, a weight-based mulching rule 
         [0000]    
       
         
           
             
               
                 l 
                  
                 
                   ( 
                   
                     t 
                     , 
                     x 
                   
                   ) 
                 
               
               = 
               
                 
                   
                     arg 
                      
                     
                         
                     
                      
                     min 
                   
                   
                     
                       n 
                       = 
                       1 
                     
                     , 
                     
                         
                     
                      
                     … 
                      
                     
                         
                     
                     , 
                     N 
                   
                 
                  
                 
                     
                 
                  
                 
                   d 
                   
                     t 
                     , 
                     x 
                     , 
                     n 
                   
                 
               
             
             , 
             
               subject 
                
               
                   
               
                
               to 
             
           
         
       
       
         
           
             
               d 
               
                 t 
                 , 
                 x 
                 , 
                 n 
               
             
             = 
             
               { 
               
                 
                   
                     
                       - 
                       
                         w 
                         
                           
                             t 
                             - 
                             1 
                           
                           , 
                           x 
                           , 
                           n 
                         
                       
                     
                   
                   
                     
                       
                         if 
                          
                         
                             
                         
                          
                         
                            
                           
                             
                               I 
                               
                                 t 
                                 , 
                                 x 
                               
                             
                             - 
                             
                               μ 
                               
                                 
                                   t 
                                   - 
                                   1 
                                 
                                 , 
                                 x 
                                 , 
                                 n 
                               
                             
                           
                            
                         
                       
                       ≤ 
                       
                         
                           T 
                           σ 
                         
                          
                         
                           σ 
                           
                             
                               t 
                               - 
                               1 
                             
                             , 
                             x 
                             , 
                             n 
                           
                         
                       
                     
                   
                 
                 
                   
                     inf 
                   
                   
                     otherwise 
                   
                 
               
             
           
         
       
     
         [0000]    is proposed, where l(t,x) indexes the best matched Gaussian model of I t,x  and T σ  is a given threshold. This computationally efficient matching rule matches a pixel observation to the Gaussian model with the highest weight, if this observation falls in the scopes of multiple models. However, if d t,x,n =inf holds for all η s , which implies no model is matched for the pixel observation l t,x , the index will l(t,x) be rest to 0 to signify I t,x  is a brand-new observation and should be modeled by a new in Gaussian distribution. The matching results of I t,x  can be recorded by model matching indicators 
         [0000]    
       
         
           
             
               M 
               
                 t 
                 , 
                 x 
                 , 
                 n 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           1 
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 n 
                               
                               = 
                               
                                 l 
                                  
                                 
                                   ( 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                   ) 
                                 
                               
                             
                             , 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                             otherwise 
                             , 
                           
                         
                       
                     
                      
                     
                       
 
                     
                      
                     for 
                      
                     
                         
                     
                      
                     n 
                   
                   = 
                   1 
                 
                 , 
                 … 
                  
                 
                     
                 
                 , 
                 N 
               
             
           
         
       
     
         [0000]    and will be used in the later model update. 
         [0024]    After model matching, we check if M t,x,l(t,x)  is equal to 0, which implies no model matched. If so, a model replacement is performed to incorporate I t,x  into GMM; otherwise, a model update is executed. In the replacement phase, the least weighted Gaussian model is replaced by the current intensity observation. In the update phase, the two-type learning rate control scheme for updating estimates μ, σ 2  and w are applied. Note that we choose (3) as the default setting for the learning rate ρ. Regarding the computation of the learning rate η t,x , we link it to the high-level feedback of pixel types, as will be elaborated in the presentation of our surveillance system design. 
         [0000]    C. Video Surveillance System with High-Level Feedback for Learning Rate Control 
         [0025]    A block diagram of an example embodiment of the proposed, general-purposed video surveillance system  100  is illustrated in  FIG. 1 , where the processing modules are presented in a sequential manner. The image frame input  160  of the video surveillance system  100  can be generated by a digital camera or a digital image capture device. The module of background model maintenance  110  corresponds to the Algorithm 1. The second one of foreground pixel identification  120  distinguishes foreground pixels from background ones based on the computed background model. The rest three (real) modules of shadow detection  130 , object extraction  140 , and object type classification  150 , which can be enclosed by the (abstract) module of high-level information extraction  180 , further classifies foreground pixels into the types of shadow, still foreground and moving foreground, based on object-level analysis. The final output of high-level information that characterizes pixel types is fed back to the first module of background model maintenance  110  via a feedback link  170  for further control of the learning rates. 
         [0026]    In the GMM, all the scene changes, no matter foreground or background, are modeled by Gaussian distributions. To further distinguish these two classes, as what is done by the second module of foreground pixel identification  120 , a foreground indicator F t,x,n  for the nth Gaussian distribution (of the N Gaussian models) is defined using the mixture weight thresholding as 
         [0000]    
       
         
           
             
               F 
               
                 t 
                 , 
                 x 
                 , 
                 n 
               
             
             = 
             
               { 
               
                 
                   
                     0 
                   
                   
                     
                       
                         
                           if 
                            
                           
                               
                           
                            
                           
                             w 
                             
                               t 
                               , 
                               x 
                               , 
                               n 
                             
                           
                         
                         ≥ 
                         
                           T 
                           w 
                         
                       
                       , 
                     
                   
                 
                 
                   
                     1 
                   
                   
                     
                       otherwise 
                       , 
                     
                   
                 
               
             
           
         
       
     
         [0000]    where T w ε          is a preset parameter. A binary foreground map can then be defined as a set F t ={F t,x,l(t,x) |∀x}, which also acts as the output of the foreground pixel identification module  120 . Note that, comparing with C. Stauffer and W. E. L. Grimson,  Adaptive background mixture models for real - lime tracking , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Vol. 2, pp. 246-252, 1999, that sorts the N Gaussian models by the values of w/σ first and selects the background ones from a sorted model queue by thresholding the values of w/σ again, the adopted mixture weight thresholding is simpler in computation, has less complication in foreground pixel labeling, and more fits the proposed weight-based matching vile. 
         [0027]    The third module of shadow detection  130  can be realized by general shadow detection algorithms, e.g., the one used in H.-T. Chen, H.-H. Lin, and T.-L. Liu,  Multi - object Tracking Using Dynamical Graph Matching , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 210-217, 2001. The shadow detection module  130  takes the foreground map from the foreground pixel identification module  120  as its input, checks the foreground pixels, and identifies the shadow pixels among them. In the fourth module of object extraction  140 , we group the foreground pixels (excluding those of shadow type) into foreground objects by using, e.g., connected component analysis. 
         [0028]    As an example embodiment of the present invention, we demonstrate four learning rate settings for four pixel types of background, shadow, still foreground and moving foreground, respectively. Based on the proposed system design shown in  FIG. 1 , the pixel types of background, shadow and foreground can be easily discriminated. To further classify the foreground type into still and moving ones, an object tracking algorithm presented in H.-T. Chen, H.-H. Lin, and T.-L. Liu,  Multi - object Tracking Using Dynamical Graph Matching , in Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 210-217, 2001, can be adopted by the fifth module of object type classification  150  to find the temporal associations among objects of time instances t and t−1. Then, the position displacements of tracked objects are thresholded for discrimination of still and moving types. Thus, a pixel type indicator for every pixel at time instance t can be defined as 
         [0000]    
       
         
           
             
               O 
               
                 t 
                 , 
                 x 
               
             
             = 
             
               { 
               
                 
                   
                     0 
                   
                   
                     
                       
                         
                           if 
                            
                           
                               
                           
                            
                           
                             F 
                             
                               t 
                               , 
                               x 
                               , 
                               
                                 l 
                                  
                                 
                                   ( 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                         = 
                         0 
                       
                       , 
                       
                         ( 
                         Background 
                         ) 
                       
                     
                   
                 
                 
                   
                     1 
                   
                   
                     
                       
                         
                           if 
                            
                           
                               
                           
                            
                           
                             F 
                             
                               t 
                               , 
                               x 
                               , 
                               
                                 l 
                                  
                                 
                                   ( 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                         = 
                         
                           
                             1 
                              
                             
                                 
                             
                              
                             and 
                              
                             
                                 
                             
                              
                             
                               Type 
                                
                               
                                 ( 
                                 
                                   I 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                 
                                 ) 
                               
                             
                           
                           = 
                           Shadow 
                         
                       
                       , 
                     
                   
                 
                 
                   
                     2 
                   
                   
                     
                       
                         
                           if 
                            
                           
                               
                           
                            
                           
                             F 
                             
                               t 
                               , 
                               x 
                               , 
                               
                                 l 
                                  
                                 
                                   ( 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                         = 
                         
                           
                             1 
                              
                             
                                 
                             
                              
                             and 
                              
                             
                               
                                   
                               
                                
                               
                                   
                               
                             
                              
                             
                               Type 
                                
                               
                                 ( 
                                 
                                   I 
                                   
                                     t 
                                     , 
                                     x 
                                   
                                 
                                 ) 
                               
                             
                           
                           = 
                           
                             Still 
                              
                             
                                 
                             
                              
                             foreground 
                           
                         
                       
                       , 
                     
                   
                 
                 
                   
                     3 
                   
                   
                     
                       Otherwise 
                       . 
                       
                           
                       
                        
                       
                         ( 
                         
                           Moving 
                            
                           
                               
                           
                            
                           foreground 
                         
                         ) 
                       
                     
                   
                 
               
             
           
         
       
     
         [0000]    A pixel type map, being as the output of the object type classification module  150 , can then be denoted by O t ={O t,x |∀x}. 
         [0029]    Subsequently, the pixel type map O t  is sent to the background model maintenance module  110  via the feedback link  170  for the learning rate control at the next time instance. With the above notations, the learning rate η t,x  can now be specified by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       η 
                       
                         t 
                         , 
                         x 
                       
                     
                      
                     
                       ( 
                       β 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               
                                 ( 
                                 
                                   1 
                                   - 
                                   
                                     β 
                                     b 
                                   
                                 
                                 ) 
                               
                                
                               
                                 η 
                                 
                                   
                                     t 
                                     - 
                                     1 
                                   
                                   , 
                                   x 
                                 
                               
                             
                             + 
                             
                               
                                 η 
                                 b 
                               
                                
                               
                                 β 
                                 b 
                               
                             
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   O 
                                   
                                     
                                       t 
                                       - 
                                       1 
                                     
                                     , 
                                     x 
                                   
                                 
                               
                               = 
                               0 
                             
                             , 
                           
                         
                       
                       
                         
                           
                             
                               β 
                               d 
                             
                              
                             
                               N 
                                
                               
                                 ( 
                                 
                                   
                                     
                                       I 
                                       
                                         t 
                                         , 
                                         x 
                                       
                                     
                                     ; 
                                     
                                       μ 
                                       
                                         
                                           t 
                                           - 
                                           1 
                                         
                                         , 
                                         x 
                                         , 
                                         
                                           b 
                                            
                                           
                                             ( 
                                             
                                               t 
                                               , 
                                               x 
                                             
                                             ) 
                                           
                                         
                                       
                                     
                                   
                                   , 
                                   
                                     σ 
                                     
                                       
                                         t 
                                         - 
                                         1 
                                       
                                       , 
                                       x 
                                       , 
                                       
                                         b 
                                          
                                         
                                           ( 
                                           
                                             t 
                                             , 
                                             x 
                                           
                                           ) 
                                         
                                       
                                     
                                     2 
                                   
                                 
                                 ) 
                               
                             
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   O 
                                   
                                     
                                       t 
                                       - 
                                       1 
                                     
                                     , 
                                     x 
                                   
                                 
                               
                               = 
                               1 
                             
                             , 
                           
                         
                       
                       
                         
                           
                             β 
                             s 
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   O 
                                   
                                     
                                       t 
                                       - 
                                       1 
                                     
                                     , 
                                     x 
                                   
                                 
                               
                               = 
                               2 
                             
                             , 
                           
                         
                       
                       
                         
                           
                             β 
                             m 
                           
                         
                         
                           
                             
                               if 
                                
                               
                                   
                               
                                
                               
                                 O 
                                 
                                   
                                     t 
                                     - 
                                     1 
                                   
                                   , 
                                   x 
                                 
                               
                             
                             = 
                             3 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where η b  is a preset constant, the hyper-parameter β=[β b  β d  β s  β m ] T ε           4  is extended to a vector for regularizing the learning rate with respect to different pixel types, and the index of the most probable background model, b(t,x), is defined by 
         [0000]    
       
         
           
             
               b 
                
               
                 ( 
                 
                   t 
                   , 
                   x 
                 
                 ) 
               
             
             = 
             
               
                 
                   arg 
                    
                   
                       
                   
                    
                   max 
                 
                 
                   
                     n 
                     = 
                     1 
                   
                   , 
                   
                       
                   
                    
                   … 
                    
                   
                       
                   
                   , 
                   N 
                 
               
                
               
                   
               
                
               
                 w 
                 
                   t 
                   , 
                   x 
                   , 
                   n 
                 
               
             
           
         
       
     
         [0000]    Owing to that the feedback control is applied to the learning rate η t,x , but not to the mixture weights w t,x,n  directly, dramatic changes in mixture weights as pixel type varies can be avoided. Stable foreground and background separation via weight thresholding can thus be obtained. 
         [0030]    For a pixel of moving foreground (O t−1,x =3), one may set β m ≈0 to suppress the adaptation of all moving objects into background, resulting in a very sensitive system to motions. In contrast, by setting β m  to a large value, which results in a quick increase of the weight of a Gaussian model for, say, a waving tree, a system will be more capable of tolerating background variations. On the other hand, for the type of still foreground, the larger the β S  is set, the quicker a stationary object will be merged into background. For the application of abandoned and missing object detection, a small β S  is preferred. Regarding the case of shadow type, we favor faster adaptation of fainter shadows into background, so N(•) is used to estimate the similarity between the shadow intensity and the Gaussian model of the most probable background (indexed by b t,x ). The corresponding learning rate is then set to the similarity measure multiplied by a regularization scalar β d . 
         [0031]    For a pixel of background type, i.e., O t−1,x =0, its learning rate is designed to be gradually increased at a rate regularized by β b , as formulated in (5). The learning rate for an image pixel being persistently identified as background will asymptotically approach η b , as shown in  FIG. 2 . However, once this pixel position being occluded by shadows or moving objects, the respective learning rate will be reset to other value, e.g., β m , that is much smaller than it was used to be. This design helps preventing false inclusion of afterimages left by moving objects into background. When taking pictures of moving objects, their boundaries are often in blur. Some motion-blurred regions near object boundaries may be misclassified as background, resulting in afterimages. For an object hovering over a region, its afterimages appear frequently and will be quickly included into a background model. To alleviate such a problem, instead of setting the learning rate to a constant, i.e., 
         [0000]      η t,x =η n , if  O   t−1,x =0,  (6)
 
         [0000]    it is increased gradually for a pixel of background in the proposed approach. 
         [0032]    In our experiments, we set η b =α, β b =0.01, β d = 1/100, β S = 1/900 and β m = 1/6000 as default values. Further, α=0.025 is chosen for the adaptation of quick lighting changes for general surveillance conditions. To visualize the derived background models, a definition of background map β t ={μ t,x,b(t,x) |∀x} is employed in resulting figures of experiments. 
         [0033]    As shown in  FIG. 3(A) , a cellular phone on a desk is taken away. Usually, a missing personal property should be marked as foreground and trigger an alarm. However, such an abnormal event can not be stably detected, as shown in  FIG. 3(B) , by using the method of D.-S. Lee,  Effective Gaussian Mixture Learning for Video Background Subtraction , IEEE Trans. Pattern Anal. Mach. Intell., Vol. 27, No. 5, pp. 827-832, 2005, with α=0.025, due to the high learning rate setting. With α=0.025 for the compared approach, quick lighting changes of a scene as well as uncovered regions from missing objects will be quickly adapted into a background model, which leaves no reliable evidence for the detection of missing object. Similarly, hand waving in front of the camera is soon adapted into background as well, as shown in  FIG. 3(C) , causing the hand regions only partially detected. In contrast, these scenarios of quick lighting change, missing object, and periodic motion, can be properly handled by the proposed approach with the same parameter setting (α=0.025), as shown in FIGS.  3 (D)-(F). Thanks to the feedback control of the learning rate η, these scenarios can all be modeled decently in an unified framework. 
         [0034]    To sum up, the invented learning rate control scheme for the GMM roots in the high level feedback of pixel types identified by the proposed, general-purposed video surveillance system. Although, in the example embodiment, only a limited amount of pixel types are introduced in the learning rate control scheme, noticeable improvements in foreground detection over general GMM approaches are already observable. Owing to the scalability of the video surveillance system with a two-type learning rate control scheme, more complex scenarios may be handled with more high-level information incorporated. For example, region-level classification results of skin/non-skin, face/non-face and human/non-human can be fed into the learning rate control of η in the proposed system design to increase model sensitivity to these objects. Moreover, users can assign pixel types of particular image locations, in real-time and/or prior to system processing, to increase their background adaptation rates to waving trees or to enhance foreground detection sensitivity of forbidden zones. 
         [0035]    It will be apparent to those skilled in the art that various modifications and variations can be made to the structure of the present invention without departing from the scope or spirit of the invention. In view of the foregoing, it is intended that the present invention cover modifications and variations of this invention provided they fall within the scope of the following claims.