Research Article
An Objective Approach to Identify Spectral Distinctiveness for Hearing Impairment
Algorithm 1
The dynamic time warping algorithm.
| Step 1. Initialization | | DTW(1, 1) = | | Path(1, 1) = (0, 0) | | For to | | DTW(, 1) = + DTW(, 1) | | Path(, 1) = (, 1) | | End For | | For to | | DTW(1, ) = + DTW(1, ) | | Path(1, ) = (1, ) | | End For | | Step 2. Iteration | | For to | | For to | | DTW | | Path | | End For | | End For | | Step 3. Backtracking and Termination | | The optimal (minimum) distance is DTW(, ). | | The optimal matching path H is found by simple backtracking from Path(, ). | | | | = (, ) | | While Do | | | | = Path | | End While |
|