Skip to main content

Sparse Source Separation with Unknown Source Number

  • Conference paper
  • 2202 Accesses

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

Abstract

Sparse Blind Source Separation (BSS) problems have recently received some attention. And some of them have been proposed for the unknown number of sources. However, they only consider the overdetermined case (i.e. with more sources than sensors). In the practical BSS, there are not prior assumptions on the number of sources. In this paper, we use cluster and Principal Component Analysis (PCA) to estimate the number of the sources and the separation matrix, and then make the estimation of sources. Experiments with speech signals demonstrate the validity of the proposed method.

This is a preview of subscription content, log in via an institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jutten, C., Herault, J.: Blind separation of sources part I: An adaptive algorithm based on neuromimetic architecture. Signal Process 24(1), 1–10 (1991)

    Article  MATH  Google Scholar 

  2. Albera, L., Ferreol, A., Comon, P., Chevalier, P.: Blind identification of overcomplete mixtures of sources(BIOME). Linear Algebra Appl. 391, 3–30 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Naini, M.F., Mohimani, F.H., Babaie-Zadeh, M., Jutten, C.: Estimating the mixing matrix in Sparse Component Analysis based on partial k-dimensional subspace clustering. Neurocomputing 71, 2330–2343 (2008)

    Article  Google Scholar 

  4. Cichocki, A., Karhunen, J., Kasprzak, W., Vigario, R.: Neural networks for blind separation with unknown number of sources. Neurocomputing 24(1), 55–93 (1999)

    Article  MATH  Google Scholar 

  5. Lewicki, M.S., Sejnowski, T.J.: Learning overcomplete representations. Neural Computation 12(2), 337–365 (2000)

    Article  Google Scholar 

  6. Xiao, M., Xie, S.L., Fu, Y.L.: Underdetermined blind source separation algorithm based on normal vector of hyperplane 34(2), 142–149 (2008)

    Google Scholar 

  7. Zibulevsky, M., Pearlmutter, B.A., Bofill, P., Kisilev, P.: Blind source separation by sparse decomposition. In: Independent Component Analysis: Principles and Practice. Cambridge Univ. Press, Cambridge (2001)

    Google Scholar 

  8. He, Z.S., Xie, S.L., Fu, Y.L.: Sparse representation and blind separation of overcomplete. Science in China Ser. E. Information Sciences 36(8), 864–879 (2006)

    Google Scholar 

  9. Babaie-Zadeh, M., Jutten, C., Mansour, A.: Sparse ICA via cluster-wise PCA. Neurocomputing 69, 1458–1466 (2006)

    Article  Google Scholar 

  10. Haykin, S.: Adaptive Filter Theory, 3rd edn. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Li, H., Qi, R. (2010). Sparse Source Separation with Unknown Source Number. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics