Closed hbredin closed 10 months ago
Try this...
from dtw.stepPattern import StepPattern, _c
asymmetric1 = StepPattern(_c(
1, 1, 0, -1,
1, 0, 0, 1,
2, 1, 1, -1,
2, 0, 0, 1,
), "N");
Hence
> print(asymmetric1)
Step pattern recursion:
g[i,j] = min(
g[i-1,j ] + d[i ,j ] ,
g[i-1,j-1] + d[i ,j ] ,
)
Normalization hint: N
Thanks a lot!
I'd like to build a step pattern similar to
asymmetricP0
but without the vertical move, like the image below:How would you recommend I do that?