160 likes | 314 Views
Parallelizing Dynamic Time Warping. +. Jieyi Hu. Costly. 25 Data Points. fun normalize(float acc) -> Int { return round(acc * 10) } // normalize(3.1415) = 31. Deep copy of queue (Sensor Data). Pre-defined Gestures Data. DTW. Similarity. Cost[i, j]. Cost[0, 0]. Cost[0, 1].
E N D
Parallelizing Dynamic Time Warping + Jieyi Hu
fun normalize(float acc) -> Int { return round(acc * 10) } // normalize(3.1415) = 31
Deep copy of queue (Sensor Data) Pre-defined Gestures Data DTW Similarity
Cost[i, j] Cost[0, 0] Cost[0, 1] Cost[1, 0] Cost[1, 1]
Deep copy of queue (Sensor Data) Pre-defined Gestures Data Cost[0] Cost[1] Cost[2] Cost[3] TH[0] TH[1] TH[2] TH[3] S[0] S[1] S[2] S[3] S[k] = (TH[k] - Cost[k]) if Cost[k] <= TH[k] else 0
Cost[i, j] Cost[0, 0] Cost[0, 1] Cost[1, 0] Cost[1, 1]