A new On-Line Negentropy-based Algorithm for Blind Source Separation
Maha Mohamed Elsabrouty, Martin Bouchard, T. Aboulnasr
Abstract
Maha Mohamed Elsabrouty, Martin Bouchard, T. Aboulnasr
Abstract
Negentropy is one of the principal techniques for independent component analysis. It serves as a multi-purpose tool for both blind signal separation (BSS) and blind signal extraction (BSE). However, the main and most widely used algorithm based on negentropy, namely Fast-IC works in batch mode. A fast on-line operation with a fast convergence rate is very useful in tracking non-stationary sources. In this paper, we modify the cost function of negentropy to produce an improved on-line algorithm. Simulation results of the proposed algorithm prove its good performance and remarkable convergence rate.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Negentropy is one of the principal techniques for independent component analysis. It serves as a multi-purpose tool for both blind signal separation (BSS) and blind signal extraction (BSE). However, the main and most widely used algorithm based on negentropy, namely Fast-IC works in batch mode. A fast on-line operation with a fast convergence rate is very useful in tracking non-stationary sources. In this paper, we modify the cost function of negentropy to produce an improved on-line algorithm. Simulation results of the proposed algorithm prove its good performance and remarkable convergence rate.
Key concepts: Negentropy, Blind signal separation, Independent component analysis, Convergence (economics), Computer science, Algorithm, FastICA, Principal component analysis