By Topic

Fast parallel processing using GPU in computing L1-PCA bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Funatsu, N. ; Kurume Nat. Coll. of Technol., Kurume, Japan ; Kuroki, Y.

In data-analysis problems with a large number of dimensions, the 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; therefore, some studies have shown the superiority of PCA-L1 to L2-PCA. However, PCA-L1 requires enormous computational cost to obtain the bases, because PCA-L1 employs an iterative algorithm, and initial bases are eigenvectors of autocorrelation matrix. The autocorrelation matrix in the PCA-L1 needs to be recalculated for the each basis besides. In previous works, the authors proposed a fast PCA-L1 algorithm providing identical bases in terms of theoretical approach, and decreased computational time roughly to a quarter. This paper attempts to accelerate the computation of the L1-PCA bases using GPU.

Published in:

TENCON 2010 - 2010 IEEE Region 10 Conference

Date of Conference:

21-24 Nov. 2010