Background Subtraction (BS) is one of the key steps in video analysis. Many
background models have been proposed and achieved promising performance on
public data sets. However, due to challenges such as illumination change,
dynamic background etc. the resulted foreground segmentation often consists of
holes as well as background noise. In this regard, we consider generalized
fused lasso regularization to quest for intact structured foregrounds. Together
with certain assumptions about the background, such as the low-rank assumption
or the sparse-composition assumption (depending on whether pure background
frames are provided), we formulate BS as a matrix decomposition problem using
regularization terms for both the foreground and background matrices. Moreover,
under the proposed formulation, the two generally distinctive background
assumptions can be solved in a unified manner. The optimization was carried out
via applying the augmented Lagrange multiplier (ALM) method in such a way that
a fast parametric-flow algorithm is used for updating the foreground matrix.
Experimental results on several popular BS data sets demonstrate the advantage
of the proposed model compared to state-of-the-arts