mlsanityData to 14 Oct 2026

Online Robust Principal Component Analysis with Change Point Detection

arXiv 1702.05698 ↗First posted 19 Feb 2017cs.LG cs.CV stat.APcited by 5

Not on the map. Why?

Abstract (arXiv)

Robust PCA methods are typically batch algorithms which requires loading all observations into memory before processing. This makes them inefficient to process big data. In this paper, we develop an efficient online robust principal component methods, namely online moving window robust principal component analysis (OMWRPCA). Unlike existing algorithms, OMWRPCA can successfully track not only slowly changing subspace but also abruptly changed subspace. By embedding hypothesis testing into the algorithm, OMWRPCA can detect change points of the underlying subspaces. Extensive simulation studies demonstrate the superior performance of OMWRPCA compared with other state-of-art approaches. We also apply the algorithm for real-time background subtraction of surveillance video.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 2; 2025: 0; 2026: 2.

5 papers.