Next Article in Journal
Geodesic-Based Method for Improving Matching Efficiency of Underwater Terrain Matching Navigation
Previous Article in Journal
Field Deployment of a Portable Optical Spectrometer for Methane Fugitive Emissions Monitoring on Oil and Gas Well Pads
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Ship Spatiotemporal Key Feature Point Online Extraction Based on AIS Multi-Sensor Data Using an Improved Sliding Window Algorithm

1
Navigation College, Dalian Maritime University, Dalian 116026, China
2
Collaborative Innovation Research Institute of Autonomous Ship, Dalian Maritime University, Dalian 116026, China
3
Key Laboratory of Navigation Safety Guarantee of Liaoning Province, Dalian 116026, China
*
Author to whom correspondence should be addressed.
Sensors 2019, 19(12), 2706; https://doi.org/10.3390/s19122706
Submission received: 19 May 2019 / Revised: 9 June 2019 / Accepted: 14 June 2019 / Published: 16 June 2019
(This article belongs to the Section Intelligent Sensors)

Abstract

:
Large volumes of automatic identification system (AIS) data provide new ideas and methods for ship data mining and navigation behavior pattern analysis. However, large volumes of big data have low unit values, resulting in the need for large-scale computing, storage, and display. Learning efficiency is low and learning direction is blind and untargeted. Therefore, key feature point (KFP) extraction from the ship trajectory plays an important role in fields such as ship navigation behavior analysis and big data mining. In this paper, we propose a ship spatiotemporal KFP online extraction algorithm that is applied to AIS trajectory data. The sliding window algorithm is modified for application to ship navigation angle deviation, position deviation, and the spatiotemporal characteristics of AIS data. Next, in order to facilitate the subsequent use of the algorithm, a recommended threshold range for the corresponding two parameters is discussed. Finally, the performance of the proposed method is compared with that of the Douglas–Peucker (DP) algorithm to assess its feature extraction accuracy and operational efficiency. The results show that the proposed improved sliding window algorithm can be applied to rapidly and easily extract the KFPs from AIS trajectory data. This ability provides significant benefits for ship traffic flow and navigational behavior learning.

1. Introduction

