| Technology Search |
|---|
| Your Cart | ||
|---|---|---|
|
| Customers | ||||||||
|---|---|---|---|---|---|---|---|---|
|
||||||||
Home 
Browse for Technologies Software Engineering/Physical Sciences Dynamic Time Warp (DTW) in Matlab - Academic
Browse for Technologies Software Engineering/Physical Sciences Dynamic Time Warp (DTW) in Matlab - Academic
 |
Dynamic Time Warp (DTW) in Matlab - Academic |
| Price: FREE |
|
One of the difficulties in speech recognition is that although different recordings of the same words may include more or less the same sounds in the same order, the precise timing - the durations of each subword within the word - will not match. As a result, efforts to recognize words by matching them to templates will give inaccurate results if there is no temporal alignment. Although it has been largely superseded by hidden Markov models, early speech recognizers used a dynamic-programming technique called Dynamic Time Warping (DTW) to accommodate differences in timing between sample words and templates. The basic principle is to allow a range of 'steps' in the space of (time frames in sample, time frames in template) and to find the path through that space that maximizes the local match between the aligned time frames, subject to the constraints implicit in the allowable steps. The total `similarity cost' found by this algorithm is a good indication of how well the sample and template match, which can be used to choose the best-matching template. |
|