arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.07962math.OCcs.CVcs.NAmath.NA
收藏

鲁棒PCA的非凸Projection Method

A Nonconvex Projection Method for Robust PCA

King Abdullah University of Science and Technology (KAUST)(沙特阿拉伯国王阿卜杜拉科技大学(KAUST));School of Mathematics, University of Edinburgh(爱丁堡大学数学学院);Moscow Institute of Physics and Technology(莫斯科物理技术学院)

Aritra Dutta, Filip Hanzely, Peter Richtárik

摘要:

鲁棒主成分分析(RPCA)是一个研究得很好的问题,其目标是将矩阵分解为低秩和稀疏分量之和。本文提出了RPCA问题的一种非凸可行性重构方法,并应用交替投影法求解,首次提出了一种不考虑任何目标函数、凸松弛或代理凸约束的RPCA问题求解方法。我们通过对各种应用程序(包括阴影消除,背景估计,人脸检测和星系演化)进行广泛的数值实验证明,我们的方法在各种方面与当前最先进的方法相匹配,并且通常显着优于当前最先进的方法。

英文摘要:

Robust principal component analysis (RPCA) is a well-studied problem with the goal of decomposing a matrix into the sum of low-rank and sparse components. In this paper, we propose a nonconvex feasibility reformulation of RPCA problem and apply an alternating projection method to solve it. To the best of our knowledge, we are the first to propose a method that solves RPCA problem without considering any objective function, convex relaxation, or surrogate convex constraints. We demonstrate through extensive numerical experiments on a variety of applications, including shadow removal, background estimation, face detection, and galaxy evolution, that our approach matches and often significantly outperforms current state-of-the-art in various ways.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