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 15. Neurocomput<strong>in</strong>g, 69:1485-1501, 2006 213<br />

SNR Enhancement [dB]<br />

-5 0 5 10<br />

11<br />

10<br />

9<br />

8<br />

7<br />

6<br />

5<br />

4<br />

SNR enhancement Mean square error Kurtosis<br />

ica<br />

pca<br />

-5 0 5 10<br />

Source SNR [dB]<br />

11<br />

10<br />

9<br />

8<br />

7<br />

6<br />

5<br />

4<br />

Error orig<strong>in</strong>al/recovered [×10 3 ]<br />

0 1 2 3 4 5 6 7 8<br />

3<br />

2<br />

1<br />

ica<br />

pca<br />

3<br />

2<br />

1<br />

0<br />

0<br />

0 1 2 3 4 5 6 7 8<br />

Error orig<strong>in</strong>al/noisy [×10 3 ]<br />

Kurtosis error |kurt(se) − kurt(s)|<br />

-5 0 5 10<br />

10<br />

8<br />

6<br />

4<br />

2<br />

0<br />

-5 0 5 10<br />

Source SNR [dB]<br />

Fig. 2. Comparison between LPCA and LICA based denois<strong>in</strong>g. Here the mean square<br />

error of two signals x, y with L samples is 1 �<br />

L ||xi − yi|| 2 . For all noise levels a<br />

complete parameter estimation was done <strong>in</strong> the sets {10, 15, . . . , 60} for M and<br />

{20, 30, . . . , 80} for K.<br />

4.1.3 LICA denois<strong>in</strong>g with multi-dimensional data sets<br />

A generalization of the LICA algorithm to multidimensional data sets like<br />

images where pixel <strong>in</strong>tensities depend on two coord<strong>in</strong>ates is desirable. A simple<br />

generalization would be to look at delayed coord<strong>in</strong>ates of vectors <strong>in</strong>stead<br />

of scalars. However, this appears impractical due to the prohibitive computational<br />

effort. More importantly, this direct approach reduces the number<br />

of available samples significantly. This leads to far less accurate estimators<br />

of important aspects like the MDL estimation of the dimension of the signal<br />

subspace or the estimation of the kurtosis criterion <strong>in</strong> the LICA case.<br />

Another approach could be to convert the data to a 1D str<strong>in</strong>g by choos<strong>in</strong>g some<br />

path through the data and concatenat<strong>in</strong>g the pixel <strong>in</strong>tensities accord<strong>in</strong>gly. But<br />

this can easily create unwanted artifacts along the chosen path. Further, local<br />

correlations are broken up, hence not all the available <strong>in</strong>formation is used.<br />

But a more sophisticated and, depend<strong>in</strong>g on the nature of the signal, very effective<br />

alternative approach can be envisaged. Instead of convert<strong>in</strong>g the multidimensional<br />

data <strong>in</strong>to 1D data str<strong>in</strong>gs prior to apply<strong>in</strong>g the LICA algorithm,<br />

we can use a modified delay transformation us<strong>in</strong>g shifts along all available<br />

dimensions. This concept is similar to the multidimensional auto-covariances<br />

used <strong>in</strong> the Multi Dimensional SOBI (mdSOBI) algorithm <strong>in</strong>troduced <strong>in</strong> [31].<br />

In the 2D case, for example, consider an n × n image represented by a matrix<br />

P = (aij)i,j=1...n. Then the transformed data set consists of copies of P which<br />

are shifted either along columns or rows or both. For <strong>in</strong>stance, a translation<br />

16<br />

i<br />

ica<br />

pca<br />

10<br />

8<br />

6<br />

4<br />

2<br />

0

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

Saved successfully!

Ooh no, something went wrong!