Skip to main content

Penalty Function Approach for Constrained Convolutive Blind Source Separation

  • Conference paper
  • First Online:
Independent Component Analysis and Blind Signal Separation (ICA 2004)

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

Abstract

A new approach for convolutive blind source separation(BSS) using penalty functions is proposed in this paper. Motivated by nonlinear programming techniques for the constrained optimization problem, it converts the convolutive BSS into a joint diagonalization problem with unconstrained optimization. Theoretical analyses together with numerical evaluations reveal that the proposed method not only improves the separation performance by significantly reducing the effect of large errors within the elements of covariance matrices at low frequency bins and removes the degenerate solution induced by a null unmixing matrix, but also provides an unified framework to constrained BSS.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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, Chichester (2002)

    Book  Google Scholar 

  2. Smaragdis, P.: Blind separation of convolved mixtures in the frequency domain. Neurocomputing 22, 21–34 (1998)

    Article  Google Scholar 

  3. Rahbar, K., Reilly, J.: Blind source separation of convolved sources by joint approximate diagonalization of cross-spectral density matrices. In: Proc. ICASSP (May 2001)

    Google Scholar 

  4. Parra, L., Spence, C.: Convolutive blind source separation of nonstationary sources. In: IEEE Trans. on Speech and Audio Proc., May 2000, pp. 320–327 (2000)

    Google Scholar 

  5. Wang, W., Chambers, J.A., Sanei, S.: A joint diagonalization method for convolutive blind separation of nonstationary sources in the frequency domain. In: Proc. ICA, Nara, Japan (April 1-4, 2003)

    Google Scholar 

  6. Joho, M., Mathis, H.: Joint diagonalization of correlation matrices by using gradient methods with application to blind signal separation. In: Proc. SAM, Rosslyn, VA, August 4-6 (2002)

    Google Scholar 

  7. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Theory and Algorithms, 2nd edn. John Wiley & Sons Inc., Chichester (1993)

    MATH  Google Scholar 

  8. Murata, N., Ikeda, S., Ziehe, A.: An approach to blind source separation based on temporal structure of speech signals. Neurocomputing 41, 1–24 (2001)

    Article  Google Scholar 

  9. Cichocki, A., Unbehauen, R.: Neural Networks for Optimization and Signal Processing. Wiley, Chichester (1993)

    MATH  Google Scholar 

  10. Cichocki, A., Georgiev, P.: Blind source separation algorithms with matrix constraints. IEICE Trans. on Fundamentals of Elect. Comm. and Computer Science E86-A, 522–531 (2003)

    Google Scholar 

  11. Cardoso, J.-F., Laheld, B.: Equivariant adaptive source separation. IEEE Trans. Signal Processing 44, 3017–3030 (1996)

    Article  Google Scholar 

  12. Douglas, S.C., Amari, S., Kung, S.-Y.: On gradient adaptation with unit norm constraints. IEEE Trans. Signal Processing 48(6), 1843–1847 (2000)

    Article  Google Scholar 

  13. Douglas, S.C.: Self-stabilized gradient algorithms for blind source separation with orthogonality constraints. IEEE Trans. on Neural Networks 11(6), 1490–1497 (2000)

    Article  Google Scholar 

  14. Manton, J.H.: Optimisation algorithms exploiting unitary constraints. IEEE Trans. Signal Processing 50, 635–650 (2002)

    Article  MathSciNet  Google Scholar 

  15. Amari, S., Chen, T.P., Cichocki, A.: Nonholonomic orthogonal learning algorithms for blind source separation. Neural Computation 12, 1463–1484 (2000)

    Article  Google Scholar 

  16. Plumbley, M.D.: Algorithms for non-negative independent component analysis. IEEE Transactions on Neural Networks 14(3), 534–543 (2003)

    Article  Google Scholar 

  17. Parra, L., Alvino, C.: Geometric Source Separation: Merging convolutive source separation with geometric beamforming. IEEE Trans. on Speech and Audio Processing 10(6), 352–362 (2002)

    Article  Google Scholar 

  18. Lee, T.W., Bell, A.J., Lambert, R.: Blind separation of delayed and convolved sources. In: Advances in neural information processing systems 9, pp. 758–764. MIT Press, Cambridge (1997)

    Google Scholar 

  19. Anemüller, J.: http://medi.uni-oldenburg.de/members/ane

  20. Westner: http://www.media.mit.edu/~westner

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, W., Chambers, J.A., Sanei, S. (2004). Penalty Function Approach for Constrained Convolutive Blind Source Separation. In: Puntonet, C.G., Prieto, A. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2004. Lecture Notes in Computer Science, vol 3195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30110-3_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30110-3_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics