Skip to main content

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

Included in the following conference series:

  • 3463 Accesses

Abstract

The blind separation of overdetermined mixtures, i.e., the case where more sensors than sources are available is considered in this paper. The contrast function for overdetermined blind source separation problem is presented, together with its gradient. An iterative method is proposed to solve the overdetermined blind source separation problem, where Gaussian mixture model is used to estimate the density of the unknown sources. The result of simulation demonstrates the efficiency of the proposed algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Comon, P., Jutten, C., Herault, J.: Blind separation of sources, part II: problems statement. Signal Processing 24(1), 11–20 (1991)

    Article  MATH  Google Scholar 

  2. Cichocki, A., Amari, S.: Adaptive Blind Signal and Image Processing: learning algorithms and applications. John Wiley and Sons, Chichester (2002)

    Book  Google Scholar 

  3. Joho, M., Mathis, H., Lambert, R.: Overdetermined blind source separation: Using more sensors than source signals in a noisy mixture. In: Proc. International Conference on Independent Component Analysis and Blind Signal Separation, Citeseer, pp. 81–86 (2000)

    Google Scholar 

  4. Zhang, L., Cichocki, A., Amari, S.: Natural gradient algorithm for blind separation of overdetermined mixture with additive noise. IEEE Signal Processing Letters 6(11), 293–295 (1999)

    Article  Google Scholar 

  5. Golub, G.H., Van Loan, C.F.: Matrix computations. Johns Hopkins Univ. Press, Baltimore (1996)

    MATH  Google Scholar 

  6. Zhu, X., Zhang, X., Ye, J.: A Generalized Contrast Function and Stability Analysis for Overdetermined Blind Separation of Instantaneous Mixtures. Neural Computation 18(3), 709–728 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Xue, Y., Wang, Y., Yang, J.: Independent component analysis based on gradient equation and kernel density estimation. Neurocomputing 72(7-9), 1597–1604 (2009)

    Article  Google Scholar 

  8. Duda, R., Hart, P., Stork, D.: Pattern Classification. Wiley-Interscience, Hoboken (2000)

    MATH  Google Scholar 

  9. The GMMBayes Toolbox, http://www2.it.lut.fi/project/gmmbayes

  10. Amari, S., Cichocki, A., Yang, H.H.: A new learning algorithm for blind signal separation. In: Touretzky, D.S., Mozer, M.C., Hasselmo, M.E. (eds.) Advances in Neural Information Processing Systems, vol. 8, pp. 757–763. MIT Press, Cambridge (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Xue, Y. (2012). Overdetermined Blind Source Separation by Gaussian Mixture Model. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25944-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25943-2

  • Online ISBN: 978-3-642-25944-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics