# 1 Introduction Independent component analysis (ICA) [10] is a statistical technique whose main applications are blind source separation, blind deconvo

Save this PDF as:

Size: px
Start display at page:

Download "1 Introduction Independent component analysis (ICA) [10] is a statistical technique whose main applications are blind source separation, blind deconvo"

## Transcription

1 The Fixed-Point Algorithm and Maximum Likelihood Estimation for Independent Component Analysis Aapo Hyvarinen Helsinki University of Technology Laboratory of Computer and Information Science P.O.Box 5400, FIN HUT, Finland Abstract The author introduced previously a fast xed-point algorithm for independent component analysis. The algorithm was derived from objective functions motivated by projection pursuit. In this paper, it is shown that the algorithm is closely connected to maximum likelihood estimation as well. The basic xed-point algorithm maximizes the likelihood under the constraint of decorrelation, if the score function is used as the nonlinearity. Modications of the algorithm maximize the likelihood without constraints. Keywords: independent component analysis, blind source separation, xed-point algorithm 1

2 1 Introduction Independent component analysis (ICA) [10] is a statistical technique whose main applications are blind source separation, blind deconvolution, and feature extraction. In the simplest form of ICA [5], one observes m scalar random variables x 1 ; x 2 ; :::; x m which are assumed to be linear combinations of n unknown independent components, denoted by s 1 ; s 2 ; :::; s n. The independent components s i are assumed to be mutually statistically independent, and zero-mean. Arranging the observed variables x j into a vector x = (x 1 ; x 2 ; :::; x m ) T and the component variables s i into a vector s, the linear relationship can be expressed as x = As (1) Here, A is an unknown m n matrix of full column rank, called the mixing matrix. The basic problem of ICA is then to estimate both the mixing matrix A and the realizations of the independent componets s i using only observations of the mixtures x j. Several estimation methods for ICA have been proposed recently. The two methods most widely used in practice seem to be the xed-point algorithm [7, 8, 9] and the maximum likelihood (or infomax) stochastic gradient algorithm [1, 2, 3, 4]. The xed-point algorithm was originally derived [7, 8, 9] from objective functions motivated by projection pursuit [6], and therefore its connection to estimation of the ICA data model has been rather indirect. Maximum likelihood estimation is, in contrast, the mainstream method of statistical estimation. The purpose of this paper is to show that the xed-point algorithm is very closely connected to maximum likelihood estimation of the ICA model. It is shown that if the nonlinearity used is chosen correctly, the xed-point algorithm maximizes the likelihood approximately, i.e. under constraint of decorrelation. Hybrid versions between the xed-point algorithm and the ML stochastic gradient algorithm are proposed for exact and fast maximization of the likelihood. 2

3 2 A new form of xed-point algorithm To begin with, we shall derive the xed-point algorithm for one unit, using an objective function motivated by projection pursuit (see [8] for details). Consider one neural unit with weight vector w and input x. The goal is to nd the extrema of EfG(w T x)g for a given non-quadratic function G, under the constraint Ef(w T x) 2 g = 1. According to the Kuhn-Tucker conditions [12], the extrema are obtained at points where Efxg(w T x)g Cw = 0 (2) where C = Efxx T g, and is a constant that can be easily evaluated to give = Efw T 0 xg(w T 0 x)g, where w 0 is the value of w at the optimum. Let us try to solve this equation by Newton's method. Denoting the function on the left-hand side of (2) by F, we obtain its Jacobian matrix JF (w) as JF (w) = Efxx T g 0 (w T x)g C (3) To simplify the inversion of this matrix, we decide to approximate the rst term in (3). A reasonable approximation is Efxx T g 0 (w T x)g = Efxx T gefg 0 (w T x)g = Efg 0 (w T x)gc. The obtained approximation of the Jacobian matrix can be inverted easily: JF (w) 1 C 1 =(Efg 0 (w T x)g ): (4) We also approximate using the current value of w instead of w 0. Thus we obtain the following approximative Newton iteration: w + = w [C 1 Efxg(w T x)g w]=[efg 0 (w T x)g ] (5) where w + denotes the new value of w, p = Efw T xg(w T x)g. After every step, w + is normalized by dividing it by (w + ) T Cw + to improve stability. This algorithm can be further algebraically simplied (see [8]) to obtain the original form of the xed-point algorithm [7]: w + = C 1 Efxg(w T x)g Efg 0 (w T x)gw: (6) 3

