Future-data driven modeling of complex backgrounds using mixture of Gaussians

نویسندگان

  • Xin Liu
  • Chun Qi
چکیده

Mixture of Gaussians (MoG) is well-known for effectively in sustaining background variations, which has been widely adopted for background subtraction. However, in complex backgrounds, MoG often traps in keeping balance between model convergence speed and its stability. The main difficulty is the selection of learning rates. In this paper, an effective learning strategy is proposed to provide better regularization then a set of background distributions (MoG) is computed for each case. To distinguish between dynamic and static background, the equality of these two sets is tested by the hypothesis testing method. Next, a two-layer LBP-based method is proposed for foreground classification. Finally, the global and static learning rates are replaced by the adaptive learning rates for image pixels with distinct properties for each frame. By means of the proposed learning strategy, a novel background modeling for detecting foreground objects from complex environments is established. We compare our procedure against the state-of-the-art alternatives, the experimental results show that the performance of learning speed and accuracy obtained by proposed learning rate control strategy is better than existing MoG approaches. & 2013 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Re-Evaluation of Mixture-of-Gaussian Background Modeling

Mixture of Gaussians (MOG) has been widely used for robustly modeling complicated backgrounds, especially those with small repetitive movements (such as leaves, bushes, rotating fan, ocean waves, rain). The performance of MOG can be greatly improved by tackling several practical issues. In this paper, we quantitatively evaluate (using the Wallflower benchmarks) the performance of the MOG. with ...

متن کامل

Speech modeling using variational Bayesian mixture of Gaussians

The topic of this paper is speech modeling using the Variational Bayesian Mixture of Gaussians algorithm proposed by Hagai Attias (2000). Several mixtures of Gaussians were trained for representing cepstrum vectors computed from the TIMIT database. The VB-MOG algorithm was compared to the standard EM algorithm. VB-MOG was clearly better, its convergence was faster, there was no tendency to over...

متن کامل

Time Driven Activity Based Costing : Theory,Applications and Limitations

The aim of this study is to explore the strategic applications and limitations of Time-driven Activity-based Costing (TDABC) and to evaluate the degree of accuracy of the proponents’ arguments concerning its usefulness. In this study, published works directly related to this area from the period 2004-2015 are analyzed. This study reports TDABC's applications in strategic areas such as cost of p...

متن کامل

Speech Modeling Using Variational Baye

The topic of this paper is speech modeling using the Variational Bayesian Mixture of Gaussians algorithm proposed by Hagai Attias (2000). Several mixtures of Gaussians were trained for representing cepstrum vectors computed from the TIMIT database. The VB-MOG algorithm was compared to the standard EM algorithm. VB-MOG was clearly better, its convergence was faster, there was no tendency to over...

متن کامل

IMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 119  شماره 

صفحات  -

تاریخ انتشار 2013