Skip to main content

Low Complexity Functions for Stationary Independent Component Mixtures

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2773))

  • 884 Accesses

Abstract

Obtaining a low complexity activation function and an online sub-block learning for non-gaussian mixtures are presented in this paper. The paper deals with independent component analysis with mutual information as a cost function. First, we propose a low complexity activation function for non-gaussian mixtures, and then an online sub-block learning for stationary mixture is introduced. The size of the sub-blocks is larger than the maximal frequency F max of the principal component of the original signals. Experimental results proved that the proposed activation function and the online sub-block learning method are more efficient in terms of computational complexity as well as in terms of learning ability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amari, S.-I., Cichocki, A., Yang, H.H.: A New Learning Algorithm for Blind Signal Separation, pp. 757–763. MIT Press, Cambridge (1996)

    Google Scholar 

  2. Cardoso, J.-F.: Infomax and Maximum Likelihood for Blind Source Separation. IEEE Signal Processing Letters 4(4), 112–114 (1997)

    Article  Google Scholar 

  3. Chinnasarn, K., Lursinsap, C.: Effects of Learning Parameters on Independent Component Analysis Learning Procedure. In: Proceedings of the 2nd International Conference on Intelligent Technologies, Bangkok/Thailand, pp. 312–316 (2001)

    Google Scholar 

  4. Cichocki, A., Amari, S.-I.: Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications. John Wiley & Sons, Ltd., Chichester (2002)

    Book  Google Scholar 

  5. Girolami, M.: An Alternative Perspective on Adaptive Indepndent Component Analysis Algorithms. Neural Computation 10(8), 201–215 (1998)

    Article  MathSciNet  Google Scholar 

  6. Haykin, S.: Neural Network a Comprehensive foundation, 2nd edn. Prentice Hall, Englewood Cliffs (1999)

    Google Scholar 

  7. Hyvarinen, A., Oja, E.: Independent Component analysis: algorithms and applications. Neural Networks 13, 411–430 (2000)

    Article  Google Scholar 

  8. Kwan, H.K.: Simple Sigmoid-like activation function suitable for digital hardware implementation. Electronics Letter 28(15), 1379–1380 (1992)

    Article  Google Scholar 

  9. Lee, T.-W., Girolami, M., Sejnowski, T.J.: Independent Component Analysis Using an Extended Informax Algorithm for Mixed Sub-Gaussian and Super- Gaussian Sources. Neural Computation 11(2), 409–433 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chinnasarn, K., Lursinsap, C., Palade, V. (2003). Low Complexity Functions for Stationary Independent Component Mixtures. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_90

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_90

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics