14.02.2013 Views

Mathematics in Independent Component Analysis

Mathematics in Independent Component Analysis

Mathematics in Independent Component Analysis

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter 2. Neural Computation 16:1827-1850, 2004 61<br />

1832 F. Theis<br />

Some trivial properties of the separator Rij are listed <strong>in</strong> the next lemma:<br />

Lemma 2. Let f, g ∈ C 2 (R n , C),i�= j and α ∈ C. Then<br />

and<br />

Rij[αf ] = α 2 Rij[ f ]<br />

Rij[ f + g] = Rij[ f ] + Rij[g] + f ∂i∂jg + g∂i∂j f − (∂i f )(∂jg) − (∂ig)(∂j f ).<br />

3 Separability of L<strong>in</strong>ear BSS<br />

Consider the noiseless l<strong>in</strong>ear <strong>in</strong>stantaneous BSS model with as many sources<br />

as sensors:<br />

X = AS, (3.1)<br />

with an <strong>in</strong>dependent n-dimensional random vector S and A ∈ Gl(n). Here,<br />

Gl(n) denotes the general l<strong>in</strong>ear group of R n , that is, the group of all <strong>in</strong>vertible<br />

(n × n)-matrices.<br />

The task of l<strong>in</strong>ear BSS is to f<strong>in</strong>d A and S given only X. An obvious <strong>in</strong>determ<strong>in</strong>acy<br />

of this problem is that A can be found only up to scal<strong>in</strong>g and<br />

permutation because for scal<strong>in</strong>g L and permutation matrix P,<br />

X = ALPP −1 L −1 S,<br />

and P −1 L −1 S is also <strong>in</strong>dependent. Here, an <strong>in</strong>vertible matrix L ∈ Gl(n)<br />

is said to be a scal<strong>in</strong>g matrix if it is diagonal. We say two matrices B, C<br />

are equivalent, B ∼ C, ifC can be written as C = BPL with a scal<strong>in</strong>g<br />

matrix L ∈ Gl(n) and an <strong>in</strong>vertible matrix with unit vectors <strong>in</strong> each row<br />

(permutation matrix) P ∈ Gl(n). Note that PL = L ′ P for some scal<strong>in</strong>g matrix<br />

L ′ ∈ Gl(n), so the order of the permutation and the scal<strong>in</strong>g matrix does not<br />

play a role for equivalence. Furthermore, if B ∈ Gl(n) with B ∼ I, then also<br />

B −1 ∼ I, and, more generally if BC ∼ A, then C ∼ B −1 A. Accord<strong>in</strong>g to the<br />

above, solutions of l<strong>in</strong>ear BSS are equivalent. We will show that under mild<br />

assumptions to S, there are no further <strong>in</strong>determ<strong>in</strong>acies of l<strong>in</strong>ear BSS.<br />

S is said to have a gaussian component if one of the Si is a one-dimensional<br />

gaussian, that is, pSi (x) = d exp(−ax2 + bx + c) with a, b, c, d ∈ R, a > 0, and<br />

S has a determ<strong>in</strong>istic component if one Si is determ<strong>in</strong>istic, that is, constant.<br />

Theorem 2 (Separability of l<strong>in</strong>ear BSS). Let A ∈ Gl(n) and S be an <strong>in</strong>dependent<br />

random vector. Assume one of the follow<strong>in</strong>g:<br />

i. S has at most one gaussian or determ<strong>in</strong>istic component, and the covariance<br />

of S exists.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!