23S rRNA (guanine2535-N1)-methyltransferase

Background subtraction, also known as Foreground Detection, is a technique in the fields of image processing and computer vision wherein an image's foreground is extracted for further processing (object recognition etc.). Generally an image's regions of interest are objects (humans, cars, text etc.) in its foreground. After the stage of image preprocessing (which may include image denoising etc.) object localisation is required which may make use of this technique. Background subtraction is a widely used approach for detecting moving objects in videos from static cameras. The rationale in the approach is that of detecting the moving objects from the difference between the current frame and a reference frame, often called “background image”, or “background model”. Background subtraction is mostly done if the image in question is a part of a video stream.

Approaches

A robust background subtraction algorithm should be able to handle lighting changes, repetitive motions from clutter and long-term scene changes. The following analyses make use of the function of V(x,y,t) as a video sequence where t is the time dimension, x and y are the pixel location variables. e.g. V(1,2,3) is the pixel intensity at (1,2) pixel location of the image at t = 3 in the video sequence.

Using frame differencing

Frame difference (absolute) at time t + 1 is

$D(t+1)=|V(x,y,t+1)-V(x,y,t)|$

The background is assumed to be the frame at time t. This difference image would only show some intensity for the pixel locations which have changed in the two frames. Though we have seemingly removed the background, this approach will only work for cases where all foreground pixels are moving and all background pixels are static.

A threshold "Th" is put on this difference image to improve the subtraction (see Image thresholding).

$|V(x,y,t)-V(x,y,t+1)|>\mathrm{T}\mathrm{h}$

(this means that the difference image's pixels' intensities are 'thresholded' or filtered on the basis of value of Th)

The accuracy of this approach is dependent on speed of movement in the scene. Faster movements may require higher thresholds.

Mean filter

For calculating the image containing only the background, a series of preceding images are averaged. For calculating the background image at the instant t,

$B(x,y)=\frac{1}{N}\sum _{i=1}^{N}V(x,y,t-i)$

where N is the number of preceding images taken for averaging. This averaging refers to averaging corresponding pixels in the given images. N would depend on the video speed (number of images per second in the video) and the amount of movement in the video. After calculating the background B(x,y) we can then subtract it from the image V(x,y,t) at time t=t and threshold it. Thus the foreground is

$|V(x,y,t)-B(x,y)|>\mathrm{T}\mathrm{h}$

where Th is threshold. Similarly we can also use median instead of mean in the above calculation of B(x,y).

Usage of global and time-independent Thresholds (same Th value for all pixels in the image) may limit the accuracy of the above two approaches.

Running Gaussian average

For this method, Wren et al. propose fitting a Gaussian probabilistic density function (pdf) on the most recent $n$ frames. In order to avoid fitting the pdf from scratch at each new frame time $t$, a running (or on-line cumulative) average is computed.

The pdf of every pixel is characterized by mean ${\mu }_t$ and variance ${\sigma }_t^2$ . The following is a possible initial condition (assuming that initially every pixel is background):

${\mu }_0=I_0$

${\sigma }_0^2=<$ some default value $>$

where $I_t$ is the value of the pixel's intensity at time $t$. In order to initialize variance, we can, for example, use the variance in x and y from a small window around each pixel.

Note that background may change over time (e.g. due to illumination changes or non-static background objects). To accommodate for that change, at every frame $t$, every pixel's mean and variance must be updated, as follows:

${\mu }_t=\rho I_t+(1-\rho ){\mu }_{t-1}$

${\sigma }_t^2=d^2\rho +(1-\rho ){\sigma }_{t-1}^2$

$d=|(I_t-{\mu }_t)|$

Where $\rho$ determines the size of the temporal window that is used to fit the pdf (usually $\rho =0.01$ ) and $d$ is the Euclidean distance between the mean and the value of the pixel.

Gaussian distribution for each pixel.

We can now classify a pixel as background if its current intensity lies within some confidence interval of it's distribution's mean:

$\frac{|(I_t-{\mu }_t)|}{{\sigma }_t}>k⟶\mathit{F}\mathit{o}\mathit{r}\mathit{e}\mathit{g}\mathit{r}\mathit{o}\mathit{u}\mathit{n}\mathit{d}$

$\frac{|(I_t-{\mu }_t)|}{{\sigma }_t}\le k⟶\mathit{B}\mathit{a}\mathit{c}\mathit{k}\mathit{g}\mathit{r}\mathit{o}\mathit{u}\mathit{n}\mathit{d}$

