| Paper ID | SPTM-1.4 |
| Paper Title |
Robust PCA through Maximum Correntropy Power Iterations |
| Authors |
Jean Chereau, Bruno Scalzo, Danilo P. Mandic, Imperial College London, United Kingdom |
| Session | SPTM-1: Detection Theory and Methods 1 |
| Location | Gather.Town |
| Session Time: | Tuesday, 08 June, 13:00 - 13:45 |
| Presentation Time: | Tuesday, 08 June, 13:00 - 13:45 |
| Presentation |
Poster
|
| Topic |
Signal Processing Theory and Methods: [SSP] Statistical Signal Processing |
| IEEE Xplore Open Preview |
Click here to view in IEEE Xplore |
| Virtual Presentation |
Click here to watch in the Virtual Conference |
| Abstract |
Principal component analysis (PCA) is considered a quintessential data analysis technique when it comes to describing linear relationships between the features of a dataset. However, the well-known lack of robustness of PCA for non-Gaussian data and/or outliers often makes its practical use unreliable. To this end, we introduce a robust formulation of PCA based on the maximum correntropy criterion (MCC). By virtue of MCC, robust operation is achieved by maximising the expected likelihood of Gaussian distributed reconstruction errors. The analysis shows that the proposed solution reduces to a generalised power iteration, whereby: (i) robust estimates of the principal components are obtained even in the presence of outliers; (ii) the number of principal components need not be specified in advance; and (iii) the entire set of principal components can be obtained, unlike existing approaches. The advantages of the proposed maximum correntropy power iteration (MCPI) are demonstrated through an intuitive numerical example. |
