TY - GEN
T1 - Improving OR-PCA via smoothed spatially-consistent low-rank modeling for background subtraction
AU - Javed, Sajid
AU - Bouwmans, Thierry
AU - Jung, Soon Ki
N1 - Publisher Copyright:
Copyright 2017 ACM.
PY - 2017/4/3
Y1 - 2017/4/3
N2 - Background subtraction is a powerful mechanism for moving object detection. In addition to the most popular dynamic background scenes and abrupt lighting condition limitations for designing robust background subtraction mechanism, jitter-induced motion also poses a great challenge. In this case background subtraction becomes more challenging. Although, robust principal component analysis (RPCA) provides a potential solution for moving object detection but many existing RPCA methods for background subtraction still produce abundant false positives in the presence of these challenges. In this paper, we propose background subtraction algorithm based on continuous learning of low-rank matrix using image pixels represented on a Minimum Spanning Tree (MST). First, efficient MST is constructed to estimate minimax path among the spatial pixels of input image. Then, robust smoothing constraint is employed on these pixels for outlier removal. The low-rank matrix is updated using MST-based observed pixels. Finally, we apply the markov random field (MRF) to label the absolute value of the sparse error. Our experiments show that the proposed algorithm achieves promising results on dynamic background and camera jitter sequences compared to state-of-the-art methods.
AB - Background subtraction is a powerful mechanism for moving object detection. In addition to the most popular dynamic background scenes and abrupt lighting condition limitations for designing robust background subtraction mechanism, jitter-induced motion also poses a great challenge. In this case background subtraction becomes more challenging. Although, robust principal component analysis (RPCA) provides a potential solution for moving object detection but many existing RPCA methods for background subtraction still produce abundant false positives in the presence of these challenges. In this paper, we propose background subtraction algorithm based on continuous learning of low-rank matrix using image pixels represented on a Minimum Spanning Tree (MST). First, efficient MST is constructed to estimate minimax path among the spatial pixels of input image. Then, robust smoothing constraint is employed on these pixels for outlier removal. The low-rank matrix is updated using MST-based observed pixels. Finally, we apply the markov random field (MRF) to label the absolute value of the sparse error. Our experiments show that the proposed algorithm achieves promising results on dynamic background and camera jitter sequences compared to state-of-the-art methods.
KW - Background subtraction
KW - Markov random field
KW - Minimum Spanning Tree
KW - Robust principal component analysis
UR - http://www.scopus.com/inward/record.url?scp=85020866162&partnerID=8YFLogxK
U2 - 10.1145/3019612.3019637
DO - 10.1145/3019612.3019637
M3 - Conference contribution
AN - SCOPUS:85020866162
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 89
EP - 94
BT - 32nd Annual ACM Symposium on Applied Computing, SAC 2017
PB - Association for Computing Machinery
T2 - 32nd Annual ACM Symposium on Applied Computing, SAC 2017
Y2 - 4 April 2017 through 6 April 2017
ER -