Established in 2005 under support of MŠMT ČR (project 1M0572)

Publications

A Computationally Affordable Implementation of An Asymptotically Optimal BSS Algorithm for AR Sources.

Typ:
Conference paper
Authors:
Tichavský P., Doron E., Yeredor A., Nielsen J.
Proceedings name:
Proceedings of 14th European Signal Processing Conference (EUSIPCO 2006).
Publisher:
EURASIP
Serie:
Florence
Year:
2006
Pages:
1-5
Keywords:
independent component analysis, blind source separation
attachment1:
1568981867 [file]
Anotation:
The second-order blind identification (SOBI) algorithm for separation of stationary sources was proved to be useful in many biomedical applications. This paper revisits the so called weights-adjusted variant of SOBI, known as WASOBI, which is asymptotically optimal (in separating Gaussian parametric processes), yet prohibitively computationally demanding for more than 2-3 sources. A computationally feasible implementation of the algorithm is proposed, which has a complexity of the same order as SOBI. Excluding the estimation of the correlation matrices, the post-processing complexity of SOBI is $O(d^4M)$, where $d$ is the number of the signal components and $M$ is the number of covariance matrices involved. The additional complexity of our proposed implementation of WASOBI is $O(d^6+d^3M^3)$ operations. However, for WASOBI, the number $M$ of the matrices can be significantly lower than that of SOBI without compromising performance. WASOBI is shown to significantly outperform SOBI in simulation, and can be applied, e.g., in the processing of low density EEG signals.
 
Copyright 2005 DAR XHTML CSS