Online robust principal component analysis via truncated nuclear norm regularization

Robust principal component analysis (RPCA) has been widely used to deal with high dimensional noisy data in many applications. Traditional RPCA approaches consider all the samples to recover the low dimensional subspace in a batch manner, which incur expensive storage cost and fail to update the low dimensional subspace efficiently for stream data. Thus it is urgent to develop online RPCA methods. In this paper, we propose a novel online RPCA algorithm by adopting a recently proposed truncated nuclear norm as a tighter approximation of low rank constraint. Then we decompose the objective function as a summation of sample-wise cost. And we design an efficient alternating optimization algorithm in an online manner. Experimental results show that our proposed method can achieve more accurate low dimensional subspace estimation performance compared with state-of-the-art online RPCA algorithms.