2017
DOI: 10.14778/3067421.3067432
|View full text |Cite
|
Sign up to set email alerts
|

One-pass error bounded trajectory simplification

Abstract: Nowadays, various sensors are collecting, storing and transmitting tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network band and computing resource. Line simplification (LS) algorithms are an effective approach to attacking this issue by compressing data points in a trajectory to a set of continuous line segments, and are commonly used in practice. However, existing LS algorithms are not sufficient for the needs of sensors in mobile devices. In this study, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(41 citation statements)
references
References 22 publications
0
41
0
Order By: Relevance
“…Various compression error bounds can be estimated via convex hulls formed by the box and the bounding lines around all points. Further, the one-pass, error-bounded algorithm suggested in [34] is based on a novel local distance checking method and involves several optimizations in order to achieve higher compression. It also introduced a more aggressive variant, which allows "patches" by interpolating new points when objects have sudden changes in their paths or relay updates intermittently.…”
Section: Trajectory Summarizationmentioning
confidence: 99%
“…Various compression error bounds can be estimated via convex hulls formed by the box and the bounding lines around all points. Further, the one-pass, error-bounded algorithm suggested in [34] is based on a novel local distance checking method and involves several optimizations in order to achieve higher compression. It also introduced a more aggressive variant, which allows "patches" by interpolating new points when objects have sudden changes in their paths or relay updates intermittently.…”
Section: Trajectory Summarizationmentioning
confidence: 99%
“…A bounded quadrant system suggested in [16] enables estimation of various error bounds for trajectory compression in ageing-aware fashion suitable for tracking devices of limited storage. The one-pass, error-bounded algorithm in [15] involves local distance checking and optimizations to achieve higher compression. Although such generic data reduction techniques [28] could be applied on streaming aircraft trajectories, they entirely lack support for mobility-annotated features in the retained samples.…”
Section: Related Workmentioning
confidence: 99%
“…Indeed, a large amount of raw positional updates may be suppressed, while only retaining locations that signify changes in actual motion patterns [15]. We opt to avoid costly trajectory simplification algorithms like [6] [7] operating in batch fashion, online techniques employing sliding windows [8], or safe area bounds for choosing samples [7], as well as more complex, error-bounded methods. Instead, emanating from the novel trajectory summarization framework introduced in [11] for online maritime surveillance, but significantly enhanced with additional noise filters, the Synopses Generator applies singlepass heuristics for achieving succinct, lightweight representation of trajectories.…”
Section: Synopses Generationmentioning
confidence: 99%