Random Pruning of Blockwise Stationary Mixtures for Online BSS

  • Alessandro Adamo
  • Giuliano Grossi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6365)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amari, S., Cichocki, A.: Recurrent neural networks for blind separation of sources. In: Proceedings of International Symposium on Nonlinear Theory and Applications, vol. I, pp. 37–42 (1995)Google Scholar
  2. 2.
    Comon, P.: Independent component analysis - a new concept? Signal Processing 36, 287–314 (1994)MATHCrossRefGoogle Scholar
  3. 3.
    Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13–30 (1963)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Hyvärinen, A.: Fast and robust fixed-point algorithms for independent component analysis. IEEE Transactions on Neural Networks 10(3), 626–634 (1999)CrossRefGoogle Scholar
  5. 5.
    Hyvärinen, A., Oja, E.: A fast fixed-point algorithm for independent component analysis. Neural Computation 9, 1483–1492 (1997)CrossRefGoogle Scholar
  6. 6.
    Jutten, C., Herault, J.: Blind separation of sources, part i: An adaptive algorithm based on neuromimetic architecture. Signal Processing 24, 1–10 (1991)MATHCrossRefGoogle Scholar
  7. 7.
    Koldovský, Z., Málek, J., Tichavský, P., Deville, Y., Hosseini, S.: Blind separation of piecewise stationary non-gaussian sources. Signal Processing 89(12), 2570–2584 (2009)CrossRefGoogle Scholar
  8. 8.
    Tichavsky, P., Yeredor, A., Koldovsky, Z.: A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive processes. In: ICASSP 2009: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3133–3136. IEEE Computer Society, Los Alamitos (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alessandro Adamo
    • 1
  • Giuliano Grossi
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations