An Average-Compress Algorithm for the Sample Mean Problem under Dynamic Time Warping.
Brijnesh J. JainVincent FroeseDavid SchultzPublished in: CoRR (2019)
Keyphrases
- dynamic time warping
- similarity measure
- dynamic programming
- distance measure
- optimal solution
- sequence matching
- computational complexity
- matching algorithm
- reinforcement learning
- objective function
- np hard
- word spotting
- lower bounding
- nearest neighbor classifier
- convex hull
- computer vision
- object recognition
- pattern recognition
- database systems