Improved Foreground Detection via Block-based Classifier Cascade with Probabilistic Decision Integration
Vikas Reddy, Conrad Sanderson, Brian C. Lovell

TL;DR
This paper introduces a block-based foreground detection method that improves accuracy and robustness by integrating contextual information through a classifier cascade and probabilistic decision fusion, enhancing tracking performance.
Contribution
It presents a novel block-based approach with a classifier cascade and probabilistic decision integration that outperforms pixel-based methods without needing post-processing.
Findings
Better qualitative and quantitative results on Wallflower and I2R datasets.
Significant improvements in tracking accuracy on CAVIAR dataset.
No ad-hoc post-processing required for foreground masks.
Abstract
Background subtraction is a fundamental low-level processing task in numerous computer vision applications. The vast majority of algorithms process images on a pixel-by-pixel basis, where an independent decision is made for each pixel. A general limitation of such processing is that rich contextual information is not taken into account. We propose a block-based method capable of dealing with noise, illumination variations and dynamic backgrounds, while still obtaining smooth contours of foreground objects. Specifically, image sequences are analysed on an overlapping block-by-block basis. A low-dimensional texture descriptor obtained from each block is passed through an adaptive classifier cascade, where each stage handles a distinct problem. A probabilistic foreground mask generation approach then exploits block overlaps to integrate interim block-level decisions into final pixel-level…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
