Robust Online Matrix Factorization for Dynamic Background Subtraction
We propose an effective online background subtraction method, which can be robustly applied to practical videos that have variations in both foreground and background. Different from previous methods which often model the foreground as Gaussian or Laplacian distributions, we model the foreground for each frame with a specific mixture of Gaussians (MoG) distribution, which is updated online frame by frame. Particularly, our MoG model in each frame is regularized by the learned foreground/background knowledge in previous frames. This makes our online MoG model highly robust, stable and adaptive to practical foreground and background variations. The proposed model can be formulated as a concise probabilistic MAP model, which can be readily solved by EM algorithm. We further embed an affine transformation operator into the proposed model, which can be automatically adjusted to fit a wide range of video background transformations and make the method more robust to camera movements. With using the sub-sampling technique, the proposed method can be accelerated to execute more than 250 frames per second on average, meeting the requirement of real-time background subtraction for practical video processing tasks. The superiority of the proposed method is substantiated by extensive experiments implemented on synthetic and real videos, as compared with state-of-the-art online and offline background subtraction methods.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction
Background subtraction refers to extracting the foreground from an observed video, and is the fundamental problem of various applications. There are two kinds of popular methods to deal with background separation, namely…
Low-Rank Matrix CompletionMatrix CompletionMatrix Factorization / DecompositionVideo Background SubtractionBackground Subtraction via Fast Robust Matrix Completion
Background subtraction is the primary task of the majority of video inspection systems. The most important part of the background subtraction which is common among different algorithms is background modeling. In this reg…
Low-Rank Matrix CompletionMatrix CompletionRandomized Low-Rank Dynamic Mode Decomposition for Motion Detection
This paper introduces a fast algorithm for randomized computation of a low-rank Dynamic Mode Decomposition (DMD) of a matrix. Here we consider this matrix to represent the development of a spatial grid through time e.g. …
Motion DetectionAdaptive-Rate Sparse Signal Reconstruction With Application in Compressive Background Subtraction
We propose and analyze an online algorithm for reconstructing a sequence of signals from a limited number of linear measurements. The signals are assumed sparse, with unknown support, and evolve over time according to a …
Video Background SubtractionComplex Background Subtraction by Pursuing Dynamic Spatio-Temporal Models
Although it has been widely discussed in video surveillance, background subtraction is still an open problem in the context of complex scenarios, e.g., dynamic backgrounds, illumination variations, and indistinct foregro…