Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifold
Not on the map. Why?
Abstract (arXiv)
It is well known that Principal Component Analysis (PCA) is strongly affected by outliers and a lot of effort has been put into robustification of PCA. In this paper we present a new algorithm for robust PCA minimizing the trimmed reconstruction error. By directly minimizing over the Stiefel manifold, we avoid deflation as often used by projection pursuit methods. In distinction to other methods for robust PCA, our method has no free parameter and is computationally very efficient. We illustrate the performance on various datasets including an application to background modeling and subtraction. Our method performs better or similar to current state-of-the-art methods while being faster.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 Jun 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.
- 2022Non-Linear Spectral Dimensionality Reduction Under Uncertaintycited by 0
- 2024Riemannian Bilevel Optimizationcited by 0
- 2024Riemannian Bilevel Optimization22 May 2024
- 2022Non-Linear Spectral Dimensionality Reduction Under Uncertainty9 Feb 2022