open access

https://hdl.handle.net/2115/39687

Fast Method of Principal Component Analysis Based on L1-Norm Maximization Algorithm

英語

2009-10-04

Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference, International Organizing Committee

Proceedings : APSIPA ASC 2009 : Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference

262-265

APSIPA ASC 2009: Asia-Pacific Signal and Information Processing Association, 2009 Annual Summit and Conference. 4-7 October 2009. Sapporo, Japan. Poster session: Image, Video, and Multimedia Signal Processing 1 (5 October 2009).

In data-analysis problems with a large number of dimension, principal component analysis based on L2-norm (L2-PCA) is one of the most popular methods, but L2-PCA is sensitive to outliers. Unlike L2-PCA, PCA-L1 is robust to outliers because it utilizes the L1-norm, which is less sensitive to outliers. Furthermore, the bases obtained by PCA-L1 is invariant to rotations. However, PCA-L1 needs long time to calculate bases, because PCA-L1 employs an iterative algorithm to obtain each basis, and requires to calculate an eigenvector of autocorrelation matrix as an initial vector. The autocorrelation matrix needs to be recalculated for each basis. In this paper, we propose a fast method to compute the autocorrelation matrices. In order to verify the proposed method, we apply L2-PCA, PCA-L1, and the proposed method to face recognition. Simulation results show that the proposed method provides same recognition performance as PCA-L1, and is superior to L2-PCA, while the execution time is less than PCA-L1.

会議発表論文

Version of Record