Skip to main content

A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function

  • Conference paper
Independent Component Analysis and Signal Separation (ICA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4666))

Abstract

In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation of mixtures of independent, non-Gaussian, and proper complex-valued signals. Sufficient and necessary conditions for the local stability of the complex-circular FastICA algorithm for an arbitrary cost are provided. A local stability analysis shows that the algorithm based on the Huber M-estimator cost has behavior that is largely independent of the cost function’s threshold parameter for mixtures of non-Gaussian signals. Simulations demonstrate the ability of the proposed algorithm to separate mixtures of various complex-valued sources with performance that meets or exceeds that obtained by the FastICA algorithm using kurtosis-based and other contrast functions.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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. Bingham, E., Hyvarinen, A.: A fast fixed-point algorithm for independent component analysis of complex valued signals. Int J. Neural Systems 10(1), 1–8 (2000)

    Google Scholar 

  2. De Lathauwer, L., De Moor, B.: On the blind separation of non-circular sources. In: Proc. EUSIPCO-02, Toulouse, France (September 2002)

    Google Scholar 

  3. Novey, M., Adali, T.: ICA by maximization of nongaussianity using complex functions. In: Proc. IEEE Workshop Machine Learning for Signal Processing, Mystic, CT, September 2005, pp. 21–26. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  4. Eriksson, J., Koivunen, V.: Complex random vectors and ICA models: Identifiability, uniqueness and separability. IEEE Trans. Inform. Theory 52, 1017–1029 (2006)

    Article  MathSciNet  Google Scholar 

  5. Chao, J., Douglas, S.C.: A simple and robust fastICA algorithm using the Huber M-estimator cost function. In: Proc. IEEE Int. Conf. Acoust. Speech, Signal Processing, Toulouse, France, vol. 5, pp. 685–688 (May 2006)

    Google Scholar 

  6. Hyvärinen, A.: Fast and robust fixed-point algorithms for independent component analysis. IEEE Trans. Neural Networks 10, 626–634 (1999)

    Article  Google Scholar 

  7. Huber, P.: Robust Statistics. Wiley, New York (1981)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mike E. Davies Christopher J. James Samer A. Abdallah Mark D Plumbley

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chao, JC., Douglas, S.C. (2007). A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function. In: Davies, M.E., James, C.J., Abdallah, S.A., Plumbley, M.D. (eds) Independent Component Analysis and Signal Separation. ICA 2007. Lecture Notes in Computer Science, vol 4666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74494-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74494-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-74494-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics