A general optimization framework for dynamic time war**
The goal of dynamic time war** is to transform or warp time in order to approximately align
two signals. We pose the choice of war** function as an optimization problem with several …
two signals. We pose the choice of war** function as an optimization problem with several …
Sparsification of the alignment path search space in dynamic time war**
S Soheily-Khah, PF Marteau - Applied Soft Computing, 2019 - Elsevier
Temporal data are naturally everywhere, especially in the digital era that sees the advent of
big data and internet of things. One major challenge that arises during temporal data …
big data and internet of things. One major challenge that arises during temporal data …
A flight maneuver recognition method based on multi-strategy affine canonical time war**
Z Wei, D Ding, H Zhou, Z Zhang, L ** on run-length encoded time series
Abstract Dynamic Time War** (DTW) is a well-known similarity measure for time series.
The standard dynamic programming approach to compute the DTW distance of two length-n …
The standard dynamic programming approach to compute the DTW distance of two length-n …
Binary dynamic time war** in linear time
W Kuszmaul - ar** distance (DTW) is a widely used distance measure between time
series $ x, y\in\Sigma^ n $. It was shown by Abboud, Backurs, and Williams that in the\emph …
series $ x, y\in\Sigma^ n $. It was shown by Abboud, Backurs, and Williams that in the\emph …
Pattern Matching Under Distance
In this work, we consider the problem of pattern matching under the dynamic time war**
(DTW) distance motivated by potential applications in the analysis of biological data …
(DTW) distance motivated by potential applications in the analysis of biological data …
A reduction of the dynamic time war** distance to the longest increasing subsequence length
Y Sakai, S Inenaga - 31st International Symposium on Algorithms …, 2020 - drops.dagstuhl.de
The similarity between a pair of time series, ie, sequences of indexed values in time order, is
often estimated by the dynamic time war** (DTW) distance, instead of any in the well …
often estimated by the dynamic time war** (DTW) distance, instead of any in the well …
On the post hoc explainability of optimized self-organizing reservoir network for action recognition
This work proposes a novel unsupervised self-organizing network, called the Self-
Organizing Convolutional Echo State Network (SO-ConvESN), for learning node centroids …
Organizing Convolutional Echo State Network (SO-ConvESN), for learning node centroids …
[PDF][PDF] A Reservoir Computing Approach for Human Gesture Recognition from Kinect Data.
This paper describes a novel approach for human gesture recognition from motion data
captured by a Kinect camera. The proposed method is based on encoding the temporal …
captured by a Kinect camera. The proposed method is based on encoding the temporal …
A faster reduction of the dynamic time war** distance to the longest increasing subsequence length
Y Sakai, S Inenaga - Algorithmica, 2022 - Springer
The similarity between a pair of time series, ie, sequences of indexed values in time order, is
often estimated by the dynamic time war** (DTW) distance, instead of any in the well …
often estimated by the dynamic time war** (DTW) distance, instead of any in the well …