English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we proposed an improved Douglas-Peucker algorithm based on cumulative heading variation to improve the ship trajectory data compression algorithm. This method calculates the cumulative heading change of the post-point and the base point in turn based on the starting point of the route. If the cumulative heading change of the post-point is greater than the set threshold value, the point is stored in the feature point library. With this point as the new base point, the above calculation is repeated until the last point of the route. According to the obtained feature points, the route is divided into several sections, each section is separated by Douglas-Peucker algorithm. Compression is performed to obtain the final trajectory. This method can avoid the problems of trajectory compression caused by traditional Douglas-Peucker algorithm, such as crossing shoreline and dangerous area in inland river bend, and can better meet the needs of inland ship trajectory compression. Introduction In recent years, the data generated by the ship's automatic identification system has experienced explosive growth. These massive data include the ship's historical trajectory, which condenses the driver's empirical summary of the current navigation methods in the waters. Therefore, based on these data, it is possible to plan safe routes in complex water environments. However, the update interval of ship AIS data is short, usually from a few seconds to several minutes, and ships in inland waters are frequently navigating. Therefore, the amount of AIS data is very large. At the same time, in the process of analysis and mining of AIS data, too large AIS data will not only reduce the efficiency of query and calculation, but also cause local features of ship trajectory to be lost due to data redundancy. Therefore, the compression processing of ship trajectory data is particularly important [1]. Currently, the compression algorithm for the trajectory data is as follows. (1) Line segment based trajectory compression algorithm. This algorithm mainly includes the Douglas-Peucker algorithm and its improved algorithm [2,3,4]. These algorithms are simple and accurate, but will lose the curvature change feature points, and the compressed ship trajectory may cross the land. (2) Trajectory compression and segmentation based on network structure [5,6]. These algorithms are suitable for relatively stable trajectory data, but the ship trajectory data is variable, so the processing effect is not ideal. (3) Semantic-based trajectory compression processing [7,8]. Research in this area is mainly concentrated in the field of land transportation and pay attention to the "stay" information, while ignoring the characteristics of the ship's movement. Therefore, based on actual needs, this paper proposes an improved compression algorithm based on cumulative heading variation. The improved algorithm has a high compression ratio in the straight section of the inland river, and can better preserve the trajectory point of the ship at the inland river curve. Improved Algorithm Based on Cumulative Course Variation Ship trajectory data compression is a hotspot in the application of AIS data, and Douglas-Peukcer algorithm is a well-known classical algorithm for linear element simplification[9]. However, 445 Douglas-Peukcer algorithm has some limitations on ship trajectory compression, such as the loss of steering feature points during ship steering and the trajectory passing through land after compression[10]. In view of the above problems caused by the traditional Douglas-Peucker algorithm mentioned, we propose a compression improvement algorithm based on cumulative course variation. The improved algorithm can better preserve the turning point of the ship's route at the curve. By analyzing the route processed by the Douglas-Peucker compression algorithm, we find that the way points of the ship route in the straight segment are less. The route is in the deep water channel and is consistent with the actual situation, the compression effect is good as well.However, there is a phenomenon that the route intersects the boundary of the airworthy area at the corner, and in the actual navigation process, the way point of the ship's route at the curve should generally be taken more appropriately. Therefore, the improved algorithm of this paper is mainly to improve the route compression algorithm of the curved part of the channel. Many scholars are researching the improvement of Douglas-Peucker compression algorithm. Xiao-hong Liu[11] proposed the Douglas-Peucker algorithm based on the yaw angle limitation according to the angle change of the adjacent point connection. The basic ideas are as follows: (1) Using the angle measurement method, the feature points are taken out. The three adjacent points on the curve are sequentially taken in order, and the angle α of the line between adjacent points is calculated and compared with the threshold A. If α<A, the intermediate point is rounded off; otherwise, the intermediate point is recorded into the newly created feature point set P, the judgment of the last three points including the intermediate point is performed until the end point of the curve is judged. (2) Using the feature point set P, the curve is divided into several segments, and each segment is separately compressed by the Douglas-Peucker algorithm to obtain the final compression result. This method can reduce the angle of curvature by using the method of reducing the angle threshold, but the trajectory points of the initial route are more, the connection angle of the adjacent track points does not change much. If this is done, it will greatly reduce the compression ratio of the curve [10], so that the track points of the route are so many, far beyond the actual situation, and the compression effect is not achieved. Although the heading changes of the adjacent two route segments may be small, as the number of route segments increases, the heading changes will gradually appear. Based on this, this paper proposes an improved Douglas-Peucker compression algorithm based on cumulative heading variation. The basic idea of the improved algorithm is (see Figure 1): starting from the starting route segment and using the starting point as the base point, judging the heading change of the adjacent route segment. If the heading variation is greater than the set threshold, the two route segments will be The common point is set as the route feature point; If the course change amount is less than the set threshold value, the heading change amount of the next line segment and the starting line segment is determined until the heading change amount is greater than a set threshold. Then set the starting point of the current route segment as the route feature point, and set the point as the base point, repeat the above judgment until the route end point. Taking the route feature points as the boundary, the route is divided into several segments, and each segment is separately compressed by the Douglas-Peucker algorithm to obtain the final compression result. Set P0,P1,...Pn be the initial waypoints of the initial route, Set L1,L2,...Ln-1 be the route segments, Set α1,α2,...αn-1 be the headings of each route segment. The improvement steps can be divided into five followings: (1) Set the initial point P0 be the base point, P1 be the calculation point, the initial heading α1 as the reference heading, α2 as the calculated heading, and the cumulative heading change amount Δα=α2-α1;

Research on Ship Trajectory Compression Algorithm Based on Cumulative Heading Variation