A New Sparse Low-rank Matrix Decomposition Method and its Application on Train Passenger Abnormal Action Identification

In the article a new sparse low-rank matrix decomposition model is proposed based on the smoothly clipped absolute deviation (SCAD) penalty. In order to overcome the computational hurdle we generalize the alternating direction method of multipliers (ADMM) algorithm to develop an alternative algorithm to solve the model. The algorithm we designed alternatively renew the sparse matrix and low-rank matrix in terms of the closed form of SCAD penalty. Thus, the algorithm reduces the computational complexity while at the same time to keep the computational accuracy. A series of simulations have been designed to demonstrate the performances of the algorithm with comparing with the Augmented Lagrange Multiplier (ALM) algorithm. Ultimately, we apply the model to an onboard video background modeling problem. According to model the on-board video background, we can separate the video background and passenger’s actions. Thus, the model can help us to identify the abnormal action of train passengers. The experiments show the background matrix we estimated is not only sparser, but the computational efficiency is also improved.

[1]  Jianqing Fan,et al.  Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties , 2001 .

[2]  Jianqing Fan,et al.  Regularization of Wavelet Approximations , 2001 .

[3]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[4]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[5]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[6]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[7]  Arvind Ganesh,et al.  Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .

[8]  Hongkai Zhao,et al.  Robust principle component analysis based four-dimensional computed tomography , 2010 .

[9]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[10]  Xiaodong Li,et al.  Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.

[11]  Gongguo Tang,et al.  Robust principal component analysis based on low-rank and block-sparse matrix decomposition , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[12]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[13]  Pablo A. Parrilo,et al.  Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[14]  James Theiler,et al.  Local principal component pursuit for nonlinear datasets , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[15]  Thierry Bouwmans,et al.  Robust PCA via Principal Component Pursuit: A review for a comparative evaluation in video surveillance , 2014, Comput. Vis. Image Underst..

[16]  Soon Ki Jung,et al.  OR-PCA with MRF for Robust Foreground Detection in Highly Dynamic Backgrounds , 2014, ACCV.