Visual Processing by a Unified Schatten-$p$ Norm and $\ell_q$ Norm Regularized Principal Component Pursuit
Jing Wang, Meng Wang, Xuegang Hu, Shuicheng Yan

TL;DR
This paper introduces a non-convex approach using Schatten-$p$ and $\,q$-norms for robust principal component analysis, offering tighter approximations and improved recovery of low-rank structures from corrupted data.
Contribution
It proposes a novel non-convex formulation with Schatten-$p$ and $\,q$-norms and develops a proximal iteratively reweighted algorithm with convergence guarantees.
Findings
Tighter approximation to the rank and sparsity functions.
Algorithm converges and outperforms convex counterparts.
Experimental results show improved recovery on benchmark datasets.
Abstract
In this paper, we propose a non-convex formulation to recover the authentic structure from the corrupted real data. Typically, the specific structure is assumed to be low rank, which holds for a wide range of data, such as images and videos. Meanwhile, the corruption is assumed to be sparse. In the literature, such a problem is known as Robust Principal Component Analysis (RPCA), which usually recovers the low rank structure by approximating the rank function with a nuclear norm and penalizing the error by an -norm. Although RPCA is a convex formulation and can be solved effectively, the introduced norms are not tight approximations, which may cause the solution to deviate from the authentic one. Therefore, we consider here a non-convex relaxation, consisting of a Schatten- norm and an -norm that promote low rank and sparsity respectively. We derive a proximal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
