Asymptotically optimal blind separation of parametric gaussian sources

Eran Doron, Arie Yeredor

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The second-order blind identification (SOBI) algorithm (Belouchrani et al., 1997) is a classical blind source separation (BSS) algorithm for stationary sources. The weights-adjusted SOBI (WASOBI) algorithm (Yeredor 2000) proposed a reformulation of the SOBI algorithm as a weighted nonlinear least squares problem, and showed how to obtain asymptotically optimal weights, under the assumption of Gaussian Moving Average (MA) sources. In this paper, we extend the framework by showing how to obtain the (asymptotically) optimal weight matrix also for the cases of auto-regressive (AR) or ARMA Gaussian sources (of unknown parameters), bypassing the apparent need for estimation of infinitely many correlation matrices. Comparison with other algorithms, with the Cramér Rao bound and with the analytically predicted performance is presented using simulations. In particular, we show that the optimal performance can be attained with fewer estimated correlation matrices than in the Gaussian Mutual Information approach (which is also optimal in this context).

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsCarlos G. Puntonet, Alberto Prieto
PublisherSpringer Verlag
Pages390-397
Number of pages8
ISBN (Electronic)3540230564, 9783540230564
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3195
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Asymptotically optimal blind separation of parametric gaussian sources'. Together they form a unique fingerprint.

Cite this