A batch subspace ICA algorithm
Ali Mansour, Noboru Ohnishi · 2002
For the blind source separation (BSS) problem (or independent component analysis (ICA)), it has been shown that in many situations adaptive subspace algorithms are very slow and need important computation efforts. In a previous publication, we proposed a modified subspace algorithm for stationary signals. But that algorithm was limited to stationary signals and its convergence was not fast enough. Here, we propose a batch subspace algorithm. The experimental study proves that this algorithm is very fast but its performance is not enough to achieve the complete separation of the independent components of the signals. On the other hand, this algorithm can be used as a preprocessing algorithm to initialize other adaptive subspace algorithms.