Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifold
Machine Learning
2015-06-02 v1 Machine Learning
Abstract
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.
Keywords
Cite
@article{arxiv.1506.00323,
title = {Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifold},
author = {Anastasia Podosinnikova and Simon Setzer and Matthias Hein},
journal= {arXiv preprint arXiv:1506.00323},
year = {2015}
}
Comments
long version of GCPR 2014 paper