Innovative assessment scheme of navigation risk based on improved multi-source information fusion techniques

Abstract

To deal with highly time complexity and unstable assessments for conflicting evidences from various navigation factors, we put forward an innovative assessment scheme of navigation risk based on the improved multi-source information fusion techniques. Different from the existing studies, we first deduce the nonlinear support vector machine classification model for the general scenario. The slack variable is adaptively computed based on the Euclidean distance ratio. Considering the unsatisfactory characteristics of the standard Dempster–Shafer evidence theory, the optimal combination rule is derived step by step. What"s more, the lowly dimensional Kalman filter is applied to forecast the navigation risk. Simultaneously, the time complexity of each technique is analyzed. With respect to the vessel navigation risk, the assessment results are provided to indicate the reliability and efficiency of the proposed scheme.

Keywords

Navigation risk combination rule support vector machine classification model time complexity risk forecasting

Introduction

Navigation risk defines the occurrence likelihood of traffic accidents. As we know, the navigation factor mainly includes three kinds of important sub-factors, that is, hydrological sub-factor, environmental sub-factor, and navigable sub-factor. In the maritime engineering, it mainly refers the safe state and dangerous state reported by the International Maritime Organization,^1,2 where the dangerous state often causes maritime disaster.^3–5 Therefore, how to effectively assess navigation risk based on them has become a popular research topic in the world.

The multi-source information fusion technique is the intelligent combination of heterogeneous information, where the mathematical model is rigorous, robust, and general. Recently, some scholars have studied the assessment scheme of vessel navigation risk, and many articles based on this technique have been published in famous periodicals. Proceeding from the existing assessment schemes, we note that the analytic hierarchy process (AHP) is regarded as an important method that can divide a water transportation system into many subsystems. In this way, the subjective factor of experts plays a leading role in the reasoning framework.^6–8 Considering the influence of experts’ experience, we had better seek the more effective method in order to achieve credible assessment. Alternatively, the Dempster–Shafer (D-S) evidence theory is a probabilistic appropriate algorithm of multi-source fusion.^9,10 With the basic probabilistic assignment (BPA), two alternative techniques for combining evidences were introduced in Blasch et al.¹¹ In Zhang et al.,¹² an improved D-S approach to construction the safety risk perception was proposed, where the combination rule and weighted average rule were integrated to synthesize multi-source. Subsequently, Ortiz et al.¹³ complemented an analysis of risk and helped the decision maker in order to achieve the degree of confidence. However, the standard D-S evidence theory can hardly provide reliable results for conflicting evidences from various factors.^14,15

To enhance the decision performance, the support vector machine (SVM) classification model is used to complete pattern classification and regression estimation by allowing examples to violate the margin condition.^16–18 It is often considered as a new training algorithm for the polynomial, radial basis function (RBF), and multi-layer classifier by defining the kernel function. Aimed at the safety and reliability of surface vessels, Li et al.¹⁹ diagnosed the navigation state to give a warning of dangerous state, which took measures to make vessels free from hazard before it was late. In Wang and Wang,²⁰ some models were to make estimation in the Yangtze River. Subsequently, the assessments were made by varying the quantity of significant wave heights based on the SVM model in Berbić et al.²¹ In these models, the training data from practical applications are often contaminated by the random noise. Therefore, some raw samples in the training set or test set are misplaced on the wrong side by accident.^17,22

Until now, we find that few works have been reported on the vessel navigation risk assessment by the nonlinear SVM classification model and optimal D-S evidence theory. Although the instantaneous risk assessment is useful, the risk forecasting is more practical for the water traffic. According to the Kalman filter (KF), an effective fusion technique for the state prediction is presented. Therefore, we further extend the proposed scheme to forecast the future risk, which saves time complexity of the back propagation neural network (BPNN) in Liu and colleagues.^23–25 Take the case of the vessel navigation risk, we analyze how to integrate different techniques and improve both efficiency and reliability in order to accomplish risk assessment in the complex waters. The innovations are outlined as follows:

With respect to the practical applications, the nonlinear SVM classification model is derived to classify samples. Considering the Euclidean distance between each sample and the center of respective class in the kernel space, we adaptively compute the slack variable.

The enhanced D-S combination rule is explored to integrate conflicting evidences from various factors, whose time complexity is only proportional to the size of the risk set.

The above techniques are combined to assess the vessel navigation risk. What is more, the convenient KF is integrated to forecast the future risk for the first time.

The remainder of this note is organized as follows: First, the current issues of the vessel navigation risk assessment are formulated in section “Preliminaries.” In section “Methodology,” the nonlinear edition of the SVM classification model is derived by exploring the slack variable. The optimal D-S evidence theory with the novel combination rule is presented. Then, the low-dimensional KF is applied for the risk forecasting. Furthermore, the time complexity is analyzed analytically. In section “Numeric study and discussion,” the numerical studies are presented with the promising results to discuss the overall performance of the proposed scheme. We draw the conclusion with the next plan in “Conclusion.”

Preliminaries

With respect to the maritime engineering, the hydrological sub-factor plays an important part in the modern water traffic. First, the visibility means the maximum horizontal distance that the human eye can observe in the normal daytime, and the water traffic can be affected by the unsatisfactory visibility. The wind determines the sailing posture of vessels. Through the statistics, the wind speed is proportional to the occurrence probability of the water traffic accident. Moreover, the wave has the unexpected effect, whose high speed may lead to the vessel collision. As a practical sensor, the weather receiver is considered to collect different hydrological information. On the other hand, the vessel operator should take all things into consideration in the environmental sub-factor: the channel length, channel depth, and obstacle. In a long channel, the vessel power dramatically decreases with the increase of the water resistance. Both wiping and stranding may occur. Besides, some obstacles in the narrow channel are inherent harm to the navigation. To evaluate the environmental sub-factor, the navigation telex is used in this work. The navigable sub-factor refers to the background of the navigation route. The crossing channels often lead to the increase of water traffic accident when vessels encountering. Due to various vessel speeds, the chasing can cause the vessel collision to some extent. Since the vessel traffic system (VTS) plays a guiding role in maintaining the navigation safety, we use it to assess the level of the navigable sub-factor.

