A Novel Robust Principal Component Analysis Algorithm of Nonconvex Rank Approximation

الملخص EN

Noise exhibits low rank or no sparsity in the low-rank matrix recovery, and the nuclear norm is not an accurate rank approximation of low-rank matrix.

In the present study, to solve the mentioned problem, a novel nonconvex approximation function of the low-rank matrix was proposed.

Subsequently, based on the nonconvex rank approximation function, a novel model of robust principal component analysis was proposed.

Such model was solved with the alternating direction method, and its convergence was verified theoretically.

Subsequently, the background separation experiments were performed on the Wallflower and SBMnet datasets.

Furthermore, the effectiveness of the novel model was verified by numerical experiments.