DTW

Examples of Dynamic Programming with C++ and Matlab

In this tutorial, I will give you examples of using dynamic programming for solving the following problems: 1)Minimum number of coins for summing X.

  2)The most (least) costly path on a grid (dynamic time warping).

  3)Levenshtein edit distance.

  4)Seam Carving. I have written a tutorial on that […]

Examples of Dynamic Programming with C++ and Matlab Read More »

Dynamic Time Warping with Python

Dynamic Time Warping (DTW) is a method to align two sequences such that they have minimum distance. For instance, two trajectories that are very similar but one of them performed in a longer time. Here is an example of my code with python. Here is my ROS package with C++ for DTW.

Dynamic Time Warping with Python Read More »