where the parameter $k$ is a free threshold (usually $k=2.5$ ). A larger value for $k$ allows for more dynamic background, while a smaller $k$ increases the probability of a transition from background to foreground due to more subtle changes.

In a variant of the method, a pixel's distribution is only updated if it is classified as background. This is to prevent newly introduced foreground objects from fading into the background. The update formula for the mean is changed accordingly:

${\mu }_t=M{\mu }_{t-1}+(1-M)(I_t\rho +(1-\rho ){\mu }_{t-1})$

where $M=1$ when $I_t$ is considered foreground and $M=0$ otherwise. So when $M=1$ , that is, when the pixel is detected as foreground, the mean will stay the same. As a result, a pixel, once it has become foreground, can only become background again when the intensity value gets close to what it was before turning foreground. This method, however, has several issues: It only works if all pixels are initially background pixels (or foreground pixels are annotated as such). Also, it cannot cope with gradual background changes: If a pixel is categorized as foreground for a too long period of time, the background intensity in that location might have changed (because illumination has changed etc.). As a result, once the foreground object is gone, the new background intensity might not be recognized as such anymore.

Background mixture models

In this technique, it is assumed that every pixel's intensity values in the video can be modeled using a Gaussian mixture model. A simple heuristic determines which intensities are most probably of the background. Then the pixels which do not match to these are called the foreground pixels. Foreground pixels are grouped using 2D connected component analysis.

At any time t, a particular pixel ($x_0,y_0$)'s history is

$X_1,\dots ,X_t=\{V(x_0,y_0,i):1⩽i⩽t\}$

This history is modeled by a mixture of K Gaussian distributions:

$P(X_t)=\sum _{i=1}^K{\omega }_{i,t}N(X_t\mid {\mu }_{i,t},{\mathrm{\Sigma }}_{i,t})$

where

$N(X_t\mid {\mu }_{it},{\mathrm{\Sigma }}_{i,t})=\frac{1}{(2\pi {)}^{D/2}}\frac{1}{|{\mathrm{\Sigma }}_{i,t}{|}^{1/2}}\exp (-\frac{1}{2}(X_t-{\mu }_{i,t}{)}^T{\mathrm{\Sigma }}_{i,t}^{-1}(X_t-{\mu }_{i,t}))$

An on-line K-means approximation is used to update the Gaussians. Numerous improvements of this original method developed by Stauffer and Grimson have been proposed and a complete survey can be found in Bouwmans et al.

Surveys

Several surveys which concern categories or sub-categories of models can be found as follows:

• MOG Background Subtraction

• Subspace Learning Background Subtraction

• Statistical Background Subtraction

• Fuzzy Background Subtraction

• RPCA Background Subtraction

• Traditional and Recent Approaches for Background Subtraction

Resources, Datasets and Codes

Book

T. Bouwmans, F. Porikli, B. Horferlin, A. Vacavant, Handbook on "Background Modeling and Foreground Detection for Video Surveillance: Traditional and Recent Approaches, Implementations, Benchmarking and Evaluation", CRC Press, Taylor and Francis Group, June 2014. (For more information: http://www.crcpress.com/product/isbn/9781482205374)

Special Issue

T. Bouwmans, L. Davis, J. Gonzalez, M. Piccardi, C. Shan, Special Issue on “Background Modeling for Foreground Detection in Real-World Dynamic Scenes”, Special Issue in Machine Vision and Applications, July 2014.

BGS Web Site

The Background Subtraction Web Site (T. Bouwmans, Univ. La Rochelle, France) contains a full list of the references in the field, links to available datasets and codes. (For more information: http://sites.google.com/site/backgroundsubtraction/Home)

BGS Datasets

• ChangeDetection.net (For more information: http://www.changedetection.net/)
• Background Models Challenge (For more information: http://bmc.univ-bpclermont.fr/)
• Stuttgart Artificial Background Subtraction Dataset (For more information: http://www.vis.uni-stuttgart.de/index.php?id=sabs)

BGS Library

The BGS Library (A. Sobral) provides a C++ framework to perform background subtraction algorithms. The code works either on Windows or on Linux. Currently the library offers 29 BGS algorithms. (For more information: http://code.google.com/p/bgslibrary/)

Applications

• Video Surveillance
• Optical Motion Capture
• Human Computer Interaction
• Content based Video Coding

See also

• ViBe
• PBAS
• SOBS

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

• Template:Cite pmid