Skip to main content

An improved geometric overcomplete blind source separation algorithm

  • Conference paper
  • First Online:
Artificial Neural Nets Problem Solving Methods (IWANN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2687))

Included in the following conference series:

  • 567 Accesses

Abstract

In this paper, we generalize the efficient geometric ICA algorithm FastGeo to overcomplete settings with more sources than sensors. The solution to this underdetermined problem will be presented in a two step approach. With geometric ICA we get an efficient method for the step—matrix-recovery—while the second step—source-recovery— uses a maximum-likelihood 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 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. A. J. Bell and T.J. Sejnowski. An information-maximisation approach to blind separation and blind deconvolution. Neural Computation, 7:1129–1159, 1995.

    Article  Google Scholar 

  2. P. Bofill and M. Zibulevsky. Blind separation of more sources than mixtures using sparsity of their short-time fourier transform. Proc. of ICA 2000, pages 87–92, 2000.

    Google Scholar 

  3. P. Comon. Independent component analysis—a new concept? Signal Processing, 36:287–314, 1994.

    Article  MATH  Google Scholar 

  4. A. Hyvärinen and E. Oja. A fast fixed-point algorithm for independent component analysis. Neural Computation, 9:1483–1492, 1997.

    Article  Google Scholar 

  5. M. Lewicki and B.A. Olshausen. A probabilistic framework for the adaptation and comparison of image codes, 1999.

    Google Scholar 

  6. M.S. Lewicki and T.J. Sejnowski. Learning nonlinear overcomplete representations for efficient coding. In M.I. Jordan, M.J. Kearns, and S.A. Solla, editors, Advances in Neural Information Processing Systems, volume 10. The MIT Press, 1998.

    Google Scholar 

  7. C.G. Puntonet and A. Prieto. An adaptive geometrical procedure for blind separation of sources. Neural Processing Letters, 2, 1995.

    Google Scholar 

  8. F.J. Theis, A. Jung, C.G. Puntonet, and E.W. Lang. Linear geometric ICA: Fundamentals and algorithms. Neural Computation, 15:1–21, 2002.

    MATH  Google Scholar 

  9. F.J. Theis and E.W. Lang. Formalization of the two-step approach to overcomplete BSS. Proc. of SIP 2002, pages 207–212, 2002.

    Google Scholar 

  10. F.J. Theis and E.W. Lang. Geometric overcomplete ICA. Proc. of ESANN 2002, pages 217–223, 2002.

    Google Scholar 

  11. F.J. Theis, C.G. Puntonet, and E.W. Lang. A histogram-based overcomplete ICA algorithm. In ICA 2003 accepted, 2003.

    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

Theis, F.J., Puntonet, C.G., Lang, E.W. (2003). An improved geometric overcomplete blind source separation algorithm. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-44869-1_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40211-4

  • Online ISBN: 978-3-540-44869-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics