• DocumentCode
    1299125
  • Title

    Dynamic programming algorithm for optimal estimation of speech parameter contours

  • Author

    Ney, Hermann

  • Author_Institution
    Philips GmbH Forschungslab. Hamburg, Hamburg, West Germany
  • Issue
    2
  • fYear
    1983
  • Firstpage
    208
  • Lastpage
    214
  • Abstract
    A method for incorporating the requirement of smoothness into the estimation procedure for speech parameters is described. The traditional method of estimating a speech parameter, such as the fundamental period or a formant, is to determine the speech parameter separately for each time frame, usually by optimizing a suitable function of the speech signal. However, it is known a priori that adjacent speech parameters are strongly correlated, and that the overall contour of the parameter versus time must be a relatively smooth curve. An overall criterion of optimality for the contour of the speech parameter is introduced; the optimization problem is solved by means of dynamic programming. A recursive algorithm is obtained which does without statistical assumptions and is purely deterministic. The algorithm, although computationally expensive, can easily be implemented and has a tracking capability for on-line estimation.
  • Keywords
    Kalman filters; dynamic programming; parameter estimation; speech recognition; Kalman filters; dynamic programming; parameter estimation; speech parameter; speech recognition; Cost function; Dynamic programming; Estimation; Extraterrestrial measurements; Heuristic algorithms; Speech;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9472
  • Type

    jour

  • DOI
    10.1109/TSMC.1983.6313114
  • Filename
    6313114