Deep unfolded neural networks are designed by unrolling the iterations of optimization algorithms. They can be shown to achieve faster convergence and higher accuracy than their optimization counterparts. This paper proposes a new deep-unfolding-based network design for the problem of Robust Principal Component Analysis (RPCA) with application to video foreground-background separation. Unlike existing designs, our approach focuses on modeling the temporal correlation between the sparse representations of consecutive video frames. To this end, we perform the unfolding of an iterative algorithm for solving reweighted ℓ1-ℓ1 minimization; this unfolding leads to a different proximal operator (a.k.a. different activation function) adaptively learned per neuron. Experimentation using the moving MNIST dataset shows that the proposed network outperforms a recently proposed state-of-the-art RPCA network in the task of video foreground-background separation.
@article{arxiv.2010.00929,
title = {A Deep-Unfolded Reference-Based RPCA Network For Video Foreground-Background Separation},
author = {Huynh Van Luong and Boris Joukovsky and Yonina C. Eldar and Nikos Deligiannis},
journal= {arXiv preprint arXiv:2010.00929},
year = {2020}
}