1 / 14

Parallelizing Dynamic Time Warping

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].

modesta
Télécharger la présentation

Parallelizing Dynamic Time Warping

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Parallelizing Dynamic Time Warping + Jieyi Hu

  2. Costly

  3. 25 Data Points

  4. fun normalize(float acc) -> Int { return round(acc * 10) } // normalize(3.1415) = 31

  5. Deep copy of queue (Sensor Data) Pre-defined Gestures Data DTW Similarity

  6. Cost[i, j] Cost[0, 0] Cost[0, 1] Cost[1, 0] Cost[1, 1]

  7. 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

  8. Cost[i, j] Cost[0, 0] Cost[0, 1] Cost[1, 0] Cost[1, 1]

  9. Thank you!

More Related