1. Linear and Non-Linear ICA-BSS I C A --------  Independent Component Analysis B S S --------  Blind Source Separation Carlos G. Puntonet Dept.of Architecture and Computer Technology Circuits and system for information processing group University of Granada (Spain)

2. The Problem of “linear” blind separation of p sources: Original signals: s(t)=[s 1 (t),....,s p (t)] T Mixture: e(t)=[e 1 (t),...,e p (t)] T Mixture matrix: A(t) pxp The goal is to estimate A(t) by means of W(t) such that the output vector, s*(t) is:

4. REAL APLICATIONS BSS is Independent Component Analysis (ICA) Noise Elimination in general Speech Processing (Cocktail Party, Noise environment,...) Sonar, Radar Sismic waves Preprocessing recognition Image Processing Biomedicine (ECG, EEG, fMRI,...)

5. Geometric methods I: Digital Binary Signals * Binary Signals S 1 u = (1,...,0,...,0) t..................... S i u = (0,...,1,...,0) t..................... S p u = (0,...,0,...,1) t The image of a base vector S i u is the vector A oi, i.e. the column i of the unknown mixture matrix A o : h(S i u ) = A oi

7. Signals * n-valued Signals

11. Geometric methods II: Slopes For input Vectors: Slope Function: Extreme values: a ij = min { e i. e j -1 } e j > 0 œi,j0{1,..,p}

12. * * Fast method for p=2 signals * * Valid for random or bounded sources * * Slopes are the independent components * * Modifiable for p>2

15. Simulation example (p=3, 1000 samples)

16. GENERAL p-DIMMENSIONAL METHOD Obtained matrix W: For p points verifying minimum value of:

18. ADAPTIVE NETWORK

19. * * Geometric method for p signals * * Valid for random or bounded sources * * Slopes are the independent components * * No order statistics * * Probability of obtaining p points close to the hiper- parallelepiped edges ?

20. Geometric methods III: Speech - For Linear mixtures - Unimodal p.d.f.’s (non-uniform’s) - Detection of max.density points in the mixture space - Normalization and detection in the sphere radius-unit.

21. SOURCE SPACE MIXTURE SPACE FROM

22. Detection of 2 maxima ( 2 ICA components, p=2 )

23. Amari index

24. NEW GEO-METHOD with KURTOSIS. (K(e 1 )>0) and (K(e 2 )>0) (K(e 1 )<0) or (K(e 2 )<0)

25. Lattice of Space M 1 *M 2 Cells. Threshold (TH), and Red-Cells with points > TH.

26. ICA COMPONENTS FROM KURTOSIS: If K(e 1 )>0 and K(e 2 )>0  Maximum Density Zones If K(e 1 )<0 or K(e 2 )<0  Border Detection

27. Separation of Sources using Simulated Annealing and Competitive Learning Univ. Regensburg and Univ. Granada - New adaptive procedure for the linear and “non-linear” separation - Signals with non-uniform, symmetrical probability distributions - Simulated annealing, competitive learning, and geometric methods - Neural network, and multiple linearization in the mixture space - Simplicity and rapid convergence - Validated by speech signals or biomedical data. Geometric methods IV: Heuristic + Neural networks

28. Observation space with n p-spheres (n=4, p=2) Space Quantization:

29. Competitive Learning:

30. Simulated Annealing: Energy Function: Fourth-order cumulant : Weights generation:

31. Simulated Annealing and Competitive Learning 1010 time SA CL

32. NON-LINEAR: Contour for where the mixture can be considered linear

33. Simulation 1: 3 signals

34. Simulation 2: Non-linear mixture of 2 digital 32-valued signals

35. Simulation 3: EEG signals Eye blink --> Low wave 1 --> Musc. Spik. --> Low wave 2 --> Cardi. Contam. -->

36. Neural network for the separation

37. Real Time Simulation

38. GENETIC ALGORITHMS FOR NON LINEAR ICA

39. Genetic Algorithms are one of the most popular stochastic optimisation techniques. Inspired by natural genetics and the biological evolutionary process : * A scheme for encoding solutions to a problem in the form of a chromosome (chromosomal representation).  * An evaluation function which indicates the fitness of each chromosome relative to the others in the current set of chromosomes (referred to as population).  * An initialisation procedure for the population of chromosomes.  * A set of parameters that provide the initial settings for the algorithm: the population size and probabilities employed by the genetic operators. *The GA evaluates a given population and generates a new one iteratively, with each successive population referred to as a generation, from genetic operations: reproduction, crossover and mutation.

40. ICA and BSS have LOCAL MINIMA

41. SIMULATIONS

42. ¡¡¡¡¡ THE END !!!!! THANK YOU VERY MUCH DANKESHÖN GRACIAS