Online Robust Principal Component Analysis with Change Point Detection
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
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 2; 2025: 0; 2026: 2.
5 papers.
- 2021A Distance-based Anomaly Detection Framework for Deep Reinforcement Learningcited by 5
- 2024Tuning-Free Online Robust Principal Component Analysis through Implicit Regularizationcited by 0
- 2024Real-time Fuel Leakage Detection via Online Change Point Detectioncited by 0
- 2026Heavy-Tailed Principal Component Analysiscited by 0
- 2026AIGS: Adaptive Incremental Gating System for Online Representation Learning in Non-Stationary Data Streamscited by 0
- 2026AIGS: Adaptive Incremental Gating System for Online Representation Learning in Non-Stationary Data Streams2 Oct 2026
- 2026Heavy-Tailed Principal Component Analysis11 Mar 2026
- 2024Real-time Fuel Leakage Detection via Online Change Point Detection13 Oct 2024
- 2024Tuning-Free Online Robust Principal Component Analysis through Implicit Regularization11 Sep 2024
- 2021A Distance-based Anomaly Detection Framework for Deep Reinforcement Learning21 Sep 2021