Abstract

Low-rank and sparse decomposition (LRSD) poses a big challenge problem in video foreground-background separation and many other fields due to its difficulties in approximations of low-rank and sparse parts. The rank and sparsity may not be well approximated in practice since these conventional approaches suffer from the suboptimal issues in many cases. In this paper, we adopt the generalized nuclear norm (GNN) and the Laplacian scale mixture (LSM) modeling to approximate the low-rank and sparse matrices, respectively, and propose a generalized formulation which called GNNLSM for nonconvex low-rank and sparse decomposition based on the GNN and the LSM. And then, we adopt the alternating direction method of multipliers (ADMM) to solve our proposed problem. Simulation results and discussions on video foreground-background separation are given to validate the superiority and the effectiveness of our proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.