Random pruning of blockwise stationary mixtures for online BSS

Authors:
Alessandro Adamo;Giuliano Grossi
Affiliations:
Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy
Venue:
LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Year:
2010

Citing 6
Cited 0

Blind separation of sources, Part 1: an adaptive algorithm based on neuromimetic architecture

Signal Processing
Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
A fast fixed-point algorithm for independent component analysis

Neural Computation
A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive processes

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Blind separation of piecewise stationary non-Gaussian sources

Signal Processing
Fast and robust fixed-point algorithms for independent component analysis

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore information redundancy of linearly mixed sources in order to accomplish the demixing task (BSS) by ICA techniques in real-time. Assuming piecewise stationarity of the sources, the idea is to prune uniformly and independently most of sample data while preserving the ability of Kurtosis-based algorithms to reconstruct the original sources using pruned mixtures instead of original ones. The mainstay of this method is to control the sub-mixtures size so that the Kurtosis is sharply concentrated about that of the entire mixtures with exponentially small error probabilities. Referring to the FastICA algorithm, it is shown that the dimensionality reduction proposed while assuring high quality of the source estimate yields to a significant reduction of the demixing time. In particular, it is experimentally shown that, in case of online applications, the pruning of blockwise stationary data is not only essential for guarantying the time-constraints keeping, but it is also effective.