4 These two forms are equivalent. Note that for prewhitened data, C 1 disappears, giving an extremely simple form of the Newton iteration. In [9], this learning rule (for kurtosis only) was derived as a xed-point iteration of a neural learning rule; hence the name of the algorithm. To use the xed-point algorithm for several units, the iteration in (5) is applied separately for the weight vector of each unit. Let us assume, as usual in ML estimation, that the number of independent components to be estimated equals the number of observed variables, i.e. n = m and A is square. Denote by W the matrix whose columns are the weight vectors: W = (w 1 ; :::; w n ). Furthermore, to avoid the inversion of the covariance matrix, we can approximate it as C 1 WW T, since C = AA T and W T is an estimate of A. Thus we obtain the following novel form of the xed-point algorithm: W + = W + W[Efyg(y T )g diag( i )]D (7) where y = W T x, i = Efy i g(y i )g, and D = diag(1=( i Efg 0 (y i )g)). After every iteration of (7), the outputs y i are decorrelated and normalized to unit variance; simple decorrelation algorithms that require neither matrix inversion nor eigen-value decomposition are given in [7, 8]. Note that for prewhitened data, this form is still equivalent to the original (generalized) xed-point algorithm in [7]. 3 The Fixed-point Algorithm as Maximum Likelihood Estimation The connection between (7) and the maximum likelihood algorithm is made obscure by dierences in notation. We used here (and in previous papers) the convention y = W T x whereas in the context of maximum likelihood estimation, one denes y = Wx, without transpose. Let us denote V = W T, and express (7) in the notation used in [1, 2, 3, 4]; we get V + = V + D[diag( i ) + Efg(y)y T g]v: (8) 4

5 This is to be compared with the form of the stochastic gradient method for maximizing likelihood: V + = V + [I + g(y)y T ]V: (9) where is the learning rate, not necessarily constant in time. If g is the true score function, i.e. the derivative of the log-likelihood of the independent components (assumed to be identically distributed for simplicity), we have i = 1; i = 1; ::; n. Thus it is seen that the xed-point algorithm in Eq. (8) or (7) is essentially a batch version of the ML stochastic gradient method in (9), with the following dierences: 1. In (8), an optimal step size is used. It is given separately for each row of V by the elements in D. 2. Replacing I by diag( i ) is also benecial for convergence speed. Though these expressions are equal when the nonlinearity is the true score function of the independent components, in practice they are at least slightly dierent. This is equivalent using rescaled version of the nonlinearity g. 3. In the xed-point algorithm, the outputs y i are decorrelated and normalized to unit variance after every step. No such operations are needed in the gradient descent rule. The xed-point algorithm in (8) is not stable if these additional operations are omitted. 4. The xed-point algorithm can estimate both sub- and super-gaussian independent components. The reason is clear from (8): The matrix D contains estimates on the nature (sub- or super-gaussian) of the independent components. Such estimates are implicit in the simple form given in (6). For the gradient descent algorithm, the nature of the independent components has to estimated separately, as in the so-called 'extended' ICA algorithms [11]. This results suggests also how to construct a hybrid learning rule that maximizes the likelihood without constraints, yet converging faster in batch mode 5

6 than simple gradient descent. This is obtained by introducing a step size coef- cient in (7): V + = V + D[diag( i ) + Efg(y)y T g]v: (10) Taking a suciently small (e.g. 0.1), this algorithm is stable without additional decorrelation or normalization. This algorithm maximizes likelihood almost exactly; if diag( i ) is further replaced by the identity matrix, it maximizes likelihood exactly. It is assumed here that the non-linearity is chosen as a good approximation of the score function, as usual in maximum likelihood estimation. Prewhitening of the data greatly improves the stability of (10). It is to be expected that (10) has faster convergence than the ordinary gradient descent rule because the step size is adapted separately for each component, as a function of the pdf's of the independent components. Moreover, the replacement of the identity matrix by the diagonal matrix in (10) should further improve convergence speed. 4 Conclusion It was shown that the xed-point algorithm for ICA [7, 8, 9] can be interpreted as maximizing the likelihood of the parameters of the ICA data model under the constraint of decorrelation, which is equivalent to maximizing the information ow in a neural network [2, 13]. Modications of the xed-point algorithm give hybrids of gradient descent and xed-point methods, and maximize the likelihood exactly. It is thus seen that the dierence between the xed-point algorithm and the (stochastic) gradient method for maximizing likelihood [1, 2, 3, 4] is not so much in the objective function as in the method of optimization. The xed-point algorithm provides a very fast method for maximization of likelihood in batch (or block) mode; it has been found in simulations to be 10{100 times faster than gradient methods [9]. The stochastic gradient methods maximizing likelihood, on the other hand, provide a simple adaptive learning rule that may also be biologically more plausible. 6

