Fixed-point neural independent component analysis algorithms on the orthogonal group

Authors:
Simone Fiori
Affiliations:
Faculty of Engineering of the Perugia University, Terni Campus, Loc. Pentima Bassa 21, I-05100 Terni, Italy
Venue:
Future Generation Computer Systems
Year:
2006

Citing 8
Cited 3

An information-maximization approach to blind separation and blind deconvolution

Neural Computation
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications

Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
A Theory for Learning by Weight Flow on Stiefel-Grassman Manifold

Neural Computation
Super-exponential methods for blind deconvolution

IEEE Transactions on Information Theory
A theory for learning based on rigid bodies dynamics

IEEE Transactions on Neural Networks
Algorithms for nonnegative independent component analysis

IEEE Transactions on Neural Networks
Monotonic convergence of fixed-point algorithms for ICA

IEEE Transactions on Neural Networks
Fast fixed-point neural blind-deconvolution algorithm

IEEE Transactions on Neural Networks

Nonlinear Complex-Valued Extensions of Hebbian Learning: An Essay

Neural Computation
Geometrical methods for non-negative ICA: Manifolds, Lie groups and toral subalgebras

Neurocomputing
Application of modified ICA to secure communications in chaotic systems

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fixed-point algorithms for neural-network learning have gained increasing interest over recent years. In blind signal processing by neural systems, they normally appear in the literature as one-unit learning rules. The aim of the present short contribution is to introduce some fully-parallel (multi-unit) learning algorithms on the group of orthogonal matrices to be applied to independent component analysis.