Proceedings 18th International Conference on Data Engineering
DOI: 10.1109/icde.2002.994784
|View full text |Cite
|
Sign up to set email alerts
|

Discovering similar multidimensional trajectories

Abstract: We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
796
0
5

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 1,004 publications
(804 citation statements)
references
References 29 publications
3
796
0
5
Order By: Relevance
“…Spatial transformations can also realign trajectories for better comparison. The Longest Common Substring (LCSS) approach does not consider the entire trajectory but instead finds similarities between substrings [25]. Edit Distance on Real Sequence (EDR), which measures the number of operations (insert, delete or replace) required to transform one trajectory to another, extends this by assigning penalties to the gaps between two matched sub-trajectories [26].…”
Section: Trajectory Similaritymentioning
confidence: 99%
“…Spatial transformations can also realign trajectories for better comparison. The Longest Common Substring (LCSS) approach does not consider the entire trajectory but instead finds similarities between substrings [25]. Edit Distance on Real Sequence (EDR), which measures the number of operations (insert, delete or replace) required to transform one trajectory to another, extends this by assigning penalties to the gaps between two matched sub-trajectories [26].…”
Section: Trajectory Similaritymentioning
confidence: 99%
“…Ref. [12] formalized a LCSS (Least Common Subsequence) distance, which assists the application of traditional clustering algorithms (e.g., partitioning, hierarchical, etc.) on object trajectories.…”
Section: Clustering Spatio-temporal Datamentioning
confidence: 99%
“…Other proposals compute the longest common subsequence of two series [19], and the least common sub-sequence of two series, and take these measures as the distance between trajectories [1].…”
Section: Related Workmentioning
confidence: 99%