paper-with-me

홈 › Papers

A Methodology to extract Geo-Referenced Standard Routes from AIS Data

2025-03-26 · Michela Corvino, Filippo Daffinà, Chiara Francalanci, Paolo Giacomazzi, Martina Magliani, Paolo Ravanelli, Torbjorn Stahl

Maritime AIS (Automatic Identification Systems) data serve as a valuable resource for studying vessel behavior. This study proposes a methodology to analyze route between maritime points of interest and extract geo-referenced standard routes, as maritime patterns of life, from raw AIS data. The underlying assumption is that ships adhere to consistent patterns when travelling in certain maritime areas due to geographical, environmental, or economic factors. Deviations from these patterns may be attributed to weather conditions, seasonality, or illicit activities. This enables maritime surveillance authorities to analyze the navigational behavior between ports, providing insights on vessel route patterns, possibly categorized by vessel characteristics (type, flag, or size). Our methodological process begins by segmenting AIS data into distinct routes using a finite state machine (FSM), which describes routes as seg-ments connecting pairs of points of interest. The extracted segments are ag-gregated based on their departure and destination ports and then modelled using iterative density-based clustering to connect these ports. The cluster-ing parameters are assigned manually to sample and then extended to the en-tire dataset using linear regression. Overall, the approach proposed in this paper is unsupervised and does not require any ground truth to be trained. The approach has been tested on data on the on a six-year AIS dataset cover-ing the Arctic region and the Europe, Middle East, North Africa areas. The total size of our dataset is 1.15 Tbytes. The approach has proved effective in extracting standard routes, with less than 5% outliers, mostly due to routes with either their departure or their destination port not included in the test areas.

📄 PDF Abstract BibTeX arXiv:2503.22734

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

AGIBench: A Multi-granularity, Multimodal, Human-referenced, Auto-scoring Benchmark for Large Language Models

2023-09-05 · Fei Tang, Wanling Gao, Luzhou Peng, Jianfeng Zhan

Large language models (LLMs) like ChatGPT have revealed amazing intelligence. How to evaluate the question-solving abilities of LLMs and their degrees of intelligence is a hot-spot but challenging issue. First, the quest…

BenchmarkingZero-Shot Learning

An RTK-SLAM Dataset for Absolute Accuracy Evaluation in GNSS-Degraded Environments

2026-04-08 · Wei Zhang, Vincent Ress, David Skuddis, Uwe Soergel 외 arxiv

RTK-SLAM systems integrate simultaneous localization and mapping (SLAM) with real-time kinematic (RTK) GNSS positioning, promising both relative consistency and globally referenced coordinates for efficient georeferenced…

Emoji Retrieval from Gibberish or Garbled Social Media Text: A Novel Methodology and A Case Study

2024-12-23 · Shuqi Cui, Nirmalya Thakur, Audrey Poon

Emojis are widely used across social media platforms but are often lost in noisy or garbled text, posing challenges for data analysis and machine learning. Conventional preprocessing approaches recommend removing such te…

Short Run Transit Route Planning Decision Support System Using a Deep Learning-Based Weighted Graph

2023-08-24 · Nadav Shalit, Michael Fire, Dima Kagan, Eran Ben-Elia

Public transport routing plays a crucial role in transit network design, ensuring a satisfactory level of service for passengers. However, current routing solutions rely on traditional operational research heuristics, wh…

An Initial Seed Selection Algorithm for K-means Clustering of Georeferenced Data to Improve Replicability of Cluster Assignments for Mapping Application

2016-04-17 · Fouad Khan

K-means is one of the most widely used clustering algorithms in various disciplines, especially for large datasets. However the method is known to be highly sensitive to initial seed selection of cluster centers. K-means…

AttributeClusteringComputational Efficiency