Skip to main content

Reducing Computational Complexity of Multichannel Nonnegative Matrix Factorization Using Initial Value Setting for Speech Recognition

  • Conference paper
  • First Online:
Complex, Intelligent, and Software Intensive Systems (CISIS 2018)

Abstract

In this paper, we propose efficient the number of computational iteration method of MNMF for speech recognition. The proposed method initializes estimates MNMF algorithm with the estimated spatial correlation matrix reduces the number of iteration of updates algorithm. The experiment result shows that our method reduced the computational complexity of MNMF.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Lee, D.D., et al.: Learning the parts of objects with nonnegative matrix factorization. Nature 401, 788–791 (1999)

    Article  Google Scholar 

  2. Sawada, H., et al.: Multichannel extensions of non-negative matrix factorization with complex-valued data. IEEE Trans. ASLP 21(5), 971–982 (2013)

    Google Scholar 

  3. Miura, I., et al.: Analysis of initial-value dependency in multichannel nonnegative matrix factorization for blind source separation and speech recognition. J. IEICE J100–D, 376–384 (2017)

    Google Scholar 

  4. Uramoto, T., et al.: Sequential initial value setting associated with increasing number of channels in multi-channel nonnegative matrix factorization In: ASJ, pp. 535–538 (2017)

    Google Scholar 

  5. Nakatani, T., et al.: NTT CHiME-3 speech recognition system: noise-robust frontend. In: ASJ, pp. 57–60 (2016)

    Google Scholar 

  6. Sawada, H., et al.: Underdetermined convolutive blind source separation via frequency bin-wise clustering and permutation alignment. IEEE Trans. Audio Speech Lang. Process. 19, 516–527 (2011)

    Article  Google Scholar 

  7. Ito, N., et al.: Relaxed disjointness based clustering for joint blind source separation and dereverberation. In: Proceedings of IWAENC, pp. 268–272 (2014)

    Google Scholar 

  8. Kitamura, D., et al.: Efficient multichannel nonnegative matrix factorization with rank-1 spatial model. In: ASJ, pp. 579–527 (2014)

    Google Scholar 

  9. Baker, J., et al.: An analysis of environment, microphone and data simulation mismatches in robust speech recognition. In: Proceedings of the 4th International Workshop on Speech Processing in Everyday Environments (CHiME 2016) (2016)

    Google Scholar 

  10. Miura, I., et al.: Spatial correlation matrix estimation method in initial value setting of multi-channel non-negative matrix factorization. In: ASJ, pp. 567–570 (2017)

    Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI grant numbers 16K00245 and 15H02728.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Taiki Izumi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Izumi, T. et al. (2019). Reducing Computational Complexity of Multichannel Nonnegative Matrix Factorization Using Initial Value Setting for Speech Recognition. In: Barolli, L., Javaid, N., Ikeda, M., Takizawa, M. (eds) Complex, Intelligent, and Software Intensive Systems. CISIS 2018. Advances in Intelligent Systems and Computing, vol 772. Springer, Cham. https://doi.org/10.1007/978-3-319-93659-8_82

Download citation

Publish with us

Policies and ethics