Name
Abstract | ||
|---|---|---|
Due to the variety of background model in the real world, detecting changes in a video cannot be addressed exhaustively by a simple background subtraction method, especially with several motion detection challenges, such as dynamic background, camera jitter, intermittent object motion, and so on. In this paper, we propose an efficient background subtraction method, namely locally statistical dual-mode (LSD), for detecting moving objects in video-based surveillance systems. The method includes a local intensity pattern comparison algorithm for foreground segmentation by analyzing the homogeneity of intensity patterns of the input frame and the background model, in which the homogeneity is calculated by the mean and standard deviation of pixel intensity. Besides that, a dual-mode scheme is developed to temporally update the background model for the short- and long-term scenarios corresponding to sudden and gradual changes in the background. The advantage of this scheme is the allowance of updating the model in both pixel- and frame-wise manners simultaneously. The parameters used in both the local intensity pattern comparison algorithm and the dual-mode background model updating scheme are estimated for every input frame consecutively based on local and global statistical information of segmentation result. In experiments, the proposed LSD method is extensively evaluated on the Wallflower and CDnet2014 datasets; and remarkable performance demonstrates its preeminence to the many state-of-the-art background subtraction approaches in terms of segmentation accuracy and computational complexity. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ACCESS.2019.2891084 | IEEE ACCESS |
Keywords | Field | DocType |
Motion detection,background subtraction,background modeling,moving object detection,video segmentation,locally statistical dual-mode updating | Background subtraction,Computer vision,Wallflower,Motion detection,Computer science,Segmentation,Artificial intelligence,Pixel,Jitter,Standard deviation,Distributed computing,Computational complexity theory | Journal |
Volume | ISSN | Citations |
7 | 2169-3536 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thien Huynh-The | 1 | 94 | 21.54 |
| Cam-Hao Hua | 2 | 45 | 11.22 |
| Nguyen Anh Tu | 3 | 30 | 7.90 |
| Dong-Seong Kim | 4 | 64 | 28.80 |