An Improved FastICA Algorithm Using Correction Factors And Lanczos Algorithm For EEG Signals

Independent Component Analysis (ICA) is a powerful technique for source separation, particularly in scenarios where prior knowledge is unavailable. However, the conventional FastICA algorithm often suffers from slow convergence and a high iteration count, limiting its applicability in real-time scenarios. This paper proposes an improved FastICA algorithm that addresses these limitations by reducing computational time and iteration count. Specifically, incorporating an inexact correction factor reduces the average number of iterations by 5.13%. By setting the correction term to 0.993 and introducing a random initial matrix with parameter values of 96, the algorithm achieves a 29.20% improvement in computational efficiency. Furthermore, applying the Lanczos algorithm for whitening further improves performance. When the parameter values of the random initial matrix is adjusted to 72, the number of iterations is reduced by 28.65%. Combining a correction term of 0.999 with parameter values of the random initial matrix are 72 yields an overall efficiency improvement of approximately 35.11%, demonstrating a significant advancement over the original FastICA algorithm.

Authors

Publication Details

Published
2025-03-28
DOI
https://doi.org/10.1109/cacml64929.2025.11010932
Primary Topic
Blind Source Separation Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved FastICA Algorithm Using Correction Factors And Lanczos Algorithm For EEG Signals

Huaili Jiang, Qingjun Zhu, Xingen Gao, Hongyi Zhang et al.
Blind Source Separation Techniques
article

An Improved FastICA Algorithm Using Correction Factors And Lanczos Algorithm For EEG Signals

Huaili Jiang, Qingjun Zhu, Xingen Gao, Hongyi Zhang, Zhi‐Hua Zhong, Junqi Huang
article en

Abstract

Independent Component Analysis (ICA) is a powerful technique for source separation, particularly in scenarios where prior knowledge is unavailable. However, the conventional FastICA algorithm often suffers from slow convergence and a high iteration count, limiting its applicability in real-time scenarios. This paper proposes an improved FastICA algorithm that addresses these limitations by reducing computational time and iteration count. Specifically, incorporating an inexact correction factor reduces the average number of iterations by 5.13%. By setting the correction term to 0.993 and introducing a random initial matrix with parameter values of 96, the algorithm achieves a 29.20% improvement in computational efficiency. Furthermore, applying the Lanczos algorithm for whitening further improves performance. When the parameter values of the random initial matrix is adjusted to 72, the number of iterations is reduced by 28.65%. Combining a correction term of 0.999 with parameter values of the random initial matrix are 72 yields an overall efficiency improvement of approximately 35.11%, demonstrating a significant advancement over the original FastICA algorithm.

Natural Science Foundation of Fujian Province, Xiamen University of Technology
Openalex Percentile: Top 87%
Blind Source Separation Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.