Skip to main content

Solution of Permutation Problem in Frequency Domain ICA, Using Multivariate Probability Density Functions

  • Conference paper
Independent Component Analysis and Blind Signal Separation (ICA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3889))

Abstract

Conventional Independent Component Analysis (ICA) in frequency domain inherently causes the permutation problem. To solve the problem fundamentally, we propose a new framework for separation of the whole spectrograms instead of the conventional binwise separation. Under our framework, a measure of independence is calculated from the whole spectrograms, not individual frequency bins. For the calculation, we introduce some multivariate probability density functions (PDFs) which take a spectrum as arguments. To seek the unmixing matrix that makes spectrograms independent, we demonstrate a gradient-based algorithm using multivariate activation functions derived from the PDFs. Through experiments using real sound data, we have confirmed that our framework is effective to generate permutation-free unmixed results.

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. Smaragdis, P.: Blind separation of convolved mixtures in the frequency domain. Neurocomputating 10(2), 251–276 (1998)

    Google Scholar 

  2. Sawada, H., Mukai, R., Araki, S., Makino, S.: A Robust and Precise Method for Solving the Permutation Problem of Frequency-Domain Blind Source Separation. In: Proc. ICA 2003, pp. 505–510 (April 2003)

    Google Scholar 

  3. Mitianoudis, N., Davies, M.: Audio source separation of convolutive mixtures. Trans. Audio and Speech Processing 11(5), 489–497 (2003)

    Article  Google Scholar 

  4. Davies, M.: Mathematics in Signal Processing V. In: Audio Source Separation. Oxford University Press, Oxford (2002)

    Google Scholar 

  5. Amari, S., Cichocki, A., Yang, H.H.: A new learning algorithm for blind signal separation. In: Advances in Neural Information Processing Systems, vol. 8. MIT Press, Cambridge (1996)

    Google Scholar 

  6. http://www.quantlet.com/mdstat/scripts/mva/htmlbook/mvahtmlnode42.html

  7. Matsuoka, K., Nakashima, S.: Minimal distortion principle for blind source separation. In: Proc. ICA 2001, pp. 722–727 (December 2001)

    Google Scholar 

  8. http://sound.media.mit.edu/ica-bench/sources/

  9. Févotte, C., Gribonval, R., Vincent, E.: BSS EVAL Toolbox User Guide, IRISA Technical Report 1706, Rennes, France (April 2005), http://www.irisa.fr/metiss/bss_eval/

  10. http://www.cnl.salk.edu/~tewon/Blind/blind_audio.html

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

Hiroe, A. (2006). Solution of Permutation Problem in Frequency Domain ICA, Using Multivariate Probability Density Functions. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2006. Lecture Notes in Computer Science, vol 3889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679363_75

Download citation

  • DOI: https://doi.org/10.1007/11679363_75

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32631-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics