Multiple Ornstein-Uhlenbeck Processes for Maritime Traffic Graph Representation

We propose an unsupervised procedure to automatically extract a graph-based model of commercial maritime traffic routes from historical Automatic Identification System (AIS) data. In the proposed representation, the main elements of maritime traffic patterns, such as maneuvering regions and sea-lanes, are represented, respectively, with graph vertices and edges. Vessel motion dynamics are defined by multiple Ornstein- Uhlenbeck (OU) processes with different long-run mean parameters, which in our approach can be estimated with a change detection procedure based on Page's test, aimed to reveal the spatial points representative of velocity changes. A density-based clustering algorithm (DBSCAN) is then applied to aggregate the detected changes into groups of similar elements and reject outliers. To validate the proposed graph-based representation of the maritime traffic, two performance criteria are tested against a real-world trajectory data set collected off the Iberian Coast and the English Channel. Results show the effectiveness of the proposed approach, which is suitable to be integrated at any level of a JDL system.