Abstract

Vessel trajectory data are currently the most important data source for vessel trajectory data mining research. However, vessel AIS data have a short sampling time interval and a large amount of data redundancy, which hampers the efficient utilization of AIS data. In order to effectively remove redundant information from AIS data and improve its usage efficiency, a compression algorithm for vessel trajectory data compression algorithm considering critical region identification (VATDC_CCRI) is proposed. The VATDC_CCRI algorithm identifies the critical regions of a vessel’s trajectory by analyzing the distribution of node variation rates. It employs the Douglas–Peucker (DP) algorithm to compress the data in these critical regions, reducing the distortion of the trajectory after compression. Additionally, the algorithm utilizes a sliding window approach to process the initial trajectory to improve the quality of the compressed vessel trajectories and retain as many spatiotemporal characteristics of the original trajectories as possible. It combines the feature nodes from the crucial regions in the vessel’s trajectory with the results obtained from the sliding window algorithm, effectively compressing the vessel’s trajectory. Experiments conducted on individual and multiple trajectories demonstrate that the VATDC_CCRI algorithm achieves higher compression rates and exhibits faster processing speeds compared to other classical vessel trajectory compression algorithms while preserving the shape of the vessel’s trajectory significantly.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.