2006
DOI: 10.1007/s10851-006-0647-0
|View full text |Cite
|
Sign up to set email alerts
|

Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
77
0
1

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 136 publications
(78 citation statements)
references
References 28 publications
0
77
0
1
Order By: Relevance
“…The Fréchet distance (FD) takes the continuity of shapes into account and is a measure of the similarity between two curves. The Fréchet distance or the "dog-man" distance is the minimum length of a leash required to connect a dog and its owner, that walk on two separate curves, without backtracking along their ways [13]. Both of them may vary their speed, and even they can stop at an arbitrary location and for an unpredictable time, but they are not allowed to move backwards.…”
Section: Methods For Comparative Analysismentioning
confidence: 99%
“…The Fréchet distance (FD) takes the continuity of shapes into account and is a measure of the similarity between two curves. The Fréchet distance or the "dog-man" distance is the minimum length of a leash required to connect a dog and its owner, that walk on two separate curves, without backtracking along their ways [13]. Both of them may vary their speed, and even they can stop at an arbitrary location and for an unpredictable time, but they are not allowed to move backwards.…”
Section: Methods For Comparative Analysismentioning
confidence: 99%
“…DTW algorithm [4] has being proved to be extremely efficient for detecting similar shapes with different phases. Given two curves X = (x 1 ; x 2 ; ... …”
Section: Initial Mapping Constructing With Dynamic Time Warpingmentioning
confidence: 99%
“…One thing worth mentioning is that to ensure the mapping between 2 curves is diffeomorphic, we locally turbulent the result if two vertices i and i + 1 were mapped to one vertex j. For more detail about DTW algorithm we refer readers to [4]. …”
Section: Initial Mapping Constructing With Dynamic Time Warpingmentioning
confidence: 99%
“…Dynamic Time Warping (DTW) was initially introduced to recognize spoken words [7]. Since then it has been used and proved useful in different applications such as: handwriting recognition [6,8], signature verification [9][10][11][12], fingers print verification [13], face recognition [14,15], speech and gesture recognition [16], protein structure [17], gene expression [18,19], chromosome classification [20], object detection and classification [21,22], curve matching [23,24] control system [25], image and shape matching [24,26] database and data mining [27-29, 31, 32, 34-37), brain activity classification [38], voice control [39] and so on. The DTW algorithm uses a dynamic programming technique to align time series with a given template so that a total distance measure is minimized [25].…”
Section: Visiting Dynamic Time Warping Reviewmentioning
confidence: 99%