2003
DOI: 10.1007/978-3-540-39403-7_24
|View full text |Cite
|
Sign up to set email alerts
|

Similar Sub-trajectory Retrieval for Moving Objects in Spatio-temporal Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…This shows that if the spatiotemporal variable is considered, then T R C would have the most similar trajectory to T R A . This outcome differs from the similarity measures proposed by [2] and [11], which consider only the similarity between projected trajectories.…”
Section: Similarity Of Moving Object Trajectory On Road Networkmentioning
confidence: 62%
See 1 more Smart Citation
“…This shows that if the spatiotemporal variable is considered, then T R C would have the most similar trajectory to T R A . This outcome differs from the similarity measures proposed by [2] and [11], which consider only the similarity between projected trajectories.…”
Section: Similarity Of Moving Object Trajectory On Road Networkmentioning
confidence: 62%
“…However, since this method assumes Euclidean space, it is difficult to apply it to road network space. A similar method was proposed in [11] but has the same problem of Euclidean distance as [2].…”
Section: Related Workmentioning
confidence: 99%
“…Their approach uses the shape similarity between lines to retrieve required objects. Shim and Chang [7] considered the similarity of sub-trajectories and proposed a distance 'KWarping' algorithm. We also find similar approaches in Valachos et al [8]), Sakurai et al [10], and Chen et al [11].…”
Section: Related Workmentioning
confidence: 99%
“…They define a data model of trajectories as directed lines in a space, and the similarity between trajectories as the Euclidean distance between directed discrete lines and extraction of the individual moving patterns from each object from the trajectories considering both time and location. Reference [19] considered the similarity of sub-trajectories and proposed a 'K-warping' distance algorithm. Reference [14] focused on the spatial shapes and compared spatial shapes of moving object trajectories by developing algorithms for evaluating OWD (One Way Distance) in both continuous and discrete cases of the trajectories for similarity search.…”
Section: B Trajectory Similaritymentioning
confidence: 99%