In practice, the heterogeneous sensors (the weather receiver, navigation telex, and VTS) have different identification abilities for the associated sub-factors that have various physical characteristics and variable probabilistic models, where the hydrological sub-factor is easily interfered by the natural phenomenon whereas the environmental sub-factor changes slowly. Moderately, the navigable sub-factor is determined by the detection performance of the VTS. Aimed at the independent of three kinds of the mentioned sub-factors, the reliability of heterogeneous sensors should be taken into consideration.

Methodology

In order to reduce the conflicting evidences from various factors, the posterior probability from the SVM classification model makes use of the information combination in the D-S framework. The output of the nonlinear SVM model includes the sample classification and probability, that is, the SVM training improves the classification accuracy which gives satisfactory solution to the assignment problem to the BPA. However, one assumption of the SVM is that all samples follow the independent and identical distribution. Once some samples are misplaced on the wrong side by accident, the model is no longer sparse because it is sensitive to the random noise. Thus, the single SVM approach cannot give the reliable result. It is necessary to present an integrated scheme in order to effectively compute the optimal BPA from each sub-factor based on the nonlinear SVM classification model and then assesses the vessel navigation risk. In view of the forecasting function, the convenient KF is supplemented using the BPA. In this work, the initial inputs are the raw information of the hydrological sub-factor from the weather receiver, the environmental sub-factor from the navigation telex, and the navigable sub-factor from the VTS. According to the proposed information fusion techniques, the vessel navigation risk assessment and forecasting results are considered as the expected outputs. To pave the path to the proposed assessment scheme, we outline three kinds of the innovative multi-source information fusion techniques in this section.

Nonlinear SVM classification model

In general, many identification problems are not linearly separable, where some parameters are unknown. In this work, the SVM classification model is extended to map the low-dimensional input vector from the Euclidean space $R^{n}$ into the high-dimensional Hilbert space $H$ based on the nonlinear function $Φ$ . First, we construct the hyperplane $w Φ (x_{i}) + b = 0$ as a kernel expansion, where $w \in R^{n}$ is the normalized weight and $b \in R^{n}$ is an intercept for the classification threshold. The kernel function under the Mercer condition is regarded as a dot product in $R^{n}$ ^7,17,26

K (x_{i}, x_{i'}) = Φ (x_{i}) \cdot Φ (x_{i'}), \forall x_{i}, x_{i'} \in R^{n}

(1)

Considering the training sample set ${(x_{i}, y_{i})}_{i = 1}^{l}$ , we get the class $y_{i} \in {- 1, 1}$ corresponding to the sample $x_{i}$ that means the raw information of the hydrological sub-factor, environmental sub-factor, and navigable sub-factor. Then, the objective function of the maximum margin for the separating hyperplane is

{\begin{matrix} \frac{1}{2} \min_{w} {‖ w ‖}^{2} + C \sum_{i = 1}^{l} ξ_{i} \\ \begin{matrix} s . t . y_{i} (w Φ (x_{i}) + b) - 1 + ξ_{i} \geq 0 \\ ξ_{i} \geq 0 \end{matrix} \end{matrix}

(2)

where $‖ \cdot ‖ denotes$ the Euclidean norm, $ξ_{i}$ is the slack variable, and the hyper-parameter C determines the tradeoff between empirical risk and regularization. As for the maximal C, equation (2) minimizes $1 / 2 \min_{w} ‖ w ‖^{2}$ under the same constraint so that all training examples are classified, that is, the larger the value of C, the larger classification margin.

With respect to the first nearest neighbor classifier, there is further advantage in the non-separable case.²⁷ Then, we define the Wolfe dual problem as

{\begin{matrix} \max L_{D} = \sum_{i = 1}^{l} α_{i} - \frac{1}{2} \sum_{i = 1}^{l} \sum_{j = 1}^{l} α_{i} α_{j} y_{i} y_{j} K (x_{i}, x_{j}) \\ s . t . - \sum_{i = 1}^{l} α_{i} y_{i} = 0 \\ 0 \leq α_{i} \leq C \end{matrix}

(3)

According to equation (1), the solution of equation (3) is

w = \sum_{i = 1}^{l} α_{i} y_{i} Φ (x_{i})

(4)

Considering the regression estimation, we construct the Lagrange function $L_{P}$ as

\begin{matrix} L_{P} = \frac{1}{2} ‖ w ‖^{2} - \sum_{i = 1}^{l} α_{i} (y_{i} (w Φ (x_{i}) + b) - 1 + ξ_{i}) \\ + \sum_{i = 1}^{l} (C - μ_{i}) ξ_{i} \end{matrix}

(5)

where $α_{i} \neq 0$ is the support vector, and $μ_{i}$ is the Lagrange multiplier used to enforce the positivity of $ξ_{i}$ . Furthermore, the Karush–Kuhn–Tucker (KKT) conditions are given by

{\begin{matrix} \frac{\partial L_{P}}{\partial w} = w - \sum_{i = 1}^{l} α_{i} y_{i} Φ (x_{i}) = 0 \\ \frac{\partial L_{P}}{\partial b} = - \sum_{i = 1}^{l} α_{i} y_{i} = 0 \\ \frac{\partial L_{P}}{\partial ξ_{i}} = C - α_{i} - μ_{i} = 0 \\ y_{i} (w Φ (x_{i}) + b) - 1 + ξ_{i} \geq 0 \\ \begin{matrix} ξ_{i} \geq 0, α_{i} \geq 0, μ_{i} \geq 0 \\ α_{i} (y_{i} (w Φ (x_{i}) + b) - 1 + ξ_{i}) = 0 \end{matrix} \\ μ_{i} ξ_{i} = 0 \end{matrix}

(6)

Proposition 1

Given that the slack variable $ξ_{i}$ is not given in mostly cases, we use the ratio of the Euclidean distance to adaptively compute it

ξ_{i} = ρ_{i} \frac{\sqrt{K (x_{i}, x_{i}) + K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c}) - 2 K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c})}}{\sqrt{\max (K (x_{i}, x_{i}) + K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c}) - 2 K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c}))}}

(7)

where $ρ_{i} \geq 0$ is the adjustment coefficient.

Proof

