Rejection-Cascade of Gaussians: Real-Time Adaptive Background Subtraction Framework

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Background-Foreground classification is a well-studied problem in computer vision. Due to the pixel-wise nature of modeling and processing in the algorithm, it is usually difficult to satisfy real-time constraints. There is a trade-off between the speed (because of model complexity) and accuracy. Inspired by the rejection cascade of Viola-Jones classifier, we decompose the Gaussian Mixture Model (GMM) into an adaptive cascade of Gaussians (CoG). We achieve a good improvement in speed without compromising the accuracy with respect to the baseline GMM model. We demonstrate a speed-up factor of 4–5 and 17% average improvement in accuracy over Wallflowers surveillance datasets. The CoG is then demonstrated to over the latent space representation of images of a convolutional variational autoencoder (VAE). We provide initial results over CDW-2014 dataset, which could speed up background subtraction for deep architectures.

Cite

CITATION STYLE

APA

Kiran, B. R., Das, A., & Yogamani, S. (2020). Rejection-Cascade of Gaussians: Real-Time Adaptive Background Subtraction Framework. In Communications in Computer and Information Science (Vol. 1249, pp. 272–281). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-15-8697-2_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free