According to the SOLAS (International Convention for Safety of Life at Sea) convention, since 2002, an increasing number of ships have been required to install automatic identification system (AIS) equipment onboard [1]. The basic framework of coastal AIS base stations has been developed over almost 10 years of constructing special frameworks for land-based stations worldwide. A large volume of AIS trajectory data has been accumulated owing to the increasing number of ship terminals, the high frequency of ship terminal information forecasts [2], and improved data collection. A large volume of data provides new ideas and methods for the effective application of AIS trajectory data for improving the safety and efficiency of maritime traffic [3,4], which has become an active research topic with the development of big data analysis techniques. However, the volume, velocity, variety, value, and veracity (5V) characteristics of big data are a double-edged sword; although big data can provide several new research directions and ideas, research on hardware devices and algorithms is a significant challenge. The massive volumes cause great difficulties in all aspects of data storage, transmission, analysis, calculation, display, etc. The low value of individuals causes the learning efficiency to decrease and the relevance to become poor. The variety of data and multi-dimensionality have higher requirements for algorithm complex. The high-velocity collection and data growth have higher requirements for algorithm processing efficiency. Therefore, the ship trajectory key feature point (KFP) online extraction from trajectory data plays an extremely important role in the study of the navigational behavior of ships. As shown in Figure 1, most of the research based on AIS big data is essentially conducted by means of KFPs, such as behavior prediction [5,6], clustering [7], data restoration [8], display [9], data mining [10], and machine learning theory [11].
The KFPs extraction can be the first step for AIS big data analysis and research, and the subsequent research can be directly carried out based on these KFPs. Hence, studying KFP extraction algorithms for AIS trajectory data has become an urgent requirement. Identifying representative points from the massive AIS trajectory and extracting KFPs is a pre-processing method for AIS data. Some AIS data points possess low value, and the original trajectory of the ship is not affected after their removal. The expression of the other part is crucial for the description of the trajectory features. Once the ship trajectory is removed, huge distortions can occur. The point where the value of such a trajectory is higher is defined as a KFP in this paper.
Most feature point extraction algorithms in this field focus on methods such as image, video, human face, point cloud, graphic boundary, and moving-object trajectory KFP extraction. Most of these methods are based on visual feature extraction. These studies rely on image information to study the ship trajectory, which can be extremely difficult and expensive because of the distance between a ship and land. It is difficult to clearly capture image data for using shore-based camera equipment. Such camera equipment is not mandatory on ships because it is highly costly and impractical to install. Notably, there are relatively few studies on feature extraction for ship navigational behavior that combine spatiotemporal characteristics.
Conventional KFP extraction algorithms can be classified into the following three types:
(a)
Image, human face, and facial feature extraction, which are commonly accomplished using neural networks [12], propagation filters [13], support vector machine (SVM) [14], etc.;
(b)
Point cloud feature extraction, which is commonly accomplished using Gaussian normal clustering [15], multi-scale tensor voting [16], etc.;
(c)
Line segment, moving object trajectory, and graphic boundary feature point extraction, which are commonly accomplished using a Kalman filter [17], trip frequency and accumulated distance [18], compression algorithms, etc.
Compression algorithms provide an extremely effective, simple, and fast processing method for the extraction of the KFPs of moving objects. Whether using a compression algorithm or feature extraction algorithm, the approach is essentially a system for evaluating the value of trajectory expression. The compression algorithm accomplishes compression by removing the points with low trajectory values in data. Feature extraction maintains the points with high trajectory values in data as the representative points of a trajectory, which are also the KFPs. The research related to compression algorithms includes the work by Jiang et al. [19], who obtained the trajectory characteristics of vehicles in images. Based on an algorithm for polygonal linear scanning calibration, considering the influence of the distortion of charge-coupled device (CCD) cameras, and introducing the center deviation factor, multi-region scanning calibration considering a center offset (MRSCCO) algorithm was proposed to transform the trajectory features of images into actual motion features. Wang et al. [20] proposed a novel fusion-based ship detection method from polarimetric synthetic aperture radar (Pol-SAR) images to extract the trajectory features of ships from polarimetric synthetic aperture radar images. Tu et al. [21] used the Hilbert transform (HT) and wavelet transform modulus maximum (WTMM) on the terahertz pulsed imaging (TPI) of ship coatings to extract structural features. Mi and Huang [22] constructed a new time series analysis model for network traffic time series data based on quantitative recursive feature extraction, in which the percentage of frequency characteristic points among the total points in a plane was calculated in a recursive figure plane, and the features of network traffic time-frequency entropy were extracted. Stefani et al. [23] proposed a new method for processing digitized radar images to extract ship features. Wang and Zeng [24] used a close-up camera to collect the images of moving vehicles, and the motion trajectories of vehicle feature points were obtained from successive images and converted into Cartesian coordinates to extract vehicle trajectories. Sang et al. [8] proposed three trajectory characteristics (line, curve, and arc), and five trajectory steps (line, curve, arc, curve, and line) during the turning section. Gerben et al. [11] proposed a piecewise linear segmentation (PLS) algorithm that could compress a trajectory into linear segments by recursively keeping the points that have a maximum error higher than a fixed threshold. Fu et al. [25] invoked reference points as well as PLS and applied a compression method based on the routing and movement features. Sheng et al [26] extracted 17 types of trajectory features based on the basic movement patterns and the sub-trajectory segments and divided the ship trajectory into three basic movement patterns (anchored-off pattern, turning pattern, and straight-sailing pattern). Many researchers (Zhu et al [10], Li et al [27], Zhang et al [9,28,29,30], Zhao et al [31,32], Mou et al [33], Ren et al [34]) have used the Douglas–Peucker (DP) algorithm for the pre-processing of AIS big data. However, this algorithm has high time complexity and it is time-consuming to run.
Furthermore, its operational complexity is extremely high, and thus, it can easily cause computer memory overflow, which is particularly unsuitable for large quantities of AIS data. Zhu and Sun [35] proposed a minimum bounding rectangle (MBR) GPS trajectory data compression algorithm. However, it was difficult to determine the number of discrete points included in a rectangle using this algorithm. Furthermore, the rectangle direction was not considered, and the point selection strategy became highly complex when the rectangular area was extremely large or extremely small. Dutta et al. [36] proposed a reservoir-sampling data compression algorithm. It does not consider the time sequence, spatial sequence, or the importance of other factors. As a result, it may generate errors. Yang et al. [37] proposed a finger vein region of interest (ROI) extraction method that is robust against finger displacement and rotation. A sliding window was used to detect phalangeal joints and to ascertain the height of the ROI for a corrected image.
Most algorithms use the Euclidean vertical distance for the selection criterion of trajectory KFPs, in which only the spatial position characteristics of a ship are considered. The time characteristics of the ship are only used as an index for sorting [38], and the spatiotemporal characteristics of ship AIS data are considered in even fewer cases. In recent years, the research on the mining of ship AIS data has slightly matured. However, the combination of spatiotemporal characteristics in ship trajectory data is rare. Otsuka et al. [39] considered the spatial arrangement of dominant contours, the uniformity of velocity components, and trajectory run length to extract the KFPs from a motion trajectory. Cao et al. [40] proposed the adoption of line simplification, which is a technique that is typically applied in computer graphics, to approximate and reduce spatiotemporal AIS data. Satoh et al. [41] proposed a method for recognizing the 3D shape of a moving object using active cameras and proposed a binocular motion tracking system by reconstructing the 3D shape of various moving objects. Sandu et al. [42] proposed an extended data model and a network partitioning algorithm using long paths to increase the compression rates for the same error bounds. In this study, we integrated these proposals with a state-of-the-art compression algorithm to obtain a new technique for compressing network trajectory data using deterministic error bounds.
Currently, analysis of spatiotemporal information is on the frontier of the research in the field of data mining. Ship AIS data are multi-sensor [43] data that include the position, time, ship navigation status, heading, and speed information of ships. Therefore, these datasets contain recorded ship static, dynamic, and navigational information for a variety of activities and provide an effective method of accurately identifying ship motion characteristics. This work combines the ship’s navigational behavior characteristics with the spatiotemporal characteristics of ship AIS data to improve the sliding window compression algorithm and extract a ship’s behavioral KFPs, thereby facilitating effective AIS trajectory data mining and providing a foundation for subsequent research on ship handling behavior and intelligent ship collision avoidance.

