Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 842))

  • 1515 Accesses

Abstract

Blind signal processing (BSS) is a fairly new and generally applicable technique. A very intuitive and important principle for the BSS problem is to maximize/minimize non-Gaussianity. Gaussian moments are introduced here as a quantitative measure of non-Gaussianity for a random variable. A proper contrast function is presented correspondingly that has not asymptotic bias even in the noisy context. After maximization of the contrast function, an improved BSS algorithm is introduced correspondingly. Computer simulations demonstrate the efficiency of the proposed approach.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Similar content being viewed by others

References

  1. Cichocki, A., Amari, S.: Adaptive Blind Signal and Image Processing. Wiley, New York (2003)

    Google Scholar 

  2. Barros, A.K., Cichocki, A.: Extraction of specific signals with temporal structure. Neural Comput. 13(9), 1995–2003 (2001)

    Article  Google Scholar 

  3. Hyvärinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. Wiley, New York (2001)

    Book  Google Scholar 

  4. Hyvärinen, A.: A unifying model for blind separation of independent sources. Signal Process. 85, 1419–1427 (2005)

    Article  Google Scholar 

  5. Zhao, Y.J., Liu, B.Q., Wang, S.: A robust extraction algorithm for biomedical signals from noisy mixtures. Front. Comput. Sci. China 5(4), 387–394 (2011)

    Article  MathSciNet  Google Scholar 

  6. Leong, W.Y., Mandic, D.P.: Noisy component extraction (NoiCE). IEEE Trans. Circuits Syst. 57(3), 664–671 (2010)

    Article  MathSciNet  Google Scholar 

  7. Lu, W., Rajapakse, J.C.: ICA with reference. Neurocomputing 69(16–18), 2244–2257 (2006)

    Article  Google Scholar 

  8. James, C.J., Hesse, C.W.: Independent component analysis for biomedical signals. Physiol. Meas. 26(1), 15–39 (2005)

    Article  Google Scholar 

  9. Liu, W., Mandic, D.P.: A normalized kurtosis-based algorithm for blind source extraction from noisy measurements. Signal Process. 86(7), 1580–1585 (2006)

    Article  Google Scholar 

  10. Yu, D., Peng, L.: When does inferring reputation probability countervail temptation in cooperative behaviors for the prisoners’ dilemma game? Chaos Solitons Fractals 78, 238–244 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This paper is partially supported by Shandong Provincial Natural Science Foundation, China (ZR2017MA046) and the National Science Foundation of China (11473019). The authors gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongjian Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, Y. (2019). Component Separation with Gaussian Moments. In: Abawajy, J., Choo, KK., Islam, R., Xu, Z., Atiquzzaman, M. (eds) International Conference on Applications and Techniques in Cyber Security and Intelligence ATCI 2018. ATCI 2018. Advances in Intelligent Systems and Computing, vol 842. Springer, Cham. https://doi.org/10.1007/978-3-319-98776-7_166

Download citation

Publish with us

Policies and ethics