Generalized Singular Value Thresholding Operator Based Nonconvex Low-Rank and Sparse Decomposition for Moving Object Detection

Moving object detection is one of the most challenging tasks in computer vision and many other fields, which is the basis for high-level processing. Low-rank and sparse decomposition (LRSD) is widely used in moving object detection. The existing methods primarily address the LRSD problem by exploiting the approximation of rank functions and sparse constraints. Conventional methods usually consider the nuclear norm as the approximation of the low-rank matrix. However, the actual results show that the nuclear norm is not the best approximation of the rank function since it simultaneously minimize all the singular values. In this paper, we exploit a novel nonconvex surrogate function to approximate the low-rank matrix and propose a generalized formulation for nonconvex low-rank and sparse decomposition based on the generalized singular value thresholding (GSVT) operator. And then, we solve the proposed nonconvex problem via the alternating direction method of multipliers (ADMM), and also analyze its convergence. Finally, we give numerical results to validate the proposed algorithm on both synthetic data and real-life image data. The results demonstrate that our model has superior performance. And we use the proposed nonconvex model for moving objects detection, and provide the experimental results. The results show that the proposed method is more effective than representative LRSD based moving objects detection algorithms.