Multi-Channel Subspace Mapping Using an Information Maximization Criterion

Authors:
Ahmed Al-Ani;Mohamed Deriche
Affiliations:
School of Computer Science & Software Engineering, The University of Western Australia, 35 Stirling Highway, Crawley, Western Australia 6009, Australia;Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
Venue:
Multidimensional Systems and Signal Processing
Year:
2004

Citing 9
Cited 0

Self-Organization in a Perceptual Network

Computer
Original Contribution: Least mean square error reconstruction principle for self-organizing neural-nets

Neural Networks
An information-theoretic unsupervised learning algorithm for neural networks

An information-theoretic unsupervised learning algorithm for neural networks
Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
Generalizations of principal component analysis, optimization problems, and neural networks

Neural Networks
An information-maximization approach to blind separation and blind deconvolution

Neural Computation
A neural implementation of canonical correlation analysis

Neural Networks
Fast subspace tracking and neural network learning by a novelinformation criterion

IEEE Transactions on Signal Processing
Learning in linear neural networks: a survey

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.02

Visualization

Abstract

A new hybrid information maximization (HIM) algorithm is derived. This algorithm is able to perform subspace mapping of multi-channel signals, where the input (feature) vector for each of the channels is linearly transformed to an output vector. The algorithm is based on maximizing the mutual information (MI) between input and output sets for each of the channels, and between output sets across channels. Such formulation leads to a substantial redundancy reduction in the output sets, and the extraction of higher order features that exhibit coherence across time and/or space. In this paper, we develop the proposed algorithm and show that it combines efficiently the strengths of two well-known subspace mapping techniques, namely the principal component analysis (PCA) and the canonical correlation analysis (CCA). Unlike CCA, which is limited to two channels, the HIM algorithm can easily be extended to multiple channels. A number of simulations and real experiments are conducted to compare the performance of HIM to that of PCA and CCA.