2012
DOI: 10.1016/j.knosys.2011.04.015
|View full text |Cite
|
Sign up to set email alerts
|

Shape-based template matching for time series data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(26 citation statements)
references
References 25 publications
0
26
0
Order By: Relevance
“…So, the homographic transformation estimation can be performed using shape matching between these characters. Most of the methods proposed to match shapes are based on dynamic time warping algorithm [20], [21], [24]. These algorithms search through all probable matching answers and select the best one.…”
Section: Goal Oriented Homographic Transformation Estimationmentioning
confidence: 99%
“…So, the homographic transformation estimation can be performed using shape matching between these characters. Most of the methods proposed to match shapes are based on dynamic time warping algorithm [20], [21], [24]. These algorithms search through all probable matching answers and select the best one.…”
Section: Goal Oriented Homographic Transformation Estimationmentioning
confidence: 99%
“…The concept of template has been introduced to time series to detect specific patterns or shapes [18,19,40,41,48]. Frank et al [18] propose Geometric Template Matching (GeTeM) which uses time-delay embeddings for building models from segments of time series and compares the reconstructed dynamical systems in terms of their state space as well as their dynamics.…”
Section: Related Workmentioning
confidence: 99%
“…In [19], a novel and flexible approach is proposed based on segmental semi-Markov models. In [40,41,48], meaningful templates are constructed with shape-based averaging algorithms, such as Prioritized Shape Averaging (PSA) [40] and Accurate Shape Averaging (ASA) [48]. Wei et al propose the Atomic Wedgie method "that exploits the commonality among the predefined patterns to allow monitoring at higher bandwidths, while maintaining a guarantee of no false dismissals" [56].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper presents an effective approach based on DP algorithm and Lagrange multipliers to optimize the objective function. When calculating fuzzy cluster centers, this paper employs cubicspline DTW (CDTW) averaging function (Niennattrakul et al 2012). In addition, a DP-based technique is utilized to reduce the computational complexity.…”
Section: Introductionmentioning
confidence: 99%