7 As a spin-o of these mathematical developments, we proposed a new version of the xed-point algorithm that requires neither prewhitening nor matrix inversion. References [1] S.-I. Amari. Neural learning in structured parameter spaces natural riemannian gradient. In Advances in Neural Information Processing 9 (Proc. NIPS*96), pages 127{133. MIT Press, Cambridge, MA, [2] A.J. Bell and T.J. Sejnowski. An information-maximization approach to blind separation and blind deconvolution. Neural Computation, 7:1129{ 1159, [3] J. F. Cardoso. Entropic contrasts for source separation. In S. Haykin, editor, Adaptive Unsupervised Learning, in press. [4] A. Cichocki and R. Unbehauen. Robust neural networks with on-line learning for blind identication and blind separation of sources. IEEE Trans. on Circuits and Systems, 43(11):894{906, [5] P. Comon. Independent component analysis { a new concept? Signal Processing, 36:287{314, [6] P.J. Huber. Projection pursuit. The Annals of Statistics, 13(2):435{475, [7] A. Hyvarinen. A family of xed-point algorithms for independent component analysis. In Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP'97), pages 3917{3920, Munich, Germany, [8] A. Hyvarinen. Fast and robust xed-point algorithms for independent component analysis. IEEE Trans. on Neural Networks, in press. [9] A. Hyvarinen and E. Oja. A fast xed-point algorithm for independent component analysis. Neural Computation, 9(7):1483{1492,

8 [10] C. Jutten and J. Herault. Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture. Signal Processing, 24:1{10, [11] T.-W. Lee, M. Girolami, and T. J. Sejnowski. Independent component analysis using an extended infomax algorithm for mixed sub-gaussian and super-gaussian sources. Neural Computation, 11:609{633, [12] D. G. Luenberger. Optimization by Vector Space Methods. John Wiley & Sons, [13] J.-P. Nadal and N. Parga. Non-linear neurons in the low noise limit: a factorial code maximizes information transfer. Network, 5:565{581,

### ACENTRAL problem in neural-network research, as well

626 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 3, MAY 1999 Fast and Robust Fixed-Point Algorithms for Independent Component Analysis Aapo Hyvärinen Abstract Independent component analysis (ICA)

### One-unit Learning Rules for Independent Component Analysis

One-unit Learning Rules for Independent Component Analysis Aapo Hyvarinen and Erkki Oja Helsinki University of Technology Laboratory of Computer and Information Science Rakentajanaukio 2 C, FIN-02150 Espoo,

### Natural Gradient Learning for Over- and Under-Complete Bases in ICA

NOTE Communicated by Jean-François Cardoso Natural Gradient Learning for Over- and Under-Complete Bases in ICA Shun-ichi Amari RIKEN Brain Science Institute, Wako-shi, Hirosawa, Saitama 351-01, Japan Independent

### Independent Component Analysis

A Short Introduction to Independent Component Analysis Aapo Hyvärinen Helsinki Institute for Information Technology and Depts of Computer Science and Psychology University of Helsinki Problem of blind

### TWO METHODS FOR ESTIMATING OVERCOMPLETE INDEPENDENT COMPONENT BASES. Mika Inki and Aapo Hyvärinen

TWO METHODS FOR ESTIMATING OVERCOMPLETE INDEPENDENT COMPONENT BASES Mika Inki and Aapo Hyvärinen Neural Networks Research Centre Helsinki University of Technology P.O. Box 54, FIN-215 HUT, Finland ABSTRACT

### Non-Euclidean Independent Component Analysis and Oja's Learning

Non-Euclidean Independent Component Analysis and Oja's Learning M. Lange 1, M. Biehl 2, and T. Villmann 1 1- University of Appl. Sciences Mittweida - Dept. of Mathematics Mittweida, Saxonia - Germany 2-

### Independent Component Analysis and Blind Source Separation

Independent Component Analysis and Blind Source Separation Aapo Hyvärinen University of Helsinki and Helsinki Institute of Information Technology 1 Blind source separation Four source signals : 1.5 2 3

### Estimation of linear non-gaussian acyclic models for latent factors

Estimation of linear non-gaussian acyclic models for latent factors Shohei Shimizu a Patrik O. Hoyer b Aapo Hyvärinen b,c a The Institute of Scientific and Industrial Research, Osaka University Mihogaoka

### Independent component analysis: algorithms and applications

PERGAMON Neural Networks 13 (2000) 411 430 Invited article Independent component analysis: algorithms and applications A. Hyvärinen, E. Oja* Neural Networks Research Centre, Helsinki University of Technology,

### Non-Euclidean Independent Component Analysis and Oja's Learning Lange, M.; Biehl, Michael; Villmann, T.

University of Groningen Non-Euclidean Independent Component Analysis and Oja's Learning Lange, M.; Biehl, Michael; Villmann, T. Published in: Proc. 21st Europ. Symp. Artificial Neural Networks (ESANN)

### To appear in Proceedings of the ICA'99, Aussois, France, A 2 R mn is an unknown mixture matrix of full rank, v(t) is the vector of noises. The

To appear in Proceedings of the ICA'99, Aussois, France, 1999 1 NATURAL GRADIENT APPROACH TO BLIND SEPARATION OF OVER- AND UNDER-COMPLETE MIXTURES L.-Q. Zhang, S. Amari and A. Cichocki Brain-style Information

### Independent Component Analysis

Independent Component Analysis James V. Stone November 4, 24 Sheffield University, Sheffield, UK Keywords: independent component analysis, independence, blind source separation, projection pursuit, complexity

### ON SOME EXTENSIONS OF THE NATURAL GRADIENT ALGORITHM. Brain Science Institute, RIKEN, Wako-shi, Saitama , Japan

ON SOME EXTENSIONS OF THE NATURAL GRADIENT ALGORITHM Pando Georgiev a, Andrzej Cichocki b and Shun-ichi Amari c Brain Science Institute, RIKEN, Wako-shi, Saitama 351-01, Japan a On leave from the Sofia

### Independent Component Analysis and Its Applications. By Qing Xue, 10/15/2004

Independent Component Analysis and Its Applications By Qing Xue, 10/15/2004 Outline Motivation of ICA Applications of ICA Principles of ICA estimation Algorithms for ICA Extensions of basic ICA framework

### MULTICHANNEL BLIND SEPARATION AND. Scott C. Douglas 1, Andrzej Cichocki 2, and Shun-ichi Amari 2

MULTICHANNEL BLIND SEPARATION AND DECONVOLUTION OF SOURCES WITH ARBITRARY DISTRIBUTIONS Scott C. Douglas 1, Andrzej Cichoci, and Shun-ichi Amari 1 Department of Electrical Engineering, University of Utah

### Independent Component Analysis

A Short Introduction to Independent Component Analysis with Some Recent Advances Aapo Hyvärinen Dept of Computer Science Dept of Mathematics and Statistics University of Helsinki Problem of blind source

### Independent Component Analysis. Contents

Contents Preface xvii 1 Introduction 1 1.1 Linear representation of multivariate data 1 1.1.1 The general statistical setting 1 1.1.2 Dimension reduction methods 2 1.1.3 Independence as a guiding principle

### CIFAR Lectures: Non-Gaussian statistics and natural images

CIFAR Lectures: Non-Gaussian statistics and natural images Dept of Computer Science University of Helsinki, Finland Outline Part I: Theory of ICA Definition and difference to PCA Importance of non-gaussianity

### Speed and Accuracy Enhancement of Linear ICA Techniques Using Rational Nonlinear Functions

Speed and Accuracy Enhancement of Linear ICA Techniques Using Rational Nonlinear Functions Petr Tichavský 1, Zbyněk Koldovský 1,2, and Erkki Oja 3 1 Institute of Information Theory and Automation, Pod

### Fundamentals of Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Independent Vector Analysis (IVA)

Fundamentals of Principal Component Analysis (PCA),, and Independent Vector Analysis (IVA) Dr Mohsen Naqvi Lecturer in Signal and Information Processing, School of Electrical and Electronic Engineering,

### Gatsby Theoretical Neuroscience Lectures: Non-Gaussian statistics and natural images Parts I-II

Gatsby Theoretical Neuroscience Lectures: Non-Gaussian statistics and natural images Parts I-II Gatsby Unit University College London 27 Feb 2017 Outline Part I: Theory of ICA Definition and difference

### Blind Extraction of Singularly Mixed Source Signals

IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL 11, NO 6, NOVEMBER 2000 1413 Blind Extraction of Singularly Mixed Source Signals Yuanqing Li, Jun Wang, Senior Member, IEEE, and Jacek M Zurada, Fellow, IEEE Abstract

### A Constrained EM Algorithm for Independent Component Analysis

LETTER Communicated by Hagai Attias A Constrained EM Algorithm for Independent Component Analysis Max Welling Markus Weber California Institute of Technology, Pasadena, CA 91125, U.S.A. We introduce a

### New Approximations of Differential Entropy for Independent Component Analysis and Projection Pursuit

New Approximations of Differential Entropy for Independent Component Analysis and Projection Pursuit Aapo Hyvarinen Helsinki University of Technology Laboratory of Computer and Information Science P.O.

### A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels Fernando Rojas, Jordi Solé-Casals, Enric Monte-Moreno 3, Carlos G. Puntonet and Alberto Prieto Computer Architecture and Technology

### SPARSE REPRESENTATION AND BLIND DECONVOLUTION OF DYNAMICAL SYSTEMS. Liqing Zhang and Andrzej Cichocki

SPARSE REPRESENTATON AND BLND DECONVOLUTON OF DYNAMCAL SYSTEMS Liqing Zhang and Andrzej Cichocki Lab for Advanced Brain Signal Processing RKEN Brain Science nstitute Wako shi, Saitama, 351-198, apan zha,cia

### Lecture'12:' SSMs;'Independent'Component'Analysis;' Canonical'Correla;on'Analysis'

Lecture'12:' SSMs;'Independent'Component'Analysis;' Canonical'Correla;on'Analysis' Lester'Mackey' May'7,'2014' ' Stats'306B:'Unsupervised'Learning' Beyond'linearity'in'state'space'modeling' Credit:'Alex'Simma'

### On Information Maximization and Blind Signal Deconvolution

On Information Maximization and Blind Signal Deconvolution A Röbel Technical University of Berlin, Institute of Communication Sciences email: roebel@kgwtu-berlinde Abstract: In the following paper we investigate

### Recursive Generalized Eigendecomposition for Independent Component Analysis

Recursive Generalized Eigendecomposition for Independent Component Analysis Umut Ozertem 1, Deniz Erdogmus 1,, ian Lan 1 CSEE Department, OGI, Oregon Health & Science University, Portland, OR, USA. {ozertemu,deniz}@csee.ogi.edu

### Estimating Overcomplete Independent Component Bases for Image Windows

Journal of Mathematical Imaging and Vision 17: 139 152, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. Estimating Overcomplete Independent Component Bases for Image Windows AAPO

### An Improved Cumulant Based Method for Independent Component Analysis

An Improved Cumulant Based Method for Independent Component Analysis Tobias Blaschke and Laurenz Wiskott Institute for Theoretical Biology Humboldt University Berlin Invalidenstraße 43 D - 0 5 Berlin Germany

### Distinguishing Causes from Effects using Nonlinear Acyclic Causal Models

JMLR Workshop and Conference Proceedings 6:17 164 NIPS 28 workshop on causality Distinguishing Causes from Effects using Nonlinear Acyclic Causal Models Kun Zhang Dept of Computer Science and HIIT University

### Emergence of Phase- and Shift-Invariant Features by Decomposition of Natural Images into Independent Feature Subspaces

LETTER Communicated by Bartlett Mel Emergence of Phase- and Shift-Invariant Features by Decomposition of Natural Images into Independent Feature Subspaces Aapo Hyvärinen Patrik Hoyer Helsinki University

### PROPERTIES OF THE EMPIRICAL CHARACTERISTIC FUNCTION AND ITS APPLICATION TO TESTING FOR INDEPENDENCE. Noboru Murata

' / PROPERTIES OF THE EMPIRICAL CHARACTERISTIC FUNCTION AND ITS APPLICATION TO TESTING FOR INDEPENDENCE Noboru Murata Waseda University Department of Electrical Electronics and Computer Engineering 3--

### BLIND SEPARATION OF INSTANTANEOUS MIXTURES OF NON STATIONARY SOURCES

BLIND SEPARATION OF INSTANTANEOUS MIXTURES OF NON STATIONARY SOURCES Dinh-Tuan Pham Laboratoire de Modélisation et Calcul URA 397, CNRS/UJF/INPG BP 53X, 38041 Grenoble cédex, France Dinh-Tuan.Pham@imag.fr

### Distinguishing Causes from Effects using Nonlinear Acyclic Causal Models

Distinguishing Causes from Effects using Nonlinear Acyclic Causal Models Kun Zhang Dept of Computer Science and HIIT University of Helsinki 14 Helsinki, Finland kun.zhang@cs.helsinki.fi Aapo Hyvärinen

### ADAPTIVE LATERAL INHIBITION FOR NON-NEGATIVE ICA. Mark Plumbley

Submitteed to the International Conference on Independent Component Analysis and Blind Signal Separation (ICA2) ADAPTIVE LATERAL INHIBITION FOR NON-NEGATIVE ICA Mark Plumbley Audio & Music Lab Department

### ICA [6] ICA) [7, 8] ICA ICA ICA [9, 10] J-F. Cardoso. [13] Matlab ICA. Comon[3], Amari & Cardoso[4] ICA ICA

16 1 (Independent Component Analysis: ICA) 198 9 ICA ICA ICA 1 ICA 198 Jutten Herault Comon[3], Amari & Cardoso[4] ICA Comon (PCA) projection persuit projection persuit ICA ICA ICA 1 [1] [] ICA ICA EEG

### Blind separation of sources that have spatiotemporal variance dependencies

Blind separation of sources that have spatiotemporal variance dependencies Aapo Hyvärinen a b Jarmo Hurri a a Neural Networks Research Centre, Helsinki University of Technology, Finland b Helsinki Institute

### ICA. Independent Component Analysis. Zakariás Mátyás

ICA Independent Component Analysis Zakariás Mátyás Contents Definitions Introduction History Algorithms Code Uses of ICA Definitions ICA Miture Separation Signals typical signals Multivariate statistics

### Blind Machine Separation Te-Won Lee

Blind Machine Separation Te-Won Lee University of California, San Diego Institute for Neural Computation Blind Machine Separation Problem we want to solve: Single microphone blind source separation & deconvolution

### Undercomplete Independent Component. Analysis for Signal Separation and. Dimension Reduction. Category: Algorithms and Architectures.

Undercomplete Independent Component Analysis for Signal Separation and Dimension Reduction John Porrill and James V Stone Psychology Department, Sheeld University, Sheeld, S10 2UR, England. Tel: 0114 222

### Remaining energy on log scale Number of linear PCA components

NONLINEAR INDEPENDENT COMPONENT ANALYSIS USING ENSEMBLE LEARNING: EXPERIMENTS AND DISCUSSION Harri Lappalainen, Xavier Giannakopoulos, Antti Honkela, and Juha Karhunen Helsinki University of Technology,

### BLIND SEPARATION USING ABSOLUTE MOMENTS BASED ADAPTIVE ESTIMATING FUNCTION. Juha Karvanen and Visa Koivunen

BLIND SEPARATION USING ABSOLUTE MOMENTS BASED ADAPTIVE ESTIMATING UNCTION Juha Karvanen and Visa Koivunen Signal Processing Laboratory Helsinki University of Technology P.O. Box 3, IN-215 HUT, inland Tel.

### Blind Signal Separation: Statistical Principles

Blind Signal Separation: Statistical Principles JEAN-FRANÇOIS CARDOSO, MEMBER, IEEE Invited Paper Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array

### Independent Component Analysis

1 Independent Component Analysis Background paper: http://www-stat.stanford.edu/ hastie/papers/ica.pdf 2 ICA Problem X = AS where X is a random p-vector representing multivariate input measurements. S

### On the INFOMAX algorithm for blind signal separation

University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2000 On the INFOMAX algorithm for blind signal separation Jiangtao Xi

### NON-NEGATIVE SPARSE CODING

NON-NEGATIVE SPARSE CODING Patrik O. Hoyer Neural Networks Research Centre Helsinki University of Technology P.O. Box 9800, FIN-02015 HUT, Finland patrik.hoyer@hut.fi To appear in: Neural Networks for

### Connections between score matching, contrastive divergence, and pseudolikelihood for continuous-valued variables. Revised submission to IEEE TNN

Connections between score matching, contrastive divergence, and pseudolikelihood for continuous-valued variables Revised submission to IEEE TNN Aapo Hyvärinen Dept of Computer Science and HIIT University

### 1 Introduction Consider the following: given a cost function J (w) for the parameter vector w = [w1 w2 w n ] T, maximize J (w) (1) such that jjwjj = C

On Gradient Adaptation With Unit-Norm Constraints Scott C. Douglas 1, Shun-ichi Amari 2, and S.-Y. Kung 3 1 Department of Electrical Engineering, Southern Methodist University Dallas, Texas 75275 USA 2

### Massoud BABAIE-ZADEH. Blind Source Separation (BSS) and Independent Componen Analysis (ICA) p.1/39

Blind Source Separation (BSS) and Independent Componen Analysis (ICA) Massoud BABAIE-ZADEH Blind Source Separation (BSS) and Independent Componen Analysis (ICA) p.1/39 Outline Part I Part II Introduction

### Independent Component Analysis of Incomplete Data

Independent Component Analysis of Incomplete Data Max Welling Markus Weber California Institute of Technology 136-93 Pasadena, CA 91125 fwelling,rmwg@vision.caltech.edu Keywords: EM, Missing Data, ICA

### ORIENTED PCA AND BLIND SIGNAL SEPARATION

ORIENTED PCA AND BLIND SIGNAL SEPARATION K. I. Diamantaras Department of Informatics TEI of Thessaloniki Sindos 54101, Greece kdiamant@it.teithe.gr Th. Papadimitriou Department of Int. Economic Relat.

### NONLINEAR INDEPENDENT FACTOR ANALYSIS BY HIERARCHICAL MODELS

NONLINEAR INDEPENDENT FACTOR ANALYSIS BY HIERARCHICAL MODELS Harri Valpola, Tomas Östman and Juha Karhunen Helsinki University of Technology, Neural Networks Research Centre P.O. Box 5400, FIN-02015 HUT,

### ON-LINE BLIND SEPARATION OF NON-STATIONARY SIGNALS

Yugoslav Journal of Operations Research 5 (25), Number, 79-95 ON-LINE BLIND SEPARATION OF NON-STATIONARY SIGNALS Slavica TODOROVIĆ-ZARKULA EI Professional Electronics, Niš, bssmtod@eunet.yu Branimir TODOROVIĆ,

### POLYNOMIAL SINGULAR VALUES FOR NUMBER OF WIDEBAND SOURCES ESTIMATION AND PRINCIPAL COMPONENT ANALYSIS

POLYNOMIAL SINGULAR VALUES FOR NUMBER OF WIDEBAND SOURCES ESTIMATION AND PRINCIPAL COMPONENT ANALYSIS Russell H. Lambert RF and Advanced Mixed Signal Unit Broadcom Pasadena, CA USA russ@broadcom.com Marcel

### Different Estimation Methods for the Basic Independent Component Analysis Model

Washington University in St. Louis Washington University Open Scholarship Arts & Sciences Electronic Theses and Dissertations Arts & Sciences Winter 12-2018 Different Estimation Methods for the Basic Independent

### MINIMIZATION-PROJECTION (MP) APPROACH FOR BLIND SOURCE SEPARATION IN DIFFERENT MIXING MODELS

MINIMIZATION-PROJECTION (MP) APPROACH FOR BLIND SOURCE SEPARATION IN DIFFERENT MIXING MODELS Massoud Babaie-Zadeh ;2, Christian Jutten, Kambiz Nayebi 2 Institut National Polytechnique de Grenoble (INPG),

### Natural Image Statistics

Natural Image Statistics A probabilistic approach to modelling early visual processing in the cortex Dept of Computer Science Early visual processing LGN V1 retina From the eye to the primary visual cortex

### x x2 H11 H y y2 H22 H

.5.5 5 5.5.5 5 5 2 3 4 5 6 7 H 2 3 4 5 6 7 H2 5 5 x 5 5 x2.5.5.5.5.5.5.5.5 2 3 4 5 6 7 H2 2 3 4 5 6 7 H22.5.5 y.5.5 y2 Figure : Mixing coef.: H [k], H 2 [k], H 2 [k], H 22 [k]. Figure 3: Observations and

### Using Kernel PCA for Initialisation of Variational Bayesian Nonlinear Blind Source Separation Method

Using Kernel PCA for Initialisation of Variational Bayesian Nonlinear Blind Source Separation Method Antti Honkela 1, Stefan Harmeling 2, Leo Lundqvist 1, and Harri Valpola 1 1 Helsinki University of Technology,

### BLIND SEPARATION OF INSTANTANEOUS MIXTURES OF NON STATIONARY SOURCES

BLIND SEPARATION OF INSTANTANEOUS MIXTURES OF NON STATIONARY SOURCES Dinh-Tuan Pham Laboratoire de Modélisation et Calcul URA 397, CNRS/UJF/INPG BP 53X, 38041 Grenoble cédex, France Dinh-Tuan.Pham@imag.fr

### neural units that learn through an information-theoretic-based criterion.

Submitted to: Network: Comput. Neural Syst. Entropy Optimization by the PFANN Network: Application to Blind Source Separation Simone Fiori Dept. of Electronics and Automatics { University of Ancona, Italy

### DETECTING PROCESS STATE CHANGES BY NONLINEAR BLIND SOURCE SEPARATION. Alexandre Iline, Harri Valpola and Erkki Oja

DETECTING PROCESS STATE CHANGES BY NONLINEAR BLIND SOURCE SEPARATION Alexandre Iline, Harri Valpola and Erkki Oja Laboratory of Computer and Information Science Helsinki University of Technology P.O.Box

### Figure 1: The original signals

Independent Component Analysis: A Tutorial Aapo Hyv rinen and Erkki Oja Helsinki University of Technology Laboratory of Computer and Information Science P.O. Box 5400, FIN-02015 Espoo, Finland aapo.hyvarinen@hut.fi,

### Independent Component Analysis (ICA)

Independent Component Analysis (ICA) Université catholique de Louvain (Belgium) Machine Learning Group http://www.dice.ucl ucl.ac.be/.ac.be/mlg/ 1 Overview Uncorrelation vs Independence Blind source separation

### Analytical solution of the blind source separation problem using derivatives

Analytical solution of the blind source separation problem using derivatives Sebastien Lagrange 1,2, Luc Jaulin 2, Vincent Vigneron 1, and Christian Jutten 1 1 Laboratoire Images et Signaux, Institut National

### Error Empirical error. Generalization error. Time (number of iteration)

Submitted to Neural Networks. Dynamics of Batch Learning in Multilayer Networks { Overrealizability and Overtraining { Kenji Fukumizu The Institute of Physical and Chemical Research (RIKEN) E-mail: fuku@brain.riken.go.jp

### Learning features by contrasting natural images with noise

Learning features by contrasting natural images with noise Michael Gutmann 1 and Aapo Hyvärinen 12 1 Dept. of Computer Science and HIIT, University of Helsinki, P.O. Box 68, FIN-00014 University of Helsinki,

### c Springer, Reprinted with permission.

Zhijian Yuan and Erkki Oja. A FastICA Algorithm for Non-negative Independent Component Analysis. In Puntonet, Carlos G.; Prieto, Alberto (Eds.), Proceedings of the Fifth International Symposium on Independent

### Blind separation of instantaneous mixtures of dependent sources

Blind separation of instantaneous mixtures of dependent sources Marc Castella and Pierre Comon GET/INT, UMR-CNRS 7, 9 rue Charles Fourier, 9 Évry Cedex, France marc.castella@int-evry.fr, CNRS, I3S, UMR

### A two-layer ICA-like model estimated by Score Matching

A two-layer ICA-like model estimated by Score Matching Urs Köster and Aapo Hyvärinen University of Helsinki and Helsinki Institute for Information Technology Abstract. Capturing regularities in high-dimensional

### Blind channel deconvolution of real world signals using source separation techniques

Blind channel deconvolution of real world signals using source separation techniques Jordi Solé-Casals 1, Enric Monte-Moreno 2 1 Signal Processing Group, University of Vic, Sagrada Família 7, 08500, Vic

### File: ica tutorial2.tex. James V Stone and John Porrill, Psychology Department, Sheeld University, Tel: Fax:

File: ica tutorial2.tex Independent Component Analysis and Projection Pursuit: A Tutorial Introduction James V Stone and John Porrill, Psychology Department, Sheeld University, Sheeld, S 2UR, England.

### Blind signal processing algorithms

12th Int. Workshop on Systems, Signals & Image Processing, 22-24 September 2005, Chalkida, Greece 105 Blind signal processing algorithms Athanasios Margaris and Efthimios Kotsialos Department of Applied

### Chapter 6 Effective Blind Source Separation Based on the Adam Algorithm

Chapter 6 Effective Blind Source Separation Based on the Adam Algorithm Michele Scarpiniti, Simone Scardapane, Danilo Comminiello, Raffaele Parisi and Aurelio Uncini Abstract In this paper, we derive a

### x 1 (t) Spectrogram t s

A METHOD OF ICA IN TIME-FREQUENCY DOMAIN Shiro Ikeda PRESTO, JST Hirosawa 2-, Wako, 35-98, Japan Shiro.Ikeda@brain.riken.go.jp Noboru Murata RIKEN BSI Hirosawa 2-, Wako, 35-98, Japan Noboru.Murata@brain.riken.go.jp

### An Ensemble Learning Approach to Nonlinear Dynamic Blind Source Separation Using State-Space Models

An Ensemble Learning Approach to Nonlinear Dynamic Blind Source Separation Using State-Space Models Harri Valpola, Antti Honkela, and Juha Karhunen Neural Networks Research Centre, Helsinki University

### NONLINEAR BLIND SOURCE SEPARATION USING KERNEL FEATURE SPACES.

NONLINEAR BLIND SOURCE SEPARATION USING KERNEL FEATURE SPACES Stefan Harmeling 1, Andreas Ziehe 1, Motoaki Kawanabe 1, Benjamin Blankertz 1, Klaus-Robert Müller 1, 1 GMD FIRST.IDA, Kekuléstr. 7, 1489 Berlin,

### Independent Component Analysis

Independent Component Analysis Seungjin Choi Department of Computer Science Pohang University of Science and Technology, Korea seungjin@postech.ac.kr March 4, 2009 1 / 78 Outline Theory and Preliminaries

### Independent Component Analysis (ICA)

Independent Component Analysis (ICA) Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr

### CONTROL SYSTEMS ANALYSIS VIA BLIND SOURCE DECONVOLUTION. Kenji Sugimoto and Yoshito Kikkawa

CONTROL SYSTEMS ANALYSIS VIA LIND SOURCE DECONVOLUTION Kenji Sugimoto and Yoshito Kikkawa Nara Institute of Science and Technology Graduate School of Information Science 896-5 Takayama-cho, Ikoma-city,

### Independent Component Analysis Using an Extended Infomax Algorithm for Mixed Subgaussian and Supergaussian Sources

LETTER Communicated by Jean-François Cardoso Independent Component Analysis Using an Extended Infomax Algorithm for Mixed Subgaussian and Supergaussian Sources Te-Won Lee Howard Hughes Medical Institute,

### Robust extraction of specific signals with temporal structure

Robust extraction of specific signals with temporal structure Zhi-Lin Zhang, Zhang Yi Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science

### Neural Network Training

Neural Network Training Sargur Srihari Topics in Network Training 0. Neural network parameters Probabilistic problem formulation Specifying the activation and error functions for Regression Binary classification

### Markovian Source Separation

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 12, DECEMBER 2003 3009 Markovian Source Separation Shahram Hosseini, Christian Jutten, Associate Member, IEEE, and Dinh Tuan Pham, Member, IEEE Abstract

### INDEPENDENT COMPONENT ANALYSIS

INDEPENDENT COMPONENT ANALYSIS A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor of Technology in Electronics and Communication Engineering Department By P. SHIVA

### Post-Nonlinear Blind Extraction in the Presence of Ill-Conditioned Mixing Wai Yie Leong and Danilo P. Mandic, Senior Member, IEEE

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 55, NO. 9, OCTOBER 2008 2631 Post-Nonlinear Blind Extraction in the Presence of Ill-Conditioned Mixing Wai Yie Leong and Danilo P. Mandic,

### Independent Component Analysis on the Basis of Helmholtz Machine

Independent Component Analysis on the Basis of Helmholtz Machine Masashi OHATA *1 ohatama@bmc.riken.go.jp Toshiharu MUKAI *1 tosh@bmc.riken.go.jp Kiyotoshi MATSUOKA *2 matsuoka@brain.kyutech.ac.jp *1 Biologically

### ARTEFACT DETECTION IN ASTROPHYSICAL IMAGE DATA USING INDEPENDENT COMPONENT ANALYSIS. Maria Funaro, Erkki Oja, and Harri Valpola

ARTEFACT DETECTION IN ASTROPHYSICAL IMAGE DATA USING INDEPENDENT COMPONENT ANALYSIS Maria Funaro, Erkki Oja, and Harri Valpola Neural Networks Research Centre, Helsinki University of Technology P.O.Box

### Short-Time ICA for Blind Separation of Noisy Speech

Short-Time ICA for Blind Separation of Noisy Speech Jing Zhang, P.C. Ching Department of Electronic Engineering The Chinese University of Hong Kong, Hong Kong jzhang@ee.cuhk.edu.hk, pcching@ee.cuhk.edu.hk

### BLIND SEPARATION OF POSITIVE SOURCES USING NON-NEGATIVE PCA

BLIND SEPARATION OF POSITIVE SOURCES USING NON-NEGATIVE PCA Erkki Oja Neural Networks Research Centre Helsinki University of Technology P.O.Box 54, 215 HUT, Finland erkki.oja@hut.fi Mark Plumbley Department

### Independent Component Analysis (ICA) Bhaskar D Rao University of California, San Diego

Independent Component Analysis (ICA) Bhaskar D Rao University of California, San Diego Email: brao@ucsdedu References 1 Hyvarinen, A, Karhunen, J, & Oja, E (2004) Independent component analysis (Vol 46)

### Temporal Coherence, Natural Image Sequences, and the Visual Cortex

Temporal Coherence, Natural Image Sequences, and the Visual Cortex Jarmo Hurri and Aapo Hyvärinen Neural Networks Research Centre Helsinki University of Technology P.O.Box 9800, 02015 HUT, Finland {jarmo.hurri,aapo.hyvarinen}@hut.fi