A Lossless Compression Method of Road Network Trajectories
A lossless compression and trajectory technology, applied in the field of trajectory calculation, which can solve the problem that the trajectory cannot be completely restored.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0035] The present invention will be further described below in conjunction with specific examples.
[0036] 1. Compute the shortest path between any road segments:
[0037] For example figure 1 For each road segment in the road network, use the Dijkstra algorithm to calculate the shortest path length from this road segment to all other road segments in the road network, and calculate the shortest path table SP end .
[0038] The calculated shortest path table is as follows (1)
[0039]
[0040] Table 1)
[0041] 2. Add the first section of the sequence to the compression result, and cut off the longest shortest path from the head of the track: from the head of the track, divide a subsequence that is the longest and coincides with the shortest path. Specifically, the operation is as follows :
[0042] (a) From the head segment of the remaining trajectory e 15 start scanning, iee s for e 15 ;
[0043] (b) will e 15 Add to the tail of the compressed result track...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 