• DocumentCode
    1833161
  • Title

    Model based voice decomposition method with time constraint

  • Author

    Muto, T. ; Sugiyama, M.

  • Author_Institution
    Graduate Sch. of Comput. Sci. & Eng., Univ. of Aizu, Fukushima, Japan
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    21
  • Lastpage
    26
  • Abstract
    This paper proposes a new voice decomposition method with time constraint. Speech recognition of mixture of two and more voices and sounds is still very difficult. The model-based voice decomposition method proposed in our previous study solves the above problem; however, the solution is of a local optimal problem and the given spectral sequence sometimes varies rapidly and is non-realistic behavior. A new decomposition method solves a global optimal problem and the given spectral sequence changes are milder due to the time continuity constraint. This paper formulates the decomposition problem as an optimal path searching in the time-frequency domain. As the result of evaluation experiments, the average decomposition distortion is 4.16 dB and about 0.92 dB improvement is achieved
  • Keywords
    spectral analysis; speech intelligibility; speech recognition; time-frequency analysis; decomposition distortion; global optimal problem; optimal path searching; spectral sequence; speech recognition; time constraint; time continuity constraint; time-frequency domain; voice decomposition; voice mixture; Acoustical engineering; Autocorrelation; Computer science; Hidden Markov models; Humans; Linear predictive coding; Microphone arrays; Spectrogram; Speech recognition; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia Signal Processing, 2001 IEEE Fourth Workshop on
  • Conference_Location
    Cannes
  • Print_ISBN
    0-7803-7025-2
  • Type

    conf

  • DOI
    10.1109/MMSP.2001.962705
  • Filename
    962705