• DocumentCode
    1690938
  • Title

    Learning invariant features for speech separation

  • Author

    Kun Han ; DeLiang Wang

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA
  • fYear
    2013
  • Firstpage
    7492
  • Lastpage
    7496
  • Abstract
    Recent studies on speech separation show that the ideal binary mask (IBM) substantially improves speech intelligibility in noise. Supervised learning can be used to effectively estimate the IBM. However, supervised learning has trouble dealing with the situations where the probabilistic properties of the training data and the test data do not match, resulting in a challenging issue of generalization whereby the system trained under particular noise conditions may not generalize to new noise conditions. We propose to use a novel metric learning method to learn invariant speech features in the kernel space. As the learned features encode speech-related information that is robust to different noise types, the system is expected to generalize to unseen noise conditions. Evaluations show the advantage of the proposed approach over other speech separation systems.
  • Keywords
    information theory; learning (artificial intelligence); speech coding; speech intelligibility; ideal binary mask; learning invariant features; metric learning method; speech intelligibility; speech related information; speech separation; supervised learning; test data; training data; Feature extraction; Kernel; Measurement; Noise; Speech; Support vector machines; Training; Domain Adaptation; Kernel Learning; SVM; Speech Separation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on
  • Conference_Location
    Vancouver, BC
  • ISSN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.2013.6639119
  • Filename
    6639119