Fast Robust PCA on Graphs

by   Nauman Shahid, et al.

Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the curse of dimensionality. However, often such methods are accompanied with three different problems: high computational complexity (usually associated with the nuclear norm minimization), non-convexity (for matrix factorization methods) and susceptibility to gross corruptions in the data. In this paper we propose a principal component analysis (PCA) based solution that overcomes these three issues and approximates a low-rank recovery method for high dimensional datasets. We target the low-rank recovery by enforcing two types of graph smoothness assumptions, one on the data samples and the other on the features by designing a convex optimization problem. The resulting algorithm is fast, efficient and scalable for huge datasets with O(nlog(n)) computational complexity in the number of data samples. It is also robust to gross corruptions in the dataset as well as to the model parameters. Clustering experiments on 7 benchmark datasets with different types of corruptions and background separation experiments on 3 video datasets show that our proposed model outperforms 10 state-of-the-art dimensionality reduction models. Our theoretical analysis proves that the proposed model is able to recover approximate low-rank representations with a bounded error for clusterable data.


page 1

page 5

page 6

page 9

page 13

page 14


Robust Principal Component Analysis on Graphs

Principal Component Analysis (PCA) is the most widely used tool for line...

Low-Rank Nonlinear Decoding of μ-ECoG from the Primary Auditory Cortex

This paper considers the problem of neural decoding from parallel neural...

Robust Graph Learning from Noisy Data

Learning graphs from data automatically has shown encouraging performanc...

Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection

Robust principal component analysis (RPCA) is a critical tool in modern ...

Low-Rank Isomap Algorithm

The Isomap is a well-known nonlinear dimensionality reduction method tha...

Sifting Common Information from Many Variables

Measuring the relationship between any pair of variables is a rich and a...

Maximum Margin Principal Components

Principal Component Analysis (PCA) is a very successful dimensionality r...

Please sign up or login with your details

Forgot password? Click here to reset