Suppose that the subscripts $x$ and $y$ denote the Cartesian components in two positions, then the recursion of the numerator in equation (7) is

\begin{matrix} \sqrt{K (x_{i}, x_{i}) + K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c}) - 2 K ({\overset{⌢}{x}}_{c}, {\overset{⌢}{x}}_{c})} \\ = \sqrt{Φ (x_{i}) \cdot Φ (x_{i}) + Φ ({\overset{⌢}{x}}_{c}) \cdot Φ ({\overset{⌢}{x}}_{c}) - 2 Φ (x_{i}) \cdot Φ ({\overset{⌢}{x}}_{c})} \\ = \sqrt{\begin{array}{l} Φ (x_{i x}) \cdot Φ (x_{i x}) + Φ ({\overset{⌢}{x}}_{cx}) \cdot Φ ({\overset{⌢}{x}}_{cx}) - 2 Φ (x_{i x}) \cdot Φ ({\overset{⌢}{x}}_{cx}) \\ + Φ (x_{i y}) \cdot Φ (x_{i y}) + Φ ({\overset{⌢}{x}}_{cy}) \cdot Φ ({\overset{⌢}{x}}_{cy}) - 2 Φ (x_{i y}) \cdot Φ ({\overset{⌢}{x}}_{cy}) \end{array}} \\ = \sqrt{{(Φ (x_{i x}) - Φ ({\overset{⌢}{x}}_{cx}))}^{2} + {(Φ (x_{i y}) - Φ ({\overset{⌢}{x}}_{cy}))}^{2}} \end{matrix}

(8)

Substituting equation (8) into equation (7), we find that the numerator defines the Euclidean distance between each sample $x_{i}$ and the center of class ${\overset{⌢}{x}}_{c}$ in the kernel space. Since the ratio of the Euclidean distance is normalized, the contribution of ${\overset{⌢}{x}}_{c}$ is small. When $0 \leq ρ_{i} \leq 1$ , there is $0 \leq ξ_{i} \leq 1$ . At this time, the classification error is reduced. On the contrary, when $ξ_{i} > 1$ (there must be $ρ_{i} > 1$ ), the support vector is determined by $x_{i}$ which is close to ${\overset{⌢}{x}}_{c}$ . However, the current classification error is increased.□

Subsequently, we have in hand the optimal parameters $α_{i}$ , $w$ , and $b$ under the KKT conditions. After the SVM training, the classification function $f (x_{i})$ is

f (x_{i}) = sgn (\sum_{i = 1}^{l} α_{i} y_{i} K (x_{i}, x) + b)

(9)

In equation (9), $sgn (\cdot)$ denotes the symbolic function, and $K (x_{i}, x)$ is represented by the Gaussian RBF for various sizes and dimensions

K (x_{i}, x) = \exp (- \frac{{‖ x_{i} - x ‖}^{2}}{2 σ^{2}})

(10)

where $σ^{2}$ is the variance, and $K (x_{i}, x)$ defines an implicit feature space of infinite dimensions.

In the SVM decision, the desired output $y_{i}$ is often considered as the classification label of $x_{i}$ . The posterior probability output $[0, 1]$ is computed based on the probability formula. According to the Sigmoid function, the predicted probability of $x_{i}$ is given by²²

P_{i} = \frac{1}{1 + \exp (κ f (x_{i}) + ε)}

(11)

where $P_{i}$ will be applied to compute the BPA in the next section. Then, we can apply the likelihood function to compute the parameters $κ$ and $ε$

L_{P} = \min_{ε} \sum_{i = 1}^{l} (- γ_{i} \log_{2} P_{i} - (1 - γ_{i}) \log_{2} (1 - P_{i}))

(12)

where $γ_{i}$ is determined by the number of samples among the positive class $N_{+}$ and negative class $N_{-}$

