14.02.2013 Views

Mathematics in Independent Component Analysis

Mathematics in Independent Component Analysis

Mathematics in Independent Component Analysis

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

232 Chapter 16. Proc. ICA 2006, pages 917-925<br />

1.2 Uniqueness theorem<br />

Def<strong>in</strong>ition 1. X=AS with A∈Gl(d), S=(SN, SG) and SN∈ L2(Ω,R n ) is called an<br />

n-decomposition of X if SN and SG are stochastically <strong>in</strong>dependent and SG is Gaussian.<br />

In this case, X is said to be n-decomposable.<br />

Hence an n-decomposition of X corresponds to the NGSA problem. If as before<br />

A=(AN, AG), then the n-dimensional subvectorspace im(AN)⊂R d is called the non-<br />

Gaussian subspace, and im(AG) the Gaussian subspace of the decomposition; here<br />

im(A) denotes the image of the l<strong>in</strong>ear map A.<br />

Def<strong>in</strong>ition 2. X is denoted to be m<strong>in</strong>imally n-decomposable if X is not (n−1)-decomposable.<br />

Then dime(X) := n is called the essential dimension of X.<br />

For example, the essential dimension dime(X) is zero if and only if X is Gaussian,<br />

whereas the essential dimension of a d-dimensional mutually <strong>in</strong>dependent Laplacian is<br />

d. The follow<strong>in</strong>g theorem is the ma<strong>in</strong> theoretical contribution of this work. It essentially<br />

connects uniqueness of the dimension reduction model with m<strong>in</strong>imality, and gives a<br />

simple characterization for it.<br />

Theorem 1 (Uniqueness of NGSA). Let n

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

Saved successfully!

Ooh no, something went wrong!