Tuesday, April 29, 2014

TGA: Grassmann Averages for Scalable Robust PCA - implementation -

So it looks like we have a fast implementation of the Robust PCA


Grassmann Averages for Scalable Robust PCA by Søren Hauberg, Aasa Feragen, Michael J. Black

As the collection of large datasets becomes increasingly automated, the occurrence of outliers will increase“big data” implies “big outliers”. While principal component analysis (PCA) is often used to reduce the size of data, and scalable solutions exist, it is well-known that outliers can arbitrarily corrupt the results. Unfortunately, state- of-the-art approaches for robust PCA do not scale beyond small-to-medium medium sized datasets. To address this, we introduce the Grassmann Average (GA), which expresses dimensionality reduction as an average of the subspaces spanned by the data. Because averages can be efficiently computed, we immediately gain scalability. GA is inherently more robust than PCA, but we show that they coincide for Gaussian data. We exploit that averages can be made robust to formulate the Robust Grassmann Average (RGA) as a form of robust PCA. Robustness can be with respect to vectors (subspaces) or elements of vectors; we focus on the latter and use a trimmed average. The resulting Trimmed Grassmann Average (TGA) is particularly appropriate for computer vision because it is robust to pixel outliers. The algorithm has low computational complexity and minimal memory requirements, making it scalable to “big noisy data.” We demonstrate TGA for background modeling, video restoration, and shadow removal. We show scalability by performing robust PCA on the entire Star Wars IV movie.


from the text:

To further emphasize the scalability of TGA, we compute the 20 leading components of the entire Star Wars IV movie. This consist of 179,415 frames with a resolution of 352153. Computing these 20 components (see [15]) took 8.5 hours on an Intel Xeon E5-2650 with 128 GB memory.
my emphasis on the underlined word.

The project page is here and the attendant code is here. It will be added to the Advanced Matrix Factorization Jungle page shortly.



Join the CompressiveSensing subreddit or the Google+ Community and post there !
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.

No comments:

Printfriendly