γ_{i} = {\begin{matrix} \frac{N_{+} + 1}{N_{+} + 2}, y_{i} = 1, i = 1, \dots, l \\ \frac{1}{N_{-} + 2}, y_{i} = - 1, i = 1, \dots, l \end{matrix}

(13)

Optimal D-S evidence theory

After the derivation of the nonlinear SVM classification model, we will present the optimal D-S evidence combination rule for the uncertain probability conditions, which can improve performance of the vessel navigation risk assessment based on the initial classification of the SVM outputs, especially for the conflicting evidences of various sub-factors.

The D-S evidence theory assumes the hypotheses to be mutually exhaustive and exclusive in the space Θ^4,10

{\begin{matrix} \sum_{A \subseteq Θ} m (A) = 1, 0 \leq m (A) \leq 1 \\ m (ϕ) = 0 \end{matrix}

(14)

where the mass function $m (\cdot) : 2^{Θ} \to [0, 1]$ is bounded with the belief and plausibility. The belief $Bel (\cdot)$ with a hypothesis is constituted by the sum of masses of all sets

Bel (A) = \sum_{A \subseteq B} m (B)

(15)

On the other hand, the plausibility defines one minus the sum of masses in all sets, where the intersection with the hypothesis is thoroughly empty. Given that some evidences may contradict hypothesis, the plausibility function $Pl (\cdot)$ is considered as an upper bound on the possibility when the hypothesis is true

{\begin{matrix} \begin{matrix} Pl (A) = \sum_{A \cap B \neq ϕ} m (B) \\ = 1 - Bel (A), 0 \leq m (A) \leq 1 \end{matrix} \\ Pl (ϕ) = 0 \end{matrix}

(16)

According to equations (15) and (16), the D-S evidence theory provides a measure based on the closed period $[Bel (A), Pl (A)]$ . In this work, assume that $P_{j i} (A_{s})$ is the predicted probability of $x_{i}$ from the jth classifier, we first compute the normalized $m_{j i} (A_{s})$ that reflects the occurrence probability of one-point subset $A_{s}$ in Θ

m_{j i} (A_{s}) = P_{j i} (A_{s}) \cdot R_{j}

(17)

where $R_{j}$ is the classification accuracy of the jth classifier, and $A_{s} (s = 1, \dots, S)$ means the different risk levels. According to the combination rule, the fused BPA of the jth classifier is given by

\begin{matrix} m_{j} (A_{s}) = (m_{j 1} \oplus m_{j 2} \oplus \dots \oplus m_{j q}) (A_{s}) \\ = \frac{\sum_{⋂_{s = 1}^{S} A_{s} = A} Π_{i = 1}^{q} m_{j i} (A_{s})}{\sum_{⋂_{s = 1}^{S} A_{s} \neq \emptyset} Π_{i = 1}^{q} m_{j i} (A_{s})} \end{matrix}

(18)

In equation (18), the numerator means the belief, and the denominator denotes the plausible. Obviously, the belief can be converted to the Bayesian belief function after assigning the related BPAs

{\begin{matrix} \sum_{s = 1}^{S} m_{j i} (A_{s}) \leq 1, 0 \leq m_{j i} (A_{s}) \leq 1, m_{j i} (ϕ) = 0 \\ m_{j i} (φ) = 1 - \sum_{s = 1}^{S} m_{j i} (A_{s}) \end{matrix}

(19)

As for some conflicting or insufficient evidences, the standard D-S evidence theory may be invalid. At this time, the sum of all BPAs in equation (19) is less than 1, which brings about unstable combination results. We should introduce the BPA $m_{j} (φ)$ of the uncertain element $φ$ in order to compensate the deficient component. Therefore, the BPAs of the single $A_{i}$ and $φ$ can be rewritten as

m_{j} (A_{s}) = \frac{Π_{i = 1}^{q} (m_{j i} (A_{s}) + m_{j i} (φ)) - Π_{i = 1}^{q} m_{j i} (φ)}{\sum_{s = 1}^{S} (Π_{i = 1}^{q} (m_{j i} (A_{s}) + m_{j i} (φ)) - Π_{i = 1}^{q} m_{j i} (φ)) + Π_{i = 1}^{q} m_{j i} (φ)}

(20)

\begin{matrix} m_{j} (φ) = 1 - \sum_{s = 1}^{s} m_{j i} (A_{s}) \\ = \frac{Π_{j = 1}^{q} m_{j i} (φ)}{\sum_{s = 1}^{S} (Π_{i = 1}^{q} (m_{j i} (A_{s}) + m_{j i} (φ)) - Π_{i = 1}^{q} m_{j i} (φ)) + Π_{i = 1}^{q} m_{j i} (φ)} \end{matrix}

(21)

In equations (20) and (21), the denominators are exactly the same. For simplification, the pseudo BPAs ${\tilde{m}}_{j q} (A_{s})$ and ${\tilde{m}}_{j q} (φ)$ are represented under the iteration operation, where the denominator is redefined by the sum of ${\tilde{m}}_{j q} (A_{s})$ and ${\tilde{m}}_{j q} (φ)$

\begin{matrix} {\tilde{m}}_{j q} (A_{i}) = Π_{i = 1}^{q} (m_{j i} (A_{s}) + m_{j q} (φ)) - Π_{i = 1}^{q} m_{j i} (φ) \\ = (m_{j q} (A_{s}) + m_{j q} (φ)) Π_{i = 1}^{q - 1} (m_{j i} (A_{s}) + m_{j i} (φ)) \\ - m_{j q} (φ) Π_{i = 1}^{q - 1} m_{j i} (φ) \\ = (m_{j q} (A_{s}) + m_{j q} (φ)) ({\tilde{m}}_{j q - 1} (A_{s}) + {\tilde{m}}_{j q - 1} (φ)) \\ - m_{j q} (φ) {\tilde{m}}_{j q - 1} (φ) \\ = m_{j q} (A_{s}) {\tilde{m}}_{j q - 1} (A_{s}) + m_{j q} (A_{s}) {\tilde{m}}_{j q - 1} (φ) \\ + m_{j q} (φ) {\tilde{m}}_{j q - 1} (A_{s}) \end{matrix}

(22)

\begin{matrix} {\tilde{m}}_{j q} (φ) = Π_{i = 1}^{q} m_{j i} (φ) \\ = m_{j q} (φ) {\tilde{m}}_{j q - 1} (φ) \end{matrix}

(23)

where ${\tilde{m}}_{j 1} (A_{s})$ and ${\tilde{m}}_{j 1} (φ)$ are the initial BPAs

{\tilde{m}}_{j 1} (A_{s}) = m_{j 1} (A_{s})

(24)

{\tilde{m}}_{j 1} (φ) = m_{j 1} (φ)

(25)

Substituting them into equations (20) and (21), we get the optimal combination rule as follows

m_{j} (A_{s}) = \frac{{\tilde{m}}_{j q} (A_{s})}{\sum_{s = 1}^{S} {\tilde{m}}_{j q} (A_{s}) + {\tilde{m}}_{j q} (φ)}

(26)

m_{j} (φ) = \frac{{\tilde{m}}_{j q} (φ)}{\sum_{s = 1}^{S} {\tilde{m}}_{j q} (A_{s}) + {\tilde{m}}_{j q} (φ)}

(27)

Note that the fused BPA can be achieved using the iterations of equations (26) and (27) instead of the standard equation (18). After computing the fused BPA $m_{j} (A_{s})$ and $m_{j} (φ)$ based on $m_{j i} (A_{s})$ and $m_{j i} (φ)$ , we obtain the final fused BPAs $m (A_{s})$ and $m (φ)$ using the optimal D-S evidence combination rule again.

Extension to risk forecasting

The former subsections present the assessment process based on two kinds of the information fusion techniques. Different from the existing studies on the vessel navigation risk assessment, the risk forecasting can apply the valuable forecasting information for the next time. As a warning of the future state, it has practical significance to make vessels free from the potential hazard in the navigation engineering.

At time $k - 1$ , we have in hand the posterior BPA ${\hat{m}}_{k - 1 | k - 1}$ , where the superscript denotes the forecasting value. Then, the time-updated BPA is given by^28,29

{\hat{m}}_{k | k - 1} = F_{k | k - 1} {\hat{m}}_{k - 1 | k - 1} + u_{k}

(28)

where $F_{k | k - 1}$ is the transition matrix and $u_{k}$ is the process noise.

Assume that $P_{k - 1 | k - 1}$ is the BPA error covariance and $Q_{k - 1 | k - 1}$ is the process noise covariance, then the time-updated covariance propagation is

P_{k | k - 1} = F_{k | k - 1} P_{k - 1 | k - 1} F_{k | k - 1}^{T} + Q_{k - 1 | k - 1}

(29)

where $(\cdot)^{T}$ denotes the transpose matrix.

The Kalman gain is calculated by

K_{k} = P_{k | k - 1} H_{k}^{T} {(H_{k} P_{k | k - 1} H_{k}^{T} + R_{k | k})}^{- 1}

(30)

where $H_{k}$ is the measurement matrix and $R_{k | k}$ is the measurement noise covariance.

Let $m_{k}$ be the calculated BPA based on the combination rule at time $k$ , then the measurement-updated BPA and its covariance are

{\hat{m}}_{k | k} = {\hat{m}}_{k | k - 1} + K_{k} (m_{k} - H_{k} {\hat{m}}_{k | k - 1})

(31)

P_{k | k} = (I - K_{k} H_{k}) P_{k | k - 1}

(32)

where $I$ is the identity matrix. To improve the calculation efficiency, we use the low-dimensional matrices to forecast each BPA independently, which avoid the multi-dimensional inverse matrix calculus. Given that $R_{k | k}$ is often given, the small constant value should be taken place with a variable. Therefore, we compute it using the covariance of $(m_{k} - H {\hat{m}}_{k | k - 1})$ which can approximate the uncertain measurement noise as far as possible.

Time complexity

The time complexity is an important measure to evaluate the evolution of the combination process. Therefore, the time complexity can measure the efficiency of the proposed scheme. In terms of n classifiers and $ϒ$ support vectors per classifier, the time complexity of the standard SVM classification model is $O (n ϒ^{3})$ in the KKT situation,^16,30 where $O (\cdot)$ denotes the time complexity. In this work, we still keep the similar cost to complete the nonlinear SVM model except for computing the ratio of the Euclidean distance. Actually, this calculation is only relied on the kernel matrix so that little additional complexity is related to $ξ_{i}$ because of the stored RBF.

Subsequently, we analyze the time complexity of the optimal D-S evidence theory. Aimed at the size of the risk degree set $| Θ |$ , the time complexity of the standard theory is $O (2^{| Θ |})$ .^10,31 For comparison, the proposed D-S evidence theory has the linear time complexity of $O (| Θ |)$ during many iterations. Then, the complexity is transformed from the power type into the linear type.

Given that the time complexity of the traditional KF is $O ({| Θ |}^{3})$ ,³² we separate risk degree set into individuals. Since all matrices are reduced to one element, the time complexity for the single BPA forecasting is $O (1)$ . Of course, the time complexity of all BPAs forecasting is $O (| Θ |)$ .

To sum up, the total time complexity of the proposed scheme is given by

O (n ϒ^{3}) + O (| Θ |) + O (| Θ |)

(33)

For comparison, the total complexity of three kinds of standard techniques is

O (n ϒ^{3}) + O (2^{| Θ |}) + O ({| Θ |}^{3})

(34)

Note that the total time complexity of the proposed scheme can be effectively saved with the increase of $| Θ |$ .

Numeric study and discussion

In this section, the reliability and efficiency of the proposed scheme are illustrated by the example of the vessel navigation risk. We use the weather receiver, navigation telex, and VTS to collect various navigational parameters in the certain waters. Since the information from the heterogeneous sensors is uncertain, the multi-information fusion is expected to yield decision with a reduction in the overall uncertainty. Considering the nonlinear SVM classification model, we use the subscript $j$ ( $j = 1, 2, 3$ ) to define three different classifiers.

Suppose that the surveillance period is 100 s, and sampling time is 1 s. For example, we use the input $x_{j i}$ ( $i = 1, 2, 3$ ) to represent various sub-factors on the 98th s in Table 1, and the referenced median $x$ from the experiments and literatures.^2,7,8

Table 1.

Raw information of sub-factors.

$j$	$i$	Category	$x_{j i}$	$x$
1	1	Visibility	30.05 km	6.00 km
	2	Wind	12.18 m/s	10.95 m/s
	3	Wave	5.47 knot	4.50 knot
2	1	Channel length	270.00 m	122.50 m
	2	Channel width	10.00 m	12.00 m
	3	Obstacle size	90.00 m	75.00 m
3	1	Channel intersections	5.00	4.00
	2	Vessel chasing	3.00 vessel	10.00 vessel
	3	Vessel density	7.80 vessel/km²	15.00 vessel/km²

After the SVM training, the sample set is input into the nonlinear SVM classification model, where the related parameters are $C = 31$ , $σ^{2} = 1$ , $n = 3$ , and $S = 3$ . Recalling Table 1, we obtain the following parameters $ρ_{i} = 1$ , $κ = 1$ , $ε_{1} = 0.20$ , $ε_{2} = 0.86$ , and $ε_{3} = 0.43$ based on the experimental statistics, which are utilized as the criterion to judge the classification efficiency. Note that the SVM classifiers have different classification accuracy $R_{j}$ from the physical characteristics of the heterogeneous sensors. In Table 2, the classifier related with the navigable sub-factor has the maximal value, which means the sub-factor applied in the VTS is more stable. By comparison, since the hydrological sub-factor changes rapidly, the weather receiver has the smallest $R_{j}$ to deal with the uncertain information. As for $A_{s}$ , the subscripts are taken to 1, 2, and $φ$ in order to represent the safe state, dangerous state, and uncertain state, respectively. Furthermore, $P_{j i} (\cdot)$ is the state probability corresponding to the ith sub-factor from the jth classifier, which indicates the initiatory navigation risk. Given that the collected data are often contaminated by the random noise, the SVM training will make the decision deviate (e.g. $A_{2}$ ) from the optimal hyperplane.

Table 2.

Proposed SVM results.

j	Probability	$A_{1}$	$A_{2}$	$R_{j}$	Proposed SVM
1	$P_{j 1} (\cdot)$	0.7316	0.2159	0.9750	$A_{1}$
	$P_{j 2} (\cdot)$	0.6845	0.3134		$A_{1}$
	$P_{j 3} (\cdot)$	0.4086	0.5452		$A_{2}$
2	$P_{j 1} (\cdot)$	0.5823	0.3443	0.9775	$A_{1}$
	$P_{j 2} (\cdot)$	0.4576	0.4378		$A_{1}$
	$P_{j 3} (\cdot)$	0.4167	0.5375		$A_{2}$
3	$P_{j 1} (\cdot)$	0.7355	0.2044	0.9800	$A_{1}$
	$P_{j 2} (\cdot)$	0.4257	0.5172		$A_{2}$
	$P_{j 3} (\cdot)$	0.6528	0.2967		$A_{1}$

SVM: support vector machine.

Furthermore, the standard SVM results are shown in Table 3, which are the hard-output corresponding to the initial classification. In this table, there are four unexpected assessments (e.g. $A_{2}$ ). From Tables 2 and 3, we note that the assessment results of the standard SVM are more unstable than that of the proposed SVM classification model, that is, the number of $A_{2}$ is larger. Through analysis, the important stage is to train the SVM to obtain the classifier based on the individual sub-factor. In practical applications, the sub-factors contain man-made error or random noise. Different sub-factors in the input information may lead to influence on the assessment results. On the other hand, different training strategies may classify the same sub-factor as different classes due to the individual perspectives. As a result, the misclassifications are still remained. Using the adaptively slack variable, the proposed SVM classification model can adjust the training and test stages, and can remove some errors that affect on the accuracy of correct classification information. However, with respect to two kinds of single SVM above, we cannot directly make comments on the navigation risk only based on $P_{j i} (\cdot)$ because there exist unexpected results. Therefore, we will combine the proposed SVM with the optimal D-S evidence combination rule.

Table 3.

Standard SVM results.

j	Probability	$A_{1}$	$A_{2}$	$R_{j}$	Standard SVM
1	$P_{j 1} (\cdot)$	0.7113	0.2221	0.9750	$A_{1}$
	$P_{j 2} (\cdot)$	0.6759	0.3024		$A_{1}$
	$P_{j 3} (\cdot)$	0.3984	0.5316		$A_{2}$
2	$P_{j 1} (\cdot)$	0.5869	0.3543	0.9775	$A_{1}$
	$P_{j 2} (\cdot)$	0.4452	0.4507		$A_{2}$
	$P_{j 3} (\cdot)$	0.4062	0.5504		$A_{2}$
3	$P_{j 1} (\cdot)$	0.7310	0.2019	0.9800	$A_{1}$
	$P_{j 2} (\cdot)$	0.4229	0.5223		$A_{2}$
	$P_{j 3} (\cdot)$	0.6589	0.2859		$A_{1}$

SVM: support vector machine.

As for the D-S combination rule, we have in hand the parameter $Θ = 3$ . Suppose that $m_{j s} (\cdot)$ denotes the BPA of the jth classifier and ith sub-factor, then the BPA results are shown in Table 4. Note that the averaged BPAs are $\bar{m} (A_{1}) = 0.5533$ , $\bar{m} (A_{2}) = 0.3710$ , and $\bar{m} (A_{φ}) = 0.0757$ . We cannot make reliable decision because both $\bar{m} (A_{1}) < 2 / 3$ and $\bar{m} (A_{2}) \approx 1 / 3$ represent unstable decision in the practical applications.

Table 4.

BPA results.

BPA	$A_{1}$	$A_{2}$	$A_{φ}$
$m_{11} (\cdot)$	0.7133	0.2105	0.0762
$m_{12} (\cdot)$	0.6674	0.3056	0.0270
$m_{13} (\cdot)$	0.3984	0.5316	0.0700
$m_{21} (\cdot)$	0.5692	0.3374	0.0934
$m_{22} (\cdot)$	0.4473	0.4290	0.1237
$m_{23} (\cdot)$	0.4069	0.5267	0.0664
$m_{31} (\cdot)$	0.7208	0.2003	0.0789
$m_{32} (\cdot)$	0.4172	0.5069	0.0759
$m_{33} (\cdot)$	0.6397	0.2908	0.0695
$\bar{m} (\cdot)$	0.5533	0.3710	0.0757

BPA: basic probabilistic assignment.

Table 5 gives the fused BPAs and final results. Since the maximal value of $m_{2}$ is less than 2/3, the single BPA cannot represent the potential navigation risk, whereas $m (A_{1}) = 0.9798$ approximates 1 with the decrease of $m (A_{φ})$ . The final result is in line with the actual situation.

Table 5.

BPA and combination results.

BPA	$A_{1}$	$A_{2}$	$A_{φ}$	D-S
$m_{1} (\cdot)$	0.8467	0.1527	0.0006	$A_{1}$
$m_{2} (\cdot)$	0.5736	0.4221	0.0042	–
$m_{3} (\cdot)$	0.8653	0.1328	0.0019	$A_{1}$
$\bar{m} (\cdot)$	0.7619	0.2359	0.0022	$A_{1}$
$m (\cdot)$	0.9798	0.0200	0.0002	$A_{1}$

BPA: basic probabilistic assignment; D-S: Dempster–Shafer.

Figure 1 demonstrates the calculated and predicted values of the fused BPAs during the whole surveillance. The initial values are 1, 0, and 0 corresponding to ${\hat{m}}_{0 | 0} (A_{1})$ , ${\hat{m}}_{0 | 0} (A_{2})$ , and ${\hat{m}}_{0 | 0} (A_{φ})$ , respectively. Other parameters are given by

F (A_{1}) = F (A_{2}) = F (A_{φ}) = 1

H (A_{1}) = H (A_{2}) = H (A_{φ}) = 1

P_{0 | 0} (A_{1}) = P_{0 | 0} (A_{2}) = P_{0 | 0} (A_{φ}) = 10^{- 4}

\begin{matrix} Q_{0 | 0} (A_{1}) = 7 \times 10^{- 7}, Q_{0 | 0} (A_{1}) = 5 \times 10^{- 7}, \\ and Q_{0 | 0} (A_{φ}) = 6.5 \times 10^{- 7} \end{matrix}

Figure 1.

Prediction of BPA.

In Figure 1, we note that the fluctuation of the forecasting results is obviously small, which can be explained that the KF provides the reliable forecasting information with the smaller error covariance. Therefore, the solid lines in this figure can apply the vessel navigation risk forecasting at the next time.

Table 6 shows the comparison results of the standard SVM classification model, D-S evidence theory, and proposed scheme. As seen, the latter method has higher accuracy than others. The reason is that a single classifier is affected by the conflicting evidences. When the D-S combination rule is directly applied, it is also difficult to construct a more reasonable BPA. In the proposed scheme, the nonlinear SVM classifier gives the initial classification, and then some uncertain information is corrected based on the optimal D-S combination rule. Combined with many multi-source information fusion techniques, the averaged assessment accuracy of the proposed scheme is higher than other two independent methods.

Table 6.

Comparison of averaged assessment accuracy.

State	SVM	D-S	Proposed scheme
Safety	0.9207	0.8857	0.9836
Danger	0.9036	0.8634	0.9650
Mean	0.9122	0.8745	0.9743

SVM: support vector machine; D-S: Dempster–Shafer.

Although the timely vessel navigation risk assessment is necessary, the risk forecasting is of great significance in the navigation engineering. We consider the overall performance of the risk forecasting in two aspects: both reliability and efficiency. Table 7 presents the averaged forecasting performance of the standard SVM/D-S/KF, SVM/D-S/BPNN,³³ AHP,⁷ and the proposed scheme. It can be found that the forecasting accuracy of the first method is the lowest due to the propagation of the BPA error in the multi-dimensional model. The BPNN of three-input-layer, eight-hidden-layer, and three-output-layer has the similar reliability with the proposed scheme. The reason is that the hidden layers reduce the BPA error propagation, and the individual KF with its filtering parameters has distinguished BPA. Obviously, the AHP method can sufficiently give the forecasting values because the subjective weights from experts affect the final results. However, different experts may make different scores on various sub-factors. The weights must be adjusted promptly, or the final result will diverge. As for the proposed scheme, the averaged forecasting accuracy is satisfactory without any experts’ experience.

Table 7.

Comparison of averaged forecasting accuracy.

State	Standard SVM/D-S/KF	SVM/D-S/BPNN	AHP	Proposed scheme
Safety	0.9350	0.9593	0.9603	0.9627
Danger	0.9188	0.9457	0.9479	0.9429
Mean	0.9269	0.9525	0.9541	0.9528

SVM: support vector machine; D-S: Dempster–Shafer; KF: Kalman filter; BPNN: back propagation neural network; AHP: analytic hierarchy process.

Finally, Table 8 shows the complexity comparison of different methods under the different detailed parameters, which are adjusted based on the practical applications. The number n of the classifiers is 2 or 3, that is, there are at least two classifiers corresponding to the mentioned heterogeneous sensors. However, the number $ϒ$ of the support vectors per classifier is taken to 3, which means the associated sub-factors are maintained. Especially, we increase the size $| Θ |$ of the risk degree set to 5 in order to achieve five risk levels (trivial state, tolerable state, moderate state, substantial state, and intolerable state). When $| Θ |$ is unchanged, the time complexity of the proposed scheme is minimal with the increasing n. When n is unchanged, the proposed scheme keeps the smallest fluctuation against other methods with the increasing $| Θ |$ . In addition, the time complexity of the BPNN approximates the product of the size of risk set and the number of nodes in the hidden layer (eight nodes). In view of the AHP approach, the eigenvalue of the high-order matrix is necessary when getting the consistency ratio. Usually, the complexity of computing eigenvalue is proportional to the cubic of the number of sub-factors. Therefore, the proposed scheme can complete the satisfactory assessment and forecasting with the low complexity.

Table 8.

Complexity comparison of different methods under the different parameters.

Parameter	Standard SVM/D-S/KF	SVM/D-S/BPNN	AHP	Proposed scheme
$\begin{matrix} n = 2 \\ ϒ = 3 \\ \| Θ \| = 3 \end{matrix}$	$\begin{matrix} O (54) \\ + O (8) \\ + O (27) \end{matrix}$	$\begin{matrix} O (54) \\ + O (8) \\ + O (24) \end{matrix}$	$O (216)$	$\begin{matrix} O (54) \\ + O (3) \\ + O (3) \end{matrix}$
$\begin{matrix} n = 3 \\ ϒ = 3 \\ \| Θ \| = 3 \end{matrix}$	$\begin{matrix} O (81) \\ + O (8) \\ + O (27) \end{matrix}$	$\begin{matrix} O (81) \\ + O (8) \\ + O (24) \end{matrix}$	$O (729)$	$\begin{matrix} O (81) \\ + O (3) \\ + O (3) \end{matrix}$
$\begin{matrix} n = 2 \\ ϒ = 3 \\ \| Θ \| = 5 \end{matrix}$	$\begin{matrix} O (54) \\ + O (32) \\ + O (125) \end{matrix}$	$\begin{matrix} O (54) \\ + O (32) \\ + O (40) \end{matrix}$	$O (216)$	$\begin{matrix} O (54) \\ + O (5) \\ + O (5) \end{matrix}$
$\begin{matrix} n = 3 \\ ϒ = 3 \\ \| Θ \| = 5 \end{matrix}$	$\begin{matrix} O (81) \\ + O (32) \\ + O (125) \end{matrix}$	$\begin{matrix} O (81) \\ + O (32) \\ + O (40) \end{matrix}$	$O (729)$	$\begin{matrix} O (81) \\ + O (5) \\ + O (5) \end{matrix}$

SVM: support vector machine; D-S: Dempster–Shafer; KF: Kalman filter; BPNN: back propagation neural network; AHP: analytic hierarchy process.

Conclusion

This article developed an innovative scheme based on the improved multi-source information fusion techniques in order to provide the reliable assessment and forecasting results. Given that some available samples in the training set are misplaced on the wrong side by accident, we derive the nonlinear SVM model to adaptively classify them. Given that the standard D-S evidence theory cannot provide the effective combination result for the conflicting evidences, the optimal combination rule is presented with the lower time cost. As an important part of the proposed scheme, the vessel navigation risk forecasting is achieved with the low-dimensional KF. Finally, the assessment results are discussed to verify the reliability and efficiency of the proposed scheme. As for the future developments, we continue to systematically integrate each technique in the proposed frame in order to reduce the time complexity. Especially, we will further enhance the forecasting accuracy using the adaptive KF estimation.

Footnotes

Handling Editor: Janos Botzheim

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by the National Natural Science Foundation of China (grant no. 51679116), the Innovative Talents Support Plan of Colleges and Universities of Liaoning Province (grant no. LR2017068), the Doctoral Scientific Research Foundation Guidance Project of Liaoning Province (grant no. 201601343), and the Program for Liaoning Innovative Research Team in University (grant no. LT2016006).

References

IMO. Formal safety assessment–decision parameters including risk acceptance criteria. London: International Maritime Organization, 2000.

IACS. A guide to risk assessment in ship operations. London: International Association of Classification Societies, 2012.

Akyildiz

Mentes

. An integrated risk assessment based on uncertainty analysis for cargo vessel safety. Safety Sci 2017; 92(2): 34–43.

Pang

. An approach of vessel collision risk assessment based on the D-S evidence theory. Ocean Eng 2013; 74(7): 16–21.

Chen

Shiotani

Sasa

. Numerical ship navigation based on weather and ocean simulation. Ocean Eng 2013; 69(9): 44–53.

Hao

L. A study of ship integrated navigation system risk assessment based on fuzzy analytic hierarchy process. In: Proceedings of the international conference on educational and network technology, Qinhuangdao, China, 25–27 June 2010, pp.305–308. New York: IEEE.

Yan

. Study on information fusion in traffic systems. Beijing, China: China Science Publishing, 2016.

. Pre-evaluation on navigation safety in Tianjin Port compound seaway. Master’s Thesis, Department of Communication and Transportation Engineering, Dalian Maritime University, Dalian, 2010.

Zhu

. Extended Dempster-Shafer combination rules based on random set theory. P SPIE 2004; 5434: 112–120.

10.

Mahler

. Advances in statistical multisource-multitarget information fusion. Norwood: Aretch House, 2014.

11.

Blasch

Dezert

Pannetier

. Overview of Dempster-Shafer and belief function tracking methods. P SPIE 2014; 8745: 241–253.

12.

Zhang

Ding

et al . An improved Dempster-Shafer approach to construction safety risk perception. Knowl-Based Syst 2017; 132: 30–46.

13.

Ortiz

Colomo

González

BJG

. Dempster-Shafer theory based ship-ship collision probability modelling. In: Moreno-Díaz

Pichler

Quesada-Arencibia

. (eds) Computer aided systems theory (Lecture Notes in Computer Science), Heidelberg: Springer, 2014, pp.63–70.

14.

. The research on financial crisis prediction based on DS evidence theory and SVM ensemble. Master’s Thesis, Southeast University, Nanjing, China, 2016.

15.

Qiao

et al . Weed recognition based on SVM-DS multi-feature fusion. Trans Chin Soc Agric Mach 2013; 44(2): 182–187.

16.

Vapnik

. Statistical learning theory. New York: Wiley, 1998.

17.

Boser

Guyon

Vapnik

N. A training algorithm for optimal margin classifiers. In: Proceedings of the 5th ACM workshop computing learning theory, Pittsburgh, PA, 27–29 July 1992, pp.144–152. New York: ACM.

18.

Song

Xie

. Robust support vector machine with bullet hole image classification. IEEE T Syst Man Cyb 2002; 32(4): 440–448.

19.

Tan

Shen

R. Data-driven detection and diagnosis on the navigation states of surface vessels. In: Proceedings of the 2017 seventh international conference on information science and technology, Da Nang, Vietnam, 16–19 April 2017, pp.404–410. New York: IEEE.

20.

Wang

Z. Vessel traffic flow forecasting with the combined model based on support vector machine. In: Proceedings of the 2015 international conference on transportation information and safety, Wuhan, China, 25–28 June 2015, pp.695–698. New York: IEEE.

21.

Berbić

Ocvirk

Carević

. Application of neural networks and support vector machine for significant wave height prediction. Oceanologia 2017; 59(3): 331–349.

22.

Lei

Wang

. Approach of information fusion and classification by SVM and DS evidence theory. Comput Eng Appl 2013; 49(11): 114–117.

23.

Liu

Tong

. Optimal control-based adaptive NN design for a class of nonlinear discrete-time block-triangular systems. IEEE T Cybernetics 2016; 46(11): 2670–2680.

24.

Liu

Zeng

Wang

. Complete stability of delayed recurrent neural networks with Gaussian activation functions. Neural Networks 2017; 85: 21–32.

25.

Wen

Chen

CLP

Liu

et al . Neural network-based adaptive leader-following consensus control for a class of nonlinear multiagent state-delay systems. IEEE T Cybernetics 2017; 47: 2151–2160.

26.

Jiang

. Multi-data fusion fault diagnosis method based on SVM and evidence theory. Chin J Sci Instrum 2010; 31(8): 1378–1743.

27.

Burges

CJC

. A tutorial on support vector machines for pattern recognition. Data Min Knowl Disc 1998; 2(2): 121–167.

28.

Pang

Liang

et al . Improved interactive multiple model filter for maneuvering target tracking. In: Proceedings of the 33rd Chinese control conference, Nanjing, China, 28–30 July 2016, pp.7312–7316. New York: IEEE.

29.

Bar-Shalom

Kirubarajan

. Estimation with applications to tracking and navigation. New York: John Wiley & Sons, 2001.

30.

Bordes

Ertekin

Weston

et al . Fast kernel classifiers with online and active learning. J Mach Learn Res 2005; 6(6): 1579–1619.

31.

Quost

. Classifier fusion in the Dempster-Shafer framework using optimized t-norm based combination rule. Int J Approx Reason 2011; 52(3): 353–374.

32.

Cao

Zhang

et al . Low complexity and high accurate estimation scheme for doubly selective fading channels with square root Kalman filtering. In: Proceedings of the IEEE/CIC international conference on communications in China, Chengdu, China, 27–29 July 2016, pp.1–6. New York: IEEE.

33.

Liu

Yang

. Traffic target recognition in traffic surveillance system based on neural network and D-S evidence theory. Comput Simul 2010; 27(9): 295–298.