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.

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

<strong>in</strong>stant only k source components are allowed to vary from a previously fixed<br />

constant (which can be different for each source).<br />

In [3] we showed that under slight conditions k-sparseness already guarantees<br />

identifiability of the model, even <strong>in</strong> the case of less observations than sources.<br />

In the sett<strong>in</strong>g of s-EMG however we are <strong>in</strong> the comfortable situation of hav<strong>in</strong>g<br />

more observations than sources, so as <strong>in</strong> the ICA case we preprocess our data<br />

us<strong>in</strong>g PCA projection — this dimension reduction algorithm can be applied<br />

even to our case of non-decorrelated sources as (given low or no noise) the first<br />

three pr<strong>in</strong>cipal components will span the source signal subspace, see comment<br />

<strong>in</strong> section 3.2. The above uniqueness result is based on the fact that due to the<br />

assumed sparseness the data clusters <strong>in</strong>to a fixed number of hyperplanes. This<br />

fact can also be used <strong>in</strong> an algorithm to actually reconstruct A by identify<strong>in</strong>g<br />

the set of hyperplanes. From the hyperplanes, A can be recovered by simply<br />

tak<strong>in</strong>g <strong>in</strong>tersections.<br />

However, multiple hyperplane identification is non trivial, and the <strong>in</strong>volved<br />

cost function<br />

σ(A) = 1<br />

N<br />

N�<br />

t=1<br />

n<br />

m<strong>in</strong><br />

i=1<br />

|a⊤ i X(t)|<br />

, (5)<br />

�X(t)�<br />

where ai denote the columns of A, is highly non-convex. In order to improve<br />

the robustness of the proposed, stochastic identifier, we developed an identification<br />

algorithm us<strong>in</strong>g a generalized Hough transform [37]. Alternatively a<br />

generalization of k-means cluster<strong>in</strong>g can be used, which iteratively clusters the<br />

data <strong>in</strong>to groups belong<strong>in</strong>g to the different hyperplanes, and then identifies a<br />

hyperplane with<strong>in</strong> the cluster by regression [38].<br />

In this paper, we assume sparseness of the sources S <strong>in</strong> the sense that at<br />

least one coefficient of S at a certa<strong>in</strong> time <strong>in</strong>stant has to be zero. In the<br />

case of s-EMG, the maximum natural fir<strong>in</strong>g rate of a motor unit is about 30<br />

pulses/second, last<strong>in</strong>g each pulse less than 15 ms [39]. Therefore, a motor unit<br />

is active less than 450 ms per second; that is, at least 55% of the time each<br />

source signal is zero. In addition, the fir<strong>in</strong>gs of different motor units are not<br />

synchronized (only their respective fir<strong>in</strong>g rate shows the tendency to change<br />

together, the so-called common drive [40]). For these reasons, the probability<br />

of all n sources fir<strong>in</strong>g at a given time <strong>in</strong>stant is bounded by 0.45 n , which quickly<br />

approaches zero for <strong>in</strong>creas<strong>in</strong>g n. Even <strong>in</strong> the case of only n = 3 sources, at<br />

most 9% of the samples are fully active. Hence the source conditions for SCA<br />

should be rather well fulfilled, an we can f<strong>in</strong>d isolated MUAPs <strong>in</strong>side an s-EMG<br />

signal us<strong>in</strong>g SCA with high probability.<br />

12

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

Saved successfully!

Ooh no, something went wrong!