Simultaneous principal-component extraction with application to adaptive blind multiuser detection
EURASIP Journal on Applied Signal Processing
Projection approximation subspace tracking
IEEE Transactions on Signal Processing
Artificial neural networks for feature extraction and multivariate data projection
IEEE Transactions on Neural Networks
Reduced dimension control based on online recursive principal component analysis
ACC'09 Proceedings of the 2009 conference on American Control Conference
Linear dimensionality reduction in random motion planning
International Journal of Robotics Research
Independent component analysis applied to voice activity detection
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Hi-index | 0.00 |
Principal components analysis is an important and well-studied subject in statistics and signal processing. The literature has an abundance of algorithms for solving this problem, where most of these algorithms could be grouped into one of the following three approaches: adaptation based on Hebbian updates and deflation, optimization of a second-order statistical criterion (like reconstruction error or output variance), and fixed point update rules with deflation. In this paper, we take a completely different approach that avoids deflation and the optimization of a cost function using gradients. The proposed method updates the eigenvector and eigenvalue matrices simultaneously with every new sample such that the estimates approximately track their true values as would be calculated fromthe current sample estimate of the data covariance matrix. The performance of this algorithm is compared with that of traditional methods like Sanger's rule and APEX, as well as a structurally similar matrix perturbation-based method.