Charrelation matrix based ICA

Authors:
Alon Slapak;Arie Yeredor
Affiliations:
School of Electrical Engineering, Tel-Aviv University, Israel;School of Electrical Engineering, Tel-Aviv University, Israel
Venue:
LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
Year:
2012

Citing 6
Cited 0

A fast fixed-point algorithm for independent component analysis

Neural Computation
ICA using spacings estimates of entropy

The Journal of Machine Learning Research
"Weighting for more": Enhancing characteristic-function based ICA with asymptotically optimal weighting

Signal Processing
A blind source separation technique using second-order statistics

IEEE Transactions on Signal Processing
Blind separation of instantaneous mixtures of nonstationary sources

IEEE Transactions on Signal Processing
Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the CramÉr-Rao Lower Bound

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Charrelation matrices are a generalization of the covariance matrix, encompassing statistical information beyond second order while maintaining a convenient 2-dimensional structure. In the context of ICA, charrelation matrices-based separation was recently shown to potentially attain superior performance over commonly used methods. However, this approach is strongly dependent on proper selection of the parameters (termed processing-points) which parameterize the charrelation matrices. In this work we derive a data-driven criterion for proper selection of the set of processing-points. The proposed criterion uses the available mixtures samples to quantify the resulting separation errors' covariance matrix in terms of the processing points. Minimizing the trace of this matrix with respect to the processing points enables to optimize (asymptotically) the selection of these points, thereby yielding better separation results than other methods, as we demonstrate in simulation.