Publication: Fast PCA via UTV decomposition and application on EEG analysis
3
Issued Date
2009-01-01
Resource Type
Other identifier(s)
2-s2.0-77950993014
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Proceedings of the 31st Annual International Conference of the IEEE Engineering in Medicine and Biology Society: Engineering the Future of Biomedicine, EMBC 2009. (2009), 5669-5672
Suggested Citation
Yodchanan Wongsawat Fast PCA via UTV decomposition and application on EEG analysis. Proceedings of the 31st Annual International Conference of the IEEE Engineering in Medicine and Biology Society: Engineering the Future of Biomedicine, EMBC 2009. (2009), 5669-5672. doi:10.1109/IEMBS.2009.5333119 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/27305
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Fast PCA via UTV decomposition and application on EEG analysis
Author(s)
Other Contributor(s)
Abstract
In the mean square error sense, principal component analysis (PCA) or Karhunen-Loeve transform (KLT) can optimally summarize the high dimensional data into only a few meaningful ones. However, for the biomedical signal analysis, e.g. electroencephalogram (EEG), the data need to be updated or downdated very often. This fact makes the PCA impractical to be employed, especially in real-time signal analysis. In this paper, we propose the fast computational method for approximating the PCA such that the new transform, called fast PCA (fastPCA), can easily be updated and downdated. The fastPCA is calculated via the UTV decomposition which is the method normally used to approximate the rank-revealing property of the singular value decomposition (SVD). The merit of the fastPCA is also illustrated via the application on EEG analysis. ©2009 IEEE.