Evidence map›Paper›PMID 36146384›Full record

ArticleSensors (Basel, Switzerland)2022

AIS Trajectories Simplification Algorithm Considering Topographic Information.

Wonhee Lee, Sung-Won Cho

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Wonhee LeeMaritime Safety and Environmental Research Division, Korea Research Institute of Ships and Ocean Engineering, 32, Yuseong-daero 1312 beon-gil, Yuseong-gu, Daejeon 34103, Korea.ORCID 0000-0003-4318-5212
Sung-Won ChoMaritime Safety and Environmental Research Division, Korea Research Institute of Ships and Ocean Engineering, 32, Yuseong-daero 1312 beon-gil, Yuseong-gu, Daejeon 34103, Korea.ORCID 0000-0003-1470-5768

Funding

Ministry of Oceans and Fisheries 1525012040
6 · The paper itself

Abstract

With the development of maritime technology and equipment, most ships are equipped with an automatic identification system (AIS) to store navigation information. Over time, the size of the data increases, rendering its storage and processing difficult. Hence, it is necessary to transform the AIS data into trajectories, and then simplify the AIS trajectories to remove unnecessary information that is not related to route shape. Moreover, topographic information must be considered because otherwise, the simplified trajectory can intersect obstacles. In this study, we propose an AIS trajectory simplification algorithm considering topographic information. The proposed algorithm simplifies the trajectories without the intersection of the trajectory and obstacle using the improved Douglas-Peucker algorithm. Polygon map random (PMR) quadtree was used to consider topographic information on the coast, and the intersection between topographic information and simplified trajectories was efficiently computed using the PMR quadtree. To verify the effectiveness of the proposed algorithm, experiments were conducted on real-world trajectories in the Korean sea. The proposed algorithm yielded simplified trajectories with no intersections of the trajectory and obstacle. In addition, the computational efficiency of the proposed algorithm with the PMR quadtree was superior to that without the PMR quadtree.

Indexed as

AIS informationDouglas–Peucker algorithmPMR quadtreetopographic informationtrajectories simplification

Identifiers

PMID36146384
PMCPMC9505212

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.