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 20. Signal Process<strong>in</strong>g 86(3):603-623, 2006 269<br />

adjusted with the aid of an <strong>in</strong>corporated graphical user <strong>in</strong>terface [18]. In the<br />

present work, the thresholds were set to 10% for all the signals so that we may<br />

compare all obta<strong>in</strong>ed results easily. The algorithm looks for zero-cross<strong>in</strong>gs on<br />

the signal and def<strong>in</strong>es a waveform as the samples of the considered signal comprised<br />

between two consecutive zero-cross<strong>in</strong>gs. If the maximum (respectively,<br />

m<strong>in</strong>imum <strong>in</strong> the case of a negative waveform) is above (respectively, below)<br />

the threshold, that waveform is kept <strong>in</strong> the signal given as output. Otherwise,<br />

the waveform is substituted by a zero-voltage signal on that period.<br />

It is quite important to use such a filter, because although BSS algorithms<br />

are generally able to separate the noise as a component, they are usually<br />

unable to separate more source signals than available channels. Generally <strong>in</strong><br />

our experiments there were more MUs than available channels even at low<br />

levels of contraction, but only few of them had amplitude above the noise<br />

level. In order to elim<strong>in</strong>ate the activity of some MUs we delete the MUAPTs<br />

belong<strong>in</strong>g to distant MUs, whose MUAPs are less powerful. This is enhanced<br />

by PCA preprocess<strong>in</strong>g and dimension reduction as discussed later <strong>in</strong> section<br />

3.2.<br />

2.2 Bl<strong>in</strong>d source separation<br />

L<strong>in</strong>ear bl<strong>in</strong>d source separation (BSS) describes the task of bl<strong>in</strong>dly recover<strong>in</strong>g<br />

A and S <strong>in</strong> the equation<br />

X = AS + N (1)<br />

where X consists of m signals with N observations each, put together <strong>in</strong>to an<br />

(m × N)−matrix. A is a full-rank (m × n)−matrix, and we typically assume<br />

that m ≥ n (complete and under-complete case). Moreover N models additive<br />

noise, which is commonly assumed to be white Gaussian. Depend<strong>in</strong>g on the<br />

assumptions on A and S we get different models. Our goal is to estimate<br />

the mix<strong>in</strong>g matrix A. Then the sources can be recovered by apply<strong>in</strong>g the<br />

pseudo<strong>in</strong>verse A + of A to the mixtures X (which is optimal <strong>in</strong> the maximumlikelihood<br />

sense when Gaussian noise is assumed).<br />

In the case of s-EMG data, the orig<strong>in</strong>al signals are the MUAPTs generated by<br />

the motor units active dur<strong>in</strong>g a susta<strong>in</strong>ed contraction. In this sett<strong>in</strong>g, A quantifies<br />

how each source contributes to each observation. Of course additional<br />

requirements will have to be applied to the model to guarantee a satisfactorily<br />

small space of solutions, and depend<strong>in</strong>g on the assumptions on A and S we<br />

will obta<strong>in</strong> different models.<br />

8

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

Saved successfully!

Ooh no, something went wrong!