Independent factor analysis

被引:331
作者
Attias, H [1 ]
机构
[1] Univ Calif San Francisco, Sloan Ctr Theoret Neurobiol, San Francisco, CA 94143 USA
[2] Univ Calif San Francisco, WM Keck Fdn, Ctr Integrat Neurosci, San Francisco, CA 94143 USA
关键词
D O I
10.1162/089976699300016458
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce the independent factor analysis (IFA) method for recovering independent hidden sources from their observed mixtures. IFA generalizes and unifies ordinary factor analysis (FA), principal component analysis (PCA), and independent component analysis (ICA), and can handle not only square noiseless mixing but also the general case where the number of mixtures differs from the number of sources and the data are noisy. IFA is a two-step procedure. In the first step, the source densities, mixing matrix, and noise covariance are estimated from the observed data by maximum likelihood. For this purpose we present an expectation-maximization (EM) algorithm, which performs unsupervised learning of an associated probabilistic model of the mixing situation. Each source in our model is described by a mixture of gaussians; thus, all the probabilistic calculations can be performed analytically. In the second step, the sources are reconstructed from the observed data by an optimal nonlinear estimator. A variational approximation of this algorithm is derived for cases with a large number of sources, where the exact algorithm becomes intractable. Our IFA algorithm reduces to the one for ordinary FA when the sources become gaussian, and to an EM algorithm for PCA in the zero-noise limit. We derive an additional EM algorithm specifically for noiseless IFA. This algorithm is shown to be superior to ICA since it can learn arbitrary source densities from the data. Beyond blind separation, IFA can be used for modeling multidimensional data by a highly constrained mixture of gaussians and as a tool for nonlinear signal encoding.
引用
收藏
页码:803 / 851
页数:49
相关论文
共 43 条
[1]  
Amari S, 1996, ADV NEUR IN, V8, P757
[2]  
[Anonymous], NCRG97010 AST U
[3]  
[Anonymous], MAXIMUM LIKELIHOOD C
[4]  
[Anonymous], P ADV NEUR INF PROC
[5]  
Attias H, 1998, NEURAL COMPUT, V10, P1373, DOI 10.1162/neco.1998.10.6.1373
[6]   AN INFORMATION MAXIMIZATION APPROACH TO BLIND SEPARATION AND BLIND DECONVOLUTION [J].
BELL, AJ ;
SEJNOWSKI, TJ .
NEURAL COMPUTATION, 1995, 7 (06) :1129-1159
[7]  
Belouchrani A, 1994, P EUSIPCO, P768
[8]   GTM: The generative topographic mapping [J].
Bishop, CM ;
Svensen, M ;
Williams, CKI .
NEURAL COMPUTATION, 1998, 10 (01) :215-234
[9]   Infomax and maximum likelihood for blind source separation [J].
Cardoso, JF .
IEEE SIGNAL PROCESSING LETTERS, 1997, 4 (04) :112-114
[10]   Equivariant adaptive source separation [J].
Cardoso, JF ;
Laheld, BH .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1996, 44 (12) :3017-3030