2017
DOI: 10.1016/j.future.2016.09.019
|View full text |Cite
|
Sign up to set email alerts
|

An efficient online direction-preserving compression approach for trajectory streaming data

Abstract: Online trajectory compression is an important method of efficiently managing massive volumes of trajectory streaming data. Current online trajectory methods generally do not preserve direction information and lack high computing performance for the fast compression. Aiming to solve these problems, this paper first proposed an online direction-preserving simplification method for trajectory streaming data, online DPTS by modifying an offline direction-preserving trajectory simplification (DPTS) method. We furth… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 16 publications
0
16
0
Order By: Relevance
“…There is also quite a lot of work has been done to represent trajectory using less data [13], [15], [22], [30]. Trajectory compression algorithms can be roughly categorized into two groups, i.e., line-simplification-based and map-matching-based, according to the utilization of the road network [9], [16]. The latter group is more relevant to our work.…”
Section: B Trajectory Compressionmentioning
confidence: 99%
“…There is also quite a lot of work has been done to represent trajectory using less data [13], [15], [22], [30]. Trajectory compression algorithms can be roughly categorized into two groups, i.e., line-simplification-based and map-matching-based, according to the utilization of the road network [9], [16]. The latter group is more relevant to our work.…”
Section: B Trajectory Compressionmentioning
confidence: 99%
“…Long et al [20] proposed error measurement for direction preservation that calculates the angular delta before adding artificial arcs to a graph and using the (SP) approach to simplify the trajectory. A streaming version of [20], additionally, has been proposed in [21]. The latest one, the Sunshine algorithm [22], which is variant of the shortest path (SP) algorithm with additional requirements of sunshine duration error.…”
Section: Trajectory-simplification Problemmentioning
confidence: 99%
“…There are also a number of studies that compress trajectories from the aspect of direction preservation, and representative algorithms include those by Potamias et al (2006), Long et al (2013; 2015), Ke et al (2017), Wu et al (2017a) and Deng et al (2017). Potamias et al (2006) defined two safe areas where one is formed by the previous two practical points, the other is formed by the previous two sample points, and only points that are within both safe areas will be deleted.…”
Section: Trajectory Simplificationmentioning
confidence: 99%