Letters: Neurally plausible, non-combinatorial iterative independent process analysis

Authors:
András Lrincz;Zoltán Szabó
Affiliations:
Department of Information Systems, Eötvös Loránd University, Pázmány P. sétány 1/C, Budapest H-1117, Hungary;Department of Information Systems, Eötvös Loránd University, Pázmány P. sétány 1/C, Budapest H-1117, Hungary
Venue:
Neurocomputing
Year:
2007

Citing 6
Cited 2

An information-maximization approach to blind separation and blind deconvolution

Neural Computation
Sparse code shrinkage: denoising of nongaussian data by maximum likelihood estimation

Neural Computation
An EM method for spatio-temporal blind source separation using an AR-MOG source model

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Cross-Entropy optimization for independent process analysis

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Independent subspace analysis on innovations

ECML'05 Proceedings of the 16th European conference on Machine Learning
Dual multivariate auto-regressive modeling in state space for temporal signal separation

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

2009 Special Issue: Here and now: How time segments may become events in the hippocampus

Neural Networks
Autoregressive model of the hippocampal representation of events

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

It has been shown recently that the identification of mixed hidden independent auto-regressive processes (independent process analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to independent subspace analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to independent component analysis. Here, we introduce an iterative scheme and its neural network representation that takes advantage of the reduction method and can accomplish the IPA task. Computer simulation illustrates the working of the algorithm.