2. Feature Extraction Method

The development of big data analysis of AIS data has become popular owing to the completion of AIS infrastructure and the continued development of AIS technologies. Eventually, the order of magnitude of the data will be too large for computers to handle. This is the major disadvantage of offline feature extraction algorithms such as the DP algorithm, as they can only extract feature data that have been analyzed or stored. Furthermore, they depend on the end point to judge all points.
The sliding window has been widely used in deep learning in both convolutional and pooling layers. The receptive field of the sliding window in convolutional neural networks (CNNs) is a 3D box that achieves the goal of processing an entire large image by sliding the window. The receptive field of the sliding window in AIS trajectory extraction is a rectangle that always contains only three points and only judges whether the second point is retained as a feature point in the track at a certain time, as shown in Figure 2 [44,45]. Therefore, in this study, we propose an online sliding window feature extraction algorithm. In this study, we combined the principle of the compression algorithm, the ship navigation angle deviation, position deviation, and AIS spatiotemporal characteristics to improve the performance of the online sliding window KFP extraction algorithm.

2.1. Improved Sliding Window Algorithm Based on Spatiotemporal Characteristics

The ship navigation angle deviation is shown in Figure 3. According to the Markov chain [46], its value in future states is only related to the current state. Regardless of the previous state, the deviation in angle of the next point is determined according to the state of the previous point. Further enlargement studies show that the ship is no longer simplified as a point, considering the ship direction and heading in the plane. Most algorithms always use the Euclidean vertical distance for the selection criterion of trajectory KFPs, in which only the spatial position data of a ship are considered. The time information in AIS data is only used as an index for sorting, and the spatiotemporal characteristics of ship AIS data are considered in even fewer cases [47].
The feature extraction process is briefly described as follows: First, points P1 (L1, B1, T1), P2 (L2, B2, T2), and P3 (L3, B3, T3) are located in the initial window. Using time T2 of point P2 (L2, B2, T2) as an index, the difference S between P1 (L1, B1, T1) and P3 (L3, B3, T3) can be calculated as P2 (L2’, B2’, T2). If spatiotemporal distance S is less than the threshold, then the relative azimuth angle from P1 to P2 is calculated and named C1. The P1 course is referred to as C0. The difference Δ C between C1 and C0 must be less than the calculated angle threshold. If this condition is satisfied, P2 can be deleted. In this manner, feature extraction is accomplished. The improved sliding window algorithm is illustrated in Figure 4, Figure 5 and Figure 6.
These parameters are calculated as follows,
Δ i = T i T s ,
Δ e = T e T s ,
B i = B s + Δ i Δ e ( B e B s ) ,
L i = L s + Δ i Δ e ( L e L s ) ,
where B is AIS latitude, L is AIS longitude, T is AIS time, Δ i is the time elapsed from the initial point to the check point, and Δ e is the time elapsed from the initial point to the end point.
Then, the spatiotemporal distance from P2 to P2’ is calculated. The rhumb line anti-inference method is applied for calculating the orientation of two ships. Given two-point coordinates, ( L 1 , B 1 ) and ( L 2 , B 2 ), the solution equation is as follows,
{ Δ B = B 2 B 1 Δ L = L 2 L 1 ,
s B = a ( 1 e 2 ) 0 B ( 1 e 2 sin 2 B ) 3 / 2 Δ B ,
where Δ B is the latitude difference in the geodetic coordinate system, Δ L is the longitude difference in the geodetic coordinate system, a is the major radius of the ellipsoid, e is the eccentricity, and s B is the arc from the evaluated point to the equator.
If Δ L > π , Δ L = Δ L 2 π is applied until Δ L π ; if Δ L < π , Δ L = Δ L + 2 π is applied until Δ L π in
{ q = ln [ tan ( π 4 + B 2 ) ( 1 e sin B 1 + e sin B ) e 2 ] Δ X = a d L Δ Y = a ( q 2 q 1 ) C = arc tan 2 ( Δ X , Δ Y ) ,
S = { ( s B 2 s B 1 ) cos A 1      ( Δ B 0 ) r 1 | Δ L |        ( Δ B = 0 ) ,
r 1 = a cos B 1 1 e 2 sin 2 B 1 ,
where q is the isometric latitude, r 1 is the latitude radius at latitude B1, Δ X is the horizontal coordinate difference in the Mercator coordinate system, A1 is starting point azimuth, Δ Y is the vertical coordinate difference in the Mercator coordinate system, C is the angle of the straight line between two ship points, and S is the length of the straight line between two ship points.

2.2. Feature Extraction Effect Verification

We obtained and analyzed a ship’s AIS trajectory data to demonstrate the effect of different thresholds on KFP extraction. Then, different distance and angle thresholds were set to generate the different KFP extraction results shown in Figure 7.
As seen in Figure 7, the redundant information rejection ratio increases with the sliding window threshold. The amount of information decreases with the number of extracted points. When the thresholds reach a certain level, it is possible that valid KFPs could be removed as if they were redundant points. Thus, when applying the proposed KFP extraction algorithm, a reasonable threshold must be selected to appropriately extract KFPs.

3. Feature Extraction Threshold Determination

Ship handling behavior pattern recognition and navigation experience learning influence KFPs. In this process, redundant data can be reduced to achieve feature extraction. However, deleting trajectory data inevitably leads to distortion. In the region of a high redundant information rejection ratio, the rejection ratio is positively related to the distortion. The higher the rejection ratio, the higher the distortion. Thus, a high rejection ratio cannot be blindly considered. An expected threshold range must be determined based on the trade-off between the rejection ratio of redundant information and acceptable distortion. The rejection ratio and the distortion are a pair of interdependent relational variables. Our study aims to reduce the distortion to an acceptable range. However, it is impossible to directly quantify the distortion. Therefore, in this study, we calculate the redundant information rejection ratio to quantify the distortion indirectly.
Different feature extraction thresholds produce different feature extraction results. Thus, the selection of a suitable feature extraction threshold ensures that AIS trajectory data are extracted effectively and appropriate KFPs are retained. To determine the appropriate feature extraction threshold, experimental feature extraction was performed for the Cheng Shantou channel in March 2015 using AIS trajectory data. The data contain information on the AIS trajectory of 332 ships, consisting of 926,497 points. It is impossible for ships of different sizes to share the same distance threshold; therefore, it must be properly adjusted by the size of the ship. In order to facilitate its quantification and improve versatility, a unitization process was conducted on the distance threshold. Referring to the ship-domain model proposed by Fujii, the ellipse-shaped ship domain is determined to be 8 times the length of the ship in its major axis, and 3.2 times the length of the ship in its minor axis [48]. In this study, the distance threshold is set as a parameter to describe the left and right direction distance offsets for the ship. Compared with the length of the ship, the ship beam is also the distance parameter in the left and right direction. Therefore, we used the beam of ship as the parameter for the unitization of the distance threshold. Then, the distance threshold was set between 0 to 2.5 times the beam of the ship, and the ship navigation angle deviation threshold was set between 0° to 12°. The corresponding KFPs were obtained using the proposed AIS trajectory feature extraction method. The redundant information rejection ratio diagram is shown in Figure 8.
According to Figure 8, the influence of the angle threshold is clearly stronger than that of the distance threshold. As a result, we set the angle threshold first, as shown in Figure 9 and Figure 10, where a distance threshold that is 1.7 times the beam is selected.
Similarly, the threshold data obtained using an angle threshold of 5° were analyzed to determine the influence of the distance threshold and the relationship between the redundant information rejection ratio and distance threshold. As shown in Figure 11 and Figure 12, when a distance threshold of 5° m is selected, the angle threshold is determined as (3.8–5.0°).
We determined the recommended thresholds for feature extraction (0.731–1.274, 3.8–5.0°) to assist in the selection of the distance and angle thresholds when applying the proposed algorithm. These thresholds must be re-established for different applications. In order to achieve versatility for use in other ships, this threshold has a certain relationship with the beam of ship. A relative value is obtained as the recommended initial threshold compared with the beam of ship. The recommended feature extraction thresholds were converted to dimensionless indices. The distance threshold was (0.731–1.274) times the beam of the ship. These thresholds are suitable considering limited storage space because they provide a good feature extraction ratio.

4. Results and Discussion of KFP Extraction Analysis

After selecting the appropriate threshold, the sliding-window algorithm was applied to extract ship behavior KFPs from AIS trajectories. The superiority of the DP algorithm has already been demonstrated for offline applications. In this section, we compare the computational efficiencies of the DP algorithm and improved sliding window algorithm.
The concept of the DP algorithm is to add KFPs to achieve feature extraction. However, the DP algorithm is likely to miss critical KFPs because extracted data exhibit significant distortion when the redundant information rejection ratio is extremely high. The concept of the proposed online sliding window feature extraction algorithm is to remove corresponding redundant points under feature extraction. The AIS tracking data for a ship were selected to demonstrate Tianjin Port in December 2017 using AIS trajectory data. The data containing information on the AIS trajectory of 1067 ships, consisting of 899,854 points, were extracted using the DP algorithm and improved sliding window algorithm. The distance thresholds were set as in the range of 0.25–3 times the ship beam with increments of 0.25, and an angle threshold of 4.5° was used in the sliding window algorithm for feature extraction. Then, the two algorithms were compared in terms of their running time to evaluate their computational efficiency, as feature extraction efficiency can be quantified by algorithm running time. The results of the analyses are presented in Table 1.
As seen in Table 1 and Figure 13, even though the redundant information rejection ratio of the DP algorithm is higher than that of the improved sliding window algorithm, in the region of high rejection ratio, the rejection ratio is positively related to the distortion. The higher the rejection ratio, the higher the distortion. The DP algorithm pursues the redundant information rejection ratio, which causes a certain degree of distortion. In Figure 14 and Figure 15, the purple lines represent the original AIS trajectory, the blue ship represents the KFPs extracted by the DP algorithm, and the red ship represents the KFPs extracted by the sliding window algorithm. The results extracted by the sliding window algorithm indicate that it can preserve more ship turning details than the DP algorithm, which preserves the rough shape of the trajectory; the remaining points can be displayed, and the extracted KFPs cannot be used in subsequent trajectory behavior studies. Therefore, the comparison shows that the sliding window not only performs better when extracting trajectory feature points, but also has a higher extraction efficiency.
Meanwhile, in terms of time, the sliding window algorithm requires an average of 112,216 ms, while the DP algorithm requires on average 954,279.5833 ms. The results indicate that the DP algorithm performs slightly better KFP extraction. However, the improved sliding window algorithm performs KFP extraction considerably faster, potentially compensating for the decrease in KFP extraction performance.

5. Conclusions

The transmission, display, learning, and storage of AIS information require considerable time, computing power, and storage space. In this paper, an improved sliding window algorithm that combines the spatiotemporal characteristics of ship AIS trajectory data was developed and tested to extract KFPs. The proposed algorithm significantly improves the computational efficiency of AIS trajectory data processing and provides a theoretical basis for future research on ship AIS trajectory data processing and ship behavior feature pattern recognition. The recommended threshold of the ship navigation angle deviation was found to be (3.8–5.0°) through data fitting using a distance threshold that was (0.73–1.27) times the beam of the ship. Given the recommended KFP extraction threshold, the users of the proposed algorithm can select an appropriate threshold, which is biased toward KFP extraction accuracy and efficiency, according to their KFP extraction requirements. The recommended threshold provided in this paper can also be used as the initial threshold for KFP extraction processing, and additional adjustments can be made as required for a particular ship. The results of this study demonstrate that the proposed improved sliding window algorithm that combines spatiotemporal characteristics can be applied to rapidly and easily extract KFPs from AIS trajectory data. The KFPs in the ship trajectory data contain the framework of the overall trajectory. The subsequent research on AIS big data can be directly carried out on the basis of KFPs. KFPs can be used as the nodes of the trajectory. The ship trajectory can be cut off at KFPs to generate a sub-trajectory. This ability is extremely significant for the analyses of traffic flow and the navigational behavior of ships.

Author Contributions

Software, M.G.; Supervision, G.S.; Writing–original draft, M.G.; Writing–review & editing, M.G.

Funding

This research was funded by the National Natural Science Foundation of China, grant numbers: 51709165, 51579025; the Natural Science Foundation of Liaoning Province, grant number: 20170540090; Fundamental Research Funds for the Central Universities, grant number: 3132019306.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mou, J.M.; Cees, V.D.T.; Ligteringen, H. Study on collision avoidance in busy waterways by using AIS data. Ocean Eng. 2010, 37, 483–490. [Google Scholar] [CrossRef]
  2. Wu, X.; Mehta, A.L.; Zaloom, V.A.; Craig, B.N. Analysis of waterway transportation in southeast Texas waterway based on AIS data. Ocean Eng. 2016, 121, 196–209. [Google Scholar] [CrossRef]
  3. Osborne, M.J.; Pepper, J. Creating Marine Spatial Data Infrastructure for the UK. In Coastal and Marine Geospatial Technologies; Green, D.R., Ed.; Springer: Dordrecht, The Netherlands, 2010; Volume 13, pp. 51–55. [Google Scholar] [CrossRef]
  4. Pepper, J. Unlocking the marine data treasure chest. In Coastal and Marine Geospatial Technologies; Green, D.R., Ed.; Springer: Dordrecht, The Netherland, 2010; Volume 13, pp. 57–64. [Google Scholar] [CrossRef]
  5. Piotr, B. The Ship Movement Trajectory Prediction Algorithm Using Navigational Data Fusion. Sensors 2017, 17, 1432. [Google Scholar] [CrossRef]
  6. Gao, M.; Shi, G.Y.; Li, S. Online Prediction of Ship Behavior with Automatic Identification System Sensor Data Using Bidirectional Long Short-Term Memory Recurrent Neural Network. Sensors 2018, 18, 4211. [Google Scholar] [CrossRef] [PubMed]
  7. Li, H.; Liu, J.; Liu, R.W.; Xiong, N.; Wu, K.; Kim, T.H. A Dimensionality Reduction-Based Multi-Step Clustering Method for Robust Vessel Trajectory Analysis. Sensors 2017, 17, 1792. [Google Scholar] [CrossRef]
  8. Sang, L.Z.; Wall, A.; Mao, Z.; Yan, X.P.; Wang, J. A novel method for restoring the trajectory of the inland waterway ship by using AIS data. Ocean Eng. 2015, 110, 183–194. [Google Scholar] [CrossRef] [Green Version]
  9. Zhang, S.K.; Shi, G.Y.; Liu, Z.J.; Zhao, Z.W.; Wu, Z.L. Data-driven based automatic maritime routing from massive AIS trajectories in the face of disparity. Ocean Eng. 2018, 155, 240–250. [Google Scholar] [CrossRef]
  10. Zhu, F.X.; Maritime, D. Mining ship spatial trajectory patterns from AIS database for maritime surveillance. In Proceedings of the IEEE International Conference on Emergency Management & Management Sciences, Beijing, China, 8–10 August 2011. [Google Scholar] [CrossRef]
  11. De Vries, G.K.D.; Van Someren, M. Machine learning for vessel trajectories using compression, alignments and domain knowledge. Expert Syst. Appl. 2012, 39, 13426–13439. [Google Scholar] [CrossRef]
  12. Takahashi, Y.; Karungaru, S.; Fukumi, M.; Akamatsu, N. Feature Point Extraction in Face Image by Neural Network. In Proceedings of the International Joint International on SICE-ICASE, Busan, Korea, 18–21 October 2006. [Google Scholar] [CrossRef]
  13. Chen, Z.; Jiang, J.; Jiang, X.; Cai, Z. Spectral-Spatial Feature Extraction of Hyperspectral Images Based on Propagation Filter. Sensors 2018, 18, 1978. [Google Scholar] [CrossRef]
  14. Kim, S.K.; Park, Y.J.; Toh, K.A.; Lee, S. SVM-based feature extraction for face recognition. Pattern Recognit. 2010, 43, 2871–2881. [Google Scholar] [CrossRef]
  15. Weber, C.; Hahmann, S.; Hagen, H. Sharp Feature Detection in Point Clouds. In Proceedings of the Shape Modeling International Conference, Aix-en-Provence, France, 21–23 June 2010; IEEE Computer Society: Washington, DC, USA, 2010. [Google Scholar] [CrossRef]
  16. Park, M.K.; Lee, S.J.; Lee, K.H. Multi-scale tensor voting for feature extraction from unstructured point clouds. Graph. Models 2012, 74, 197–218. [Google Scholar] [CrossRef]
  17. Jun, J.; Ogle, J.; Guensler, R. Relationships Between Crash Involvement and Temporal-Spatial Driving Behavior Activity Patterns: Use of Data for Vehicles with Global Positioning Systems. Transp. Res. Rec. 2007, 2019, 246–255. [Google Scholar] [CrossRef]
  18. Castro, D.; Nunes, U.; Ruano, A. Feature Extraction for Moving Objects Tracking System in Indoor Environments. Proc. Ifac/Euron Symp. Intell. Auton. Veh. 2004, 37, 5–7. [Google Scholar] [CrossRef]
  19. Jiang, S.; Wang, D.; Qu, Z.; Hu, H. Extraction and Calibration of Trajectory Characteristics of vehicles at Intersections. J. Southwest Jiaotong Univ. 2012, 47, 784–789. [Google Scholar] [CrossRef]
  20. Wang, W.; Ji, Y.; Lin, X. A novel fusion-based ship detection method from, Pol-SAR images. Sensors 2015, 15, 25072–25089. [Google Scholar] [CrossRef] [PubMed]
  21. Tu, W.; Zhong, S.; Incecik, A.; Fu, X. Defect feature extraction of marine protective coatings by terahertz pulsed imaging. Ocean Eng. 2018, 155, 382–391. [Google Scholar] [CrossRef] [Green Version]
  22. Mi, J.; Huang, J. Flow Monitoring Method Based on Quantitative Recursive Feature Extraction. J. Xinyang Norm. Univ. (Nat. Sci. Ed.) 2016, 29, 456–460. [Google Scholar] [CrossRef]
  23. Stefani, F.D.; Bottalico, S.; Pinizzotto, A. 1997. In Proceedings of the Ship Feature Extraction from Maritime Radar Data, Edinburgh, UK, 14–16 October 1997. [Google Scholar] [CrossRef]
  24. Wang, X.; Zeng, Y. Study on Vehicles Travel Path Extraction Based on Close Range Photogrammetry. Sci. Technol. Eng. 2012, 12, 5105–5108. (In Chinese) [Google Scholar] [CrossRef]
  25. Fu, P.; Wang, H.; Liu, K.; Hu, X.; Zhang, H. Finding Abnormal Vessel Trajectories Using Feature Learning. IEEE Access 2017, 5, 7898–7909. [Google Scholar] [CrossRef]
  26. Sheng, K.; Liu, Z.; Zhou, D.; He, A.; Feng, C. Research on ship classification based on trajectory features. J. Navig. 2018, 71, 17. [Google Scholar] [CrossRef]
  27. Li, Y.; Liu, R.W.; Liu, J.; Zhang, X.K.; Shi, G.Y.; Cai, Y. Trajectory compression-guided visualization of spatio-temporal AIS vessel density. In Proceedings of the International Conference on Wireless Communications & Signal Processing, Yangzhou, China, 13–15 October 2016. [Google Scholar] [CrossRef]
  28. Zhang, S.K.; Liu, Z.J.; Zhang, X.K.; Shi, G.Y.; Cai, Y. A method for AIS track data compression based on Douglas-Peucker algorithm. J. Harbin Eng. Univ. 2015, 5, 595–599. [Google Scholar] [CrossRef]
  29. Zhang, S.K.; Yang, J.X.; Cai, Y.; Shi, G.Y. A Method for Automatic Routing Based on AIS Tracks and Douglas-Peucker. J. Chongqing Jiaotong Univ. (Natural Science) 2014, 79–82, 117. (In Chinese) [Google Scholar] [CrossRef]
  30. Zhang, S.K.; Liu, Z.J.; Cai, Y.; Wu, Z.L.; Shi, G.Y. AIS Trajectories Simplification and Threshold Determination. J. Navig. 2016, 69, 729–744. [Google Scholar] [CrossRef]
  31. Zhao, L.B.; Shi, G.Y. A method for simplifying ship trajectory based on improved Douglas–Peucker algorithm. Ocean Eng. 2018, 166, 37–46. [Google Scholar] [CrossRef]
  32. Zhao, L.B.; Shi, G.Y. A trajectory clustering method based on Douglas-Peucker compression and density for marine traffic pattern recognition. Ocean Eng. 2019, 172, 456–467. [Google Scholar] [CrossRef]
  33. Mou, J.M.; Chen, P.F.; He, Y.X.; Zhang, X.J.; Zhu, J.F.; Rong, H. Fast self-tuning spectral clustering algorithm for AIS ship trajectory. J. Harbin Eng. Univ. 2018, 39, 428–432. [Google Scholar] [CrossRef]
  34. Ren, Y.; Yang, C.; Yu, Z.; Wang, P. A Way to Speed up Buffer Generalization by Douglas-Peucker Algorithm. In Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, Anchorage, AK, USA, 20–24 September 2004. [Google Scholar] [CrossRef]
  35. Zhu, M.; Sun, J. GPS Trajectory Data Compression Algorithm Based on MBR. J. Xinyang Coll. Agric. For. 2016, 26, 117–120, 123. (In Chinese) [Google Scholar] [CrossRef]
  36. Dutta, S.; Bhattacherjee, S.; Narang, A. Towards “intelligent compression” in streams: A biased reservoir sampling based Bloom filter approach. In Proceedings of the 15th International Conference on Extending Database Technology, Berlin, Germany, 26–30 March 2011; pp. 228–238. [Google Scholar] [CrossRef]
  37. Yang, L.; Yang, G.; Yin, Y.; Xiao, R. Sliding window-based region of interest extraction for finger vein images. Sensors 2013, 13, 3799–3815. [Google Scholar] [CrossRef]
  38. Keogh, E.; Chu, S.; Pazzani, M. An online algorithm for segmenting time series. In Proceedings of the 2001 IEEE International Conference on Data Mining, San Jose, CA, USA, 29 November–2 December 2001; pp. 289–296. [Google Scholar] [CrossRef]
  39. Otsuka, K.; Horikoshi, T.; Suzuki, S.; Fujii, M. Feature extraction of temporal texture based on spatiotemporal motion trajectory. In Proceedings of the International Conference on Pattern Recognition. Computer Society, Brisbane, Queensland, Australia, 20 August 1998. [Google Scholar] [CrossRef]
  40. Cao, H.; Wolfson, O.; Trajcevski, G. Spatio-temporal data reduction with deterministic error bounds. VLDB J. 2006, 15, 211–228. [Google Scholar] [CrossRef]
  41. Satoh, Y.; Nakagawa, T.; Okatani, T.; Deguchi, K. A motion tracking by extracting 3D feature of moving objects with binocular cooperative fixation. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots & Systems, Lausanne, Switzerland, 30 September–4 October 2002. [Google Scholar] [CrossRef]
  42. Sandu, P.I.; Zeitouni, K.; Oria, V.; Kharrat, A. Spatio-temporal compression of trajectories in road networks. GeoInformatica 2015, 19, 117–145. [Google Scholar] [CrossRef]
  43. Xiu, S.; Wen, Y.Q.; Yuan, H.W.; Xiao, C.S.; Zhan, W.Q.; Zou, X.; Zhou, C.H.; Sayed, C.S. A Multi-Feature and Multi-Level Matching Algorithm Using Aerial Image and AIS for Vessel Identification. Sensors 2019, 19, 1317. [Google Scholar] [CrossRef] [PubMed]
  44. Hershkovits, Y.; Ziv, J. On sliding-window universal data compression with limited memory. IEEE Trans. Inf. Theory 2002, 44, 66–78. [Google Scholar] [CrossRef]
  45. Chou, J.S.; Ngo, N.T. Time series analytics using sliding window metaheuristic optimization-based machine learning system for identifying building energy consumption patterns. Appl. Energy 2016, 177, 751–770. [Google Scholar] [CrossRef]
  46. Serfozo, R. Basics of Applied Stochastic Processes; Springer Science & Business Media: Berlin, Gemany, 2009; pp. 1–99, 241–242. [Google Scholar] [CrossRef]
  47. Wang, J.; Zhu, C.; Zhou, Y.; Zhang, W. Vessel Spatio-Temporal Knowledge Discovery with AIS Trajectories Using Co-Clustering. J. Navig. 2017, 70, 18. [Google Scholar] [CrossRef]
  48. Fuji, J.; Tanaka, K. Traffic Capacity. J. Navig. 1971, 24, 543–552. [Google Scholar] [CrossRef]
Figure 1. Multiple applications of key feature points (KFPs).
Figure 1. Multiple applications of key feature points (KFPs).
Sensors 19 02706 g001
Figure 2. Sliding window rectangle in automatic identification system (AIS) trajectory extraction.
Figure 2. Sliding window rectangle in automatic identification system (AIS) trajectory extraction.
Sensors 19 02706 g002
Figure 3. Navigation angle deviation.
Figure 3. Navigation angle deviation.
Sensors 19 02706 g003
Figure 4. 3D trajectory and its projected path in the 2D plane.
Figure 4. 3D trajectory and its projected path in the 2D plane.
Sensors 19 02706 g004
Figure 5. Schematic of the proposed improved sliding window algorithm.
Figure 5. Schematic of the proposed improved sliding window algorithm.
Sensors 19 02706 g005
Figure 6. Flow diagram of the proposed improved sliding window algorithm.
Figure 6. Flow diagram of the proposed improved sliding window algorithm.
Sensors 19 02706 g006
Figure 7. Ship trajectory feature extraction using different thresholds.
Figure 7. Ship trajectory feature extraction using different thresholds.
Sensors 19 02706 g007aSensors 19 02706 g007bSensors 19 02706 g007c
Figure 8. Diagram of the redundant information rejection ratio.
Figure 8. Diagram of the redundant information rejection ratio.
Sensors 19 02706 g008
Figure 9. Relationship between the angle threshold and feature extraction ratio for a distance threshold of 59 m.
Figure 9. Relationship between the angle threshold and feature extraction ratio for a distance threshold of 59 m.
Sensors 19 02706 g009
Figure 10. Relationship between the angle threshold and rate of change in rejection rate for a distance threshold 1.7 times the beam.
Figure 10. Relationship between the angle threshold and rate of change in rejection rate for a distance threshold 1.7 times the beam.
Sensors 19 02706 g010
Figure 11. Relationship between the distance threshold and the redundant information rejection ratio for an angle of 5°.
Figure 11. Relationship between the distance threshold and the redundant information rejection ratio for an angle of 5°.
Sensors 19 02706 g011
Figure 12. Relationship between the distance threshold and rate of change in rejection rate for an angle of 5°.
Figure 12. Relationship between the distance threshold and rate of change in rejection rate for an angle of 5°.
Sensors 19 02706 g012
Figure 13. KFP extraction efficiency of the two evaluated algorithms comparison chart.
Figure 13. KFP extraction efficiency of the two evaluated algorithms comparison chart.
Sensors 19 02706 g013
Figure 14. AIS trajectory KFP extracted by Douglas–Peucker (DP).
Figure 14. AIS trajectory KFP extracted by Douglas–Peucker (DP).
Sensors 19 02706 g014
Figure 15. AIS trajectory KFPs extracted by sliding window.
Figure 15. AIS trajectory KFPs extracted by sliding window.
Sensors 19 02706 g015
Table 1. KFP extraction efficiency of the two evaluated algorithms.
Table 1. KFP extraction efficiency of the two evaluated algorithms.
DP AlgorithmImproved Sliding Window Algorithm (For Angle Threshold of 4.5°)
Distance Threshold (/beam)Time (ms)Redundant Information Rejection Ratio (%)Time (ms)Redundant Information Rejection Ratio (%)
0.251,065,88062.8326106,73846.2627
0.51,001,90973.1039107,40560.4662
0.75993,54177.6836115,01567.5149
1968,28580.4005117,77271.6335
1.25967,54982.3278114,02874.6086
1.5960,61083.7742114,21176.9160
1.75919,21684.9347114,14378.7610
2903,67085.8901113,53980.2842
2.25918,58086.6922110,62981.5669
2.5897,76787.3986114,09582.6549
2.75932,62887.9897110,44983.5983
3921,72088.5085108,56884.4530

Share and Cite

MDPI and ACS Style

Gao, M.; Shi, G.-Y. Ship Spatiotemporal Key Feature Point Online Extraction Based on AIS Multi-Sensor Data Using an Improved Sliding Window Algorithm. Sensors 2019, 19, 2706. https://doi.org/10.3390/s19122706

AMA Style

Gao M, Shi G-Y. Ship Spatiotemporal Key Feature Point Online Extraction Based on AIS Multi-Sensor Data Using an Improved Sliding Window Algorithm. Sensors. 2019; 19(12):2706. https://doi.org/10.3390/s19122706

Chicago/Turabian Style

Gao, Miao, and Guo-You Shi. 2019. "Ship Spatiotemporal Key Feature Point Online Extraction Based on AIS Multi-Sensor Data Using an Improved Sliding Window Algorithm" Sensors 19, no. 12: 2706. https://doi.org/10.3390/s19122706

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop