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.

278 Chapter 20. Signal Process<strong>in</strong>g 86(3):603-623, 2006<br />

JADE NMF NMF∗ sNMF sNMF∗ SCA sources<br />

mean kurtosis 10.80 8.48 8.80 8.85 9.64 7.14 11.4<br />

sparseness 0.286 0.268 0.295 0.270 0.302 0.201 0.252<br />

σ(A✷) 2.91 2.02 2.11 1.99 2.36 0.96 3.24<br />

Table 2<br />

Sparseness measures of the recovered sources us<strong>in</strong>g the various methods. In the first<br />

row, the mean kurtosis is calculated (the higher, the more ‘spiky’ the signal). The<br />

second row gives the sparseness <strong>in</strong>dex from equation (3) (the higher, the sparser<br />

the signal) and the third row the cost function (5) employed <strong>in</strong> SCA (the lower, the<br />

better the SCA criterion is fulfilled). Optimal values are pr<strong>in</strong>ted <strong>in</strong> bold face.<br />

AJADE ANMF ANMF∗ AsNMF AsNMF∗ ASCA<br />

E1(A + ✷A) 1.39 3.27 2.96 3.41 2.56 3.86<br />

JADE clearly outperforms the other methods — this will be expla<strong>in</strong>ed <strong>in</strong> the<br />

next paragraph. However we have to add that the signal generation additionally<br />

<strong>in</strong>volves a slightly nonl<strong>in</strong>ear filter, so we can only estimate the real mix<strong>in</strong>g<br />

matrix A from the sources and the mixtures, which yielded a non-negligible<br />

error. Hence this result <strong>in</strong>dicates that JADE could best approximate the l<strong>in</strong>earized<br />

system.<br />

One key question <strong>in</strong> this work is how the different models <strong>in</strong>duce sparseness.<br />

Clearly, sparseness is a rather ambiguous term, so we calculate three<br />

<strong>in</strong>dices (kurtosis, ‘sparseness’ from equation (3) and σ from (5)) for the real<br />

as well as the recovered sources us<strong>in</strong>g the proposed methods, see Tab. 2. As<br />

expected, ICA gives the highest kurtosis among all methods, whereas sparse<br />

NMF yields highest values of the sparseness criterion. And SCA has the lowest<br />

i.e. best value regard<strong>in</strong>g k-sparseness measured by σ(A). We further see that<br />

both the kurtosis and the sparseness criterion seem to be somewhat related<br />

with regards to the data set as high values <strong>in</strong> both <strong>in</strong>dices are achieved by<br />

both JADE and sNMF. The k-sparseness criterion, which fixes only the zero-<br />

(semi)norm i.e. requires a fixed amount of zeros <strong>in</strong> the data without additional<br />

requirements about the other values does not <strong>in</strong>duce as high sparseness when<br />

measured us<strong>in</strong>g kurtosis/sparseness and vice versa. F<strong>in</strong>ally by look<strong>in</strong>g at the<br />

sparseness <strong>in</strong>dices of the real sources, we can now understand why JADE outperformed<br />

the other methods <strong>in</strong> this toy data sett<strong>in</strong>g — <strong>in</strong>deed kurtosis of the<br />

sources is high and the mutual <strong>in</strong>formation low, see Fig. 6(b). But <strong>in</strong> terms of<br />

sparseness and especially σ, the sources are not as sparse as expected. Hence<br />

the (sparse) NMF and ma<strong>in</strong>ly the SCA algorithm could not perform as well<br />

as JADE when compared to the orig<strong>in</strong>al sources as noted above. However, we<br />

will see that <strong>in</strong> the case of real s-EMG signals, this dist<strong>in</strong>ction will break; furthermore,<br />

sparse NMF turns out to be more robust aga<strong>in</strong>st noise than JADE,<br />

as is shown <strong>in</strong> the follow<strong>in</strong>g.<br />

17

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

Saved successfully!

Ooh no, something went wrong!