Skip to main content

A Flexible Algorithm for Extracting Periodic Signals

  • Conference paper
Advances in Neural Networks - ISNN 2006 (ISNN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3972))

Included in the following conference series:

  • 71 Accesses

Abstract

In this paper, we propose a flexible two-stage algorithm for extracting desired periodic signals. In the first stage, if the period and phase information of the desired signal is available (or can be estimated), a minimum mean square error approach is used to coarsely recover the desired source signal. If only the period information is available (or can be estimated), a robust correlation based method is proposed to achieve the same goal. The second stage uses a higher-order statistics based Newton-like algorithm, derived from a constrained maximum likelihood criteria, to process the extracted noisy signal as cleanly as possible. A parameterized nonlinearity is adopted in this stage, adapted according to the estimated statistics of the desired signal. Compared with many existing extraction algorithms, the proposed algorithm has better performance, which is confirmed by simulations.

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. Cichocki, A., Amari, S.: Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications. John Wiley & Sons, New York (2002)

    Book  Google Scholar 

  2. Zhang, Z.-L., Yi, Z.: Robust Extraction of Specific Signals with Temporal Structure. Neurocomputing (accepted)

    Google Scholar 

  3. Zhang, Z.-L., Yi, Z.: Extraction of Temporally Correlated Sources with Its Application to Non-invasive Fetal Electrocardiogram Extraction. Neurocomputing (accepted)

    Google Scholar 

  4. Zhang, Z.-L., Zhang, L.: A Two-Stage Based Approach for Extracting Periodic Signals. In: Rosca, J.P., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds.) ICA 2006. LNCS, vol. 3889, pp. 303–310. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Barros, A.K., Vigário, R., Jousmäki, V., Ohnishi, N.: Extraction of Event-related Signals from Multichannel Bioelectrical Measurements. IEEE Trans. Biomedical Engineering 47(5), 583–588 (2000)

    Article  Google Scholar 

  6. Barros, A.K., Cichocki, A.: Extraction of Specific Signals with Temporal Structure. Neural Computation 13(9), 1995–2003 (2001)

    Article  MATH  Google Scholar 

  7. Lu, W., Rajapakse, J.C.: Approach and Applications of Constrained ICA. IEEE Trans. Neural Networks 16(1), 203–212 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, ZL., Meng, H. (2006). A Flexible Algorithm for Extracting Periodic Signals. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760023_101

Download citation

  • DOI: https://doi.org/10.1007/11760023_101

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34437-7

  • Online ISBN: 978-3-540-34438-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics