Hierarchical Data Structure for Real-Time Background Subtraction

This paper seeks to increase the efficiency of background subtraction algorithms for motion detection. Our method uses a quadtree-base hierarchical framework that samples a small portion of the pixels in each image and yet produces motion detection results that are very similar compared to the conventional methods that raster scan entire images. The hierarchical data structure presented in this paper can be used with any background subtraction algorithm that employs background modeling and motion detection on a per-pixel basis. We have tested our method using two common background subtraction algorithms: Running Average and Mixture of Gaussian. Our experimental results show that the application of the hierarchical data structure significantly increases the processing speed for accurate motion detection. For example, the Mixture of Gaussian method with our hierarchical data structure is able to process 1600 by 1200 images at 11~12 frames per second compared to 2~3 frames per second wit...

• Type: Conference
• Year: 2006
• Where: ICIP
• Authors: Johnny Park, Amy Tabb, Avinash C. Kak
• Keywords: Accurate Motion Detection, Background Subtraction Algorithms, Common Background Subtraction, Hierarchical Data Structure, ICIP 2006, Image Processing, Motion Detection