# Sea Clutter Suppression Method of HFSWR Based on RBF Neural Network Model Optimized by Improved GWO Algorithm

Authors: Shang Shang; Kang-Ning He; Zhao-Bin Wang; Tong Yang; Ming Liu; Xiang Li
Journal: Computational Intelligence and Neuroscience
 (2020)

---

## Abstract

The detection performance of high-frequency surface-wave radar (HFSWR) is closely related to the suppression effect of sea clutter. To effectively suppress sea clutter, a sea clutter suppression method based on radial basis function neural network (RBFNN) optimized by improved gray wolf optimization (IGWO) algorithm is proposed. Firstly, according to shortcomings of the standard gray wolf optimization (GWO) algorithm, such as slow convergence speed and easily getting into local optimum, an adaptive division of labor search strategy is proposed, which makes the population have abilities of both large-scale search and local exploration in the entire optimization process. Then, the IGWO algorithm is used to optimize RBFNN, finally, establishing a sea clutter prediction model (IGWO-RBFNN) and realizing the prediction and suppression of sea clutter. Experiments show that the IGWO algorithm has significantly improved convergence speed and optimization accuracy. Compared with the particle swarm algorithm with linear decreasing weight strategy (LDWPSO) and the GWO algorithm, the RBFNN prediction model optimized by the IGWO algorithm has higher prediction accuracy and has a better suppression effect on sea clutter of HFSWR.


---

## Body

## 1. Introduction

High-frequency surface-wave radar (HFSWR) transmits high-frequency (3–30 MHz) electromagnetic waves with vertical polarization antenna, and short waves propagate along the surface of the conductive ocean without being affected by the curvature of the Earth. It can achieve all-weather and over-horizon detection of maritime targets, such as vessels and low-flying aircraft [1–3]. Nowadays, HFSWR is widely used in coastal warning, maritime rescue, marine resource development, and many other fields, and it plays an important role in military and civilian areas [4–6]. Also, a series of innovative research on radar systems made by Ranger, the marine traffic detection EU project, makes the long-distance maritime surveillance radar have a better practical effect [7, 8].When HFSWR is used to detect marine targets, the resonance effect between electromagnetic waves and ocean waves will produce a large number of interference signals, namely, “sea clutter.” The first-order componen clutter superposing in the echo often submerges some target signals, so the effective suppression of sea clutter becomes the key to the accurate detection of marine targets [9, 10]. The multitarget tracking algorithm based on deep learning has made great achievements in sea target detection [11, 12]. However, from the perspective of signal processing, it is still an urgent problem to eliminate sea clutter from measured signals. At present, the suppression methods of sea clutter mainly include the cyclic iterative cancellation method [13–15], subspace estimation method [16–18], and neural network method [19–21]. The cyclic iterative cancellation method constructs sinusoidal signals by estimating parameters and then subtracts the sinusoidal signals from the echo to realize the sea clutter suppression. The iterative steps of this method are set through experience, which is likely to cause some problems of incomplete suppression of sea clutter and false cancellation of target signals. The subspace estimation method realizes the suppression of sea clutter through its clustering characteristics in the subspace. However, existing suppression methods based on subspace estimation are likely to cause the problem of target spectral peak migration and affect the detection of target signals [22]. The theoretical basis of applying neural network methods is the chaotic characteristic of sea clutter [23, 24]. It is probable to predict and suppress sea clutter accurately if we can learn its inherent dynamics laws. On this basis, the nonlinear prediction equation of sea clutter was proposed by Haykin [25], and scholars want to approximate this complex mapping relationship by establishing neural network models, to realize the prediction and suppression of sea clutter. At present, the deep learning method is booming, and it has made a series of encouraging results in machine vision and engineering applications [26, 27]. In terms of interdisciplinary, deep learning also makes a lot of outstanding contributions with its advantages [28, 29]. Deep learning methods are mainly used in the field of image processing, which needs a lot of training data and a large amount of calculation. This paper aims at the signal field, unlike the image field, which involves a large amount of data, so a shallow neural network is adopted. Because of its simple structure and strong nonlinear mapping ability, the radial basis function neural network (RBFNN) becomes the preference to learn the sea clutter prediction equation. The initial parameters of the network will affect the final prediction accuracy of the model, so it is necessary to optimize them effectively. At present, various metaheuristic algorithms have achieved good results in optimizing the initial parameters of RBFNN [30–32]. The gray wolf optimization (GWO) algorithm was proposed by Mirjalili et al. in 2014 [33], and it has the advantages of fewer adjustment parameters and fast convergence speed [34, 35], compared with other optimization algorithms. However, when facing multimodal functions, it is likely to fall into the local optimal, and its convergence speed and optimization ability are still inadequate [36].This paper presents a sea clutter suppression method based on an improved GWO (IGWO) algorithm optimizing RBFNN. With greatly improved in convergence speed and the precision of optimization, the IGWO algorithm can significantly optimize RBFNN, which contributes to upgrading the prediction accuracy of sea clutter. Compared with the RBFNN prediction model optimized by the LDWPSO and GWO algorithms, the model proposed in this paper can save calculation time or energy, and it has a better suppression effect on sea clutter.


## 2. GWO Algorithm and Its Improvement

### 2.1. Standard GWO Algorithm

The mathematical model of the GWO algorithm is established by imitating the hunting methods of the gray wolf population in nature. During the whole hunting process, all gray wolf individuals are divided into four categories, namely,α,β,δ, and ω. Under the leadership of α-wolf, the population approaches the prey in an organized way and then surrounds and attacks the prey. In the mathematical model, the position vector of each gray wolf individual is a solution in the solution space. The schematic diagram of the GWO algorithm for optimizing is shown in Figure 1.Figure 1
The schematic diagram of gray wolves for optimizing.Assuming that the population size is N and the dimension of the search space isD, the position vector of the ith gray wolf is Xi=xi1,xi2,…,xiD. The position updating formulas of gray wolves are given by(1)Dα=C1⋅Xαt−Xt,Dβ=C2⋅Xβt−Xt,Dδ=C3⋅Xδt−Xt,(2)X1t+1=Xαt−A1⋅Dα,X2t+1=Xβt−A2⋅Dβ,X3t+1=Xδt−A3⋅Dδ,(3)Xt+1=X1t+1+X2t+1+X3t+13,where Xt represents the current position of the ω-wolf, Xαt,Xβt, and Xδt represent the positions of α,β, and δ wolves, and A and C are random coefficient vectors:(4)A=a2r1−1,C=2r2,where r1 and r2 are random number vectors between [0, 1] and a is the convergence factor. The population can search in any direction around the optimal value because of A and C [37]. The position vector of the last generation α-wolf is the global optimal solution.In the GWO algorithm, the convergence factors of gray wolves follow the same decreasing strategy. In the early stage, all individuals are used in a large-scale search, which makes the population lack the ability of fine searching and the search space is easily missed; in the later period, all individuals are used in local exploration, which makes the information of the surrounding solution space be ignored, and this is likely to fall into the local optimal. During the entire iteration process, the population cannot search by a division of labor and cannot balance the ability of large-scale search and local exploration, which has a bad effect on the overall performance of the algorithm.


### 2.2. Improved GWO Algorithm

To increase the flexibility of searching, the population is divided into two subpopulations adaptively, implementing different convergence factor strategies, respectively. We set the fitness thresholdε, and the population is divided into elite wolves and nonelite wolves by ε, and the threshold expression is given by(5)ε=μ⋅1N∑i=1Nfi,where μ represents the screening weight, which is used to control the number of elite gray wolves, and fi represents the current fitness value of the ith gray wolf. If the fitness value is less than the threshold, it is classified as an elite gray wolf, otherwise, it is classified as a nonelite gray wolf.The elite gray wolves are closer to the global optimum, so the local search should be kept, and the strategy of convergence factor is given by (6); the nonelite gray wolves should keep searching in a wide range because it is far away from the global optimum, and the strategy of convergence factor is given by(6)a1=1−t⋅1tmax,(7)a2=2−t⋅1tmax,where t represents the current iteration step and tmax represents the maximum iteration steps. To ensure that most individuals can conduct a large-scale search in the early stage and most of them can invest in local exploration in the later stage, we set a dynamic screening weight strategy, which given by(8)μ=μmin+μmax−μmin⋅ttmax,where μmax is the maximum screening weight, with a value of 0.8, and μmin is the minimum screening weight, with a value of 0.2. The IGWO algorithm is given in Figure 2.Figure 2
The flowchart of IGWO algorithm.The fitness average in each generation is different, and the fitness threshold changes adaptively along with the fitness average. There is always a clear division of labor within the population, which improves the search flexibility.


### 2.3. The Performance Test of IGWO Algorithm

We choose six test functions to test the performance of the IGWO algorithm. To test the generalization ability of the IGWO algorithm, the test functions selected include three categories:F1 and F2 are unimodal functions; F3 and F4 are multimodal functions; F5 and F6 are fixed-dimension multimodal functions. The basic information of test functions is given in Table 1.Table 1
Basic information of test functions.
FunctionsDimensionRangeFminF1x=∑i=1nxi230[−100, 100]0F2x=maxixi,1≤i≤n30[−100, 100]0F3x=∑i=1n−xisinxi30[−500, 500]−2094.91F4x=∑i=1nxi2−10cos2πxi+1030[−5.12, 5.12]0F5x=−∑i=14ciexp−∑j=16aijxj−pij26[0, 1]−3.32F6x=−∑i=15X−aiX−aiT+ci−14[0, 10]−10.40Particle swarm optimization is a classic intelligent optimization algorithm with a simple structure and fast search speed. To test the performance of the IGWO algorithm, the particle swarm optimization with linearly decreasing weight (LDWPSO) [38] and the GWO algorithm are used as comparison algorithms. We set the population size to 30 and the maximum iteration steps to 500. Figure 3 shows the convergence curves of the optimization algorithms in solving test functions.Figure 3
Images of test functions and their convergence curves: (a–f) test functionsF1–F6 and their convergence curves optimized by three optimization algorithms.
(a)(b)(c)(d)(e)(f)From the experimental results, the IGWO algorithm has outstanding performance in various test functions. The IGWO algorithm has fast convergence and high accuracy when solving test functions. To eliminate the influence of randomness on the experimental results, 60 experiments are conducted for each algorithm, and the average and standard deviation of the results are taken. The experimental results are given in Table2.Table 2
Results of different algorithms for solving test functions.
FunctionsPSOGWOIGWOAveStdAveStdAveStdF12.02E − 43.86E − 41.34E − 272.81E − 277.98E − 463.97E − 45F21.150.226.89E − 75.91E − 71.05E − 111.85E − 11F3−5051.811288.74−5875.91781.83−4823.45666.83F454.5615.992.583.450.802.64F5−3.280.06−3.270.07−3.300.05F6−7.843.04−8.132.98−9.202.28Analyzing the data in Table2, among the three algorithms, the results calculated by the IGWO algorithm are closer to the minimum value of test functions, so the IGWO algorithm has higher optimization accuracy. Also, the standard deviation of the calculation results of the IGWO algorithm is significantly smaller than that of the comparison algorithms in all kinds of test functions, which shows that the IGWO algorithm has less volatility and stronger stability.


## 2.1. Standard GWO Algorithm

The mathematical model of the GWO algorithm is established by imitating the hunting methods of the gray wolf population in nature. During the whole hunting process, all gray wolf individuals are divided into four categories, namely,α,β,δ, and ω. Under the leadership of α-wolf, the population approaches the prey in an organized way and then surrounds and attacks the prey. In the mathematical model, the position vector of each gray wolf individual is a solution in the solution space. The schematic diagram of the GWO algorithm for optimizing is shown in Figure 1.Figure 1
The schematic diagram of gray wolves for optimizing.Assuming that the population size is N and the dimension of the search space isD, the position vector of the ith gray wolf is Xi=xi1,xi2,…,xiD. The position updating formulas of gray wolves are given by(1)Dα=C1⋅Xαt−Xt,Dβ=C2⋅Xβt−Xt,Dδ=C3⋅Xδt−Xt,(2)X1t+1=Xαt−A1⋅Dα,X2t+1=Xβt−A2⋅Dβ,X3t+1=Xδt−A3⋅Dδ,(3)Xt+1=X1t+1+X2t+1+X3t+13,where Xt represents the current position of the ω-wolf, Xαt,Xβt, and Xδt represent the positions of α,β, and δ wolves, and A and C are random coefficient vectors:(4)A=a2r1−1,C=2r2,where r1 and r2 are random number vectors between [0, 1] and a is the convergence factor. The population can search in any direction around the optimal value because of A and C [37]. The position vector of the last generation α-wolf is the global optimal solution.In the GWO algorithm, the convergence factors of gray wolves follow the same decreasing strategy. In the early stage, all individuals are used in a large-scale search, which makes the population lack the ability of fine searching and the search space is easily missed; in the later period, all individuals are used in local exploration, which makes the information of the surrounding solution space be ignored, and this is likely to fall into the local optimal. During the entire iteration process, the population cannot search by a division of labor and cannot balance the ability of large-scale search and local exploration, which has a bad effect on the overall performance of the algorithm.


## 2.2. Improved GWO Algorithm

To increase the flexibility of searching, the population is divided into two subpopulations adaptively, implementing different convergence factor strategies, respectively. We set the fitness thresholdε, and the population is divided into elite wolves and nonelite wolves by ε, and the threshold expression is given by(5)ε=μ⋅1N∑i=1Nfi,where μ represents the screening weight, which is used to control the number of elite gray wolves, and fi represents the current fitness value of the ith gray wolf. If the fitness value is less than the threshold, it is classified as an elite gray wolf, otherwise, it is classified as a nonelite gray wolf.The elite gray wolves are closer to the global optimum, so the local search should be kept, and the strategy of convergence factor is given by (6); the nonelite gray wolves should keep searching in a wide range because it is far away from the global optimum, and the strategy of convergence factor is given by(6)a1=1−t⋅1tmax,(7)a2=2−t⋅1tmax,where t represents the current iteration step and tmax represents the maximum iteration steps. To ensure that most individuals can conduct a large-scale search in the early stage and most of them can invest in local exploration in the later stage, we set a dynamic screening weight strategy, which given by(8)μ=μmin+μmax−μmin⋅ttmax,where μmax is the maximum screening weight, with a value of 0.8, and μmin is the minimum screening weight, with a value of 0.2. The IGWO algorithm is given in Figure 2.Figure 2
The flowchart of IGWO algorithm.The fitness average in each generation is different, and the fitness threshold changes adaptively along with the fitness average. There is always a clear division of labor within the population, which improves the search flexibility.


## 2.3. The Performance Test of IGWO Algorithm

We choose six test functions to test the performance of the IGWO algorithm. To test the generalization ability of the IGWO algorithm, the test functions selected include three categories:F1 and F2 are unimodal functions; F3 and F4 are multimodal functions; F5 and F6 are fixed-dimension multimodal functions. The basic information of test functions is given in Table 1.Table 1
Basic information of test functions.
FunctionsDimensionRangeFminF1x=∑i=1nxi230[−100, 100]0F2x=maxixi,1≤i≤n30[−100, 100]0F3x=∑i=1n−xisinxi30[−500, 500]−2094.91F4x=∑i=1nxi2−10cos2πxi+1030[−5.12, 5.12]0F5x=−∑i=14ciexp−∑j=16aijxj−pij26[0, 1]−3.32F6x=−∑i=15X−aiX−aiT+ci−14[0, 10]−10.40Particle swarm optimization is a classic intelligent optimization algorithm with a simple structure and fast search speed. To test the performance of the IGWO algorithm, the particle swarm optimization with linearly decreasing weight (LDWPSO) [38] and the GWO algorithm are used as comparison algorithms. We set the population size to 30 and the maximum iteration steps to 500. Figure 3 shows the convergence curves of the optimization algorithms in solving test functions.Figure 3
Images of test functions and their convergence curves: (a–f) test functionsF1–F6 and their convergence curves optimized by three optimization algorithms.
(a)(b)(c)(d)(e)(f)From the experimental results, the IGWO algorithm has outstanding performance in various test functions. The IGWO algorithm has fast convergence and high accuracy when solving test functions. To eliminate the influence of randomness on the experimental results, 60 experiments are conducted for each algorithm, and the average and standard deviation of the results are taken. The experimental results are given in Table2.Table 2
Results of different algorithms for solving test functions.
FunctionsPSOGWOIGWOAveStdAveStdAveStdF12.02E − 43.86E − 41.34E − 272.81E − 277.98E − 463.97E − 45F21.150.226.89E − 75.91E − 71.05E − 111.85E − 11F3−5051.811288.74−5875.91781.83−4823.45666.83F454.5615.992.583.450.802.64F5−3.280.06−3.270.07−3.300.05F6−7.843.04−8.132.98−9.202.28Analyzing the data in Table2, among the three algorithms, the results calculated by the IGWO algorithm are closer to the minimum value of test functions, so the IGWO algorithm has higher optimization accuracy. Also, the standard deviation of the calculation results of the IGWO algorithm is significantly smaller than that of the comparison algorithms in all kinds of test functions, which shows that the IGWO algorithm has less volatility and stronger stability.


## 3. Sea Clutter Suppression with IGWO-RBFNN Model

### 3.1. Construction of IGWO-RBFNN Prediction Model

The interior of sea clutter is a deterministic complex dynamical system. If the intrinsic dynamical law of sea clutter can be learned, we can realize the accurate prediction and suppression of sea clutter. To fully demonstrate the internal law of sea clutter, we extend the one-dimensional time series to higher dimensions based on phase space reconstruction theory. On this basis, Haykin proposed the prediction equation of sea clutter [25]:(9)xi+mτ=fxi,xi+1,…,xi+mτ−1,where m and τ are reconstruction parameters of phase space, which represent embedding dimension and time delay, respectively.We use RBFNN to learn the complex mapping relationship of the prediction equation. RBFNN is a simple three-layer structure, and the inputX=xi,xi+1,…,xi+mτ−1 and the output is x^i+mτ. Gaussian kernel function maps the input layer to the hidden layer, and the output of the kth hidden layer node is shown in(10)GkX=exp−X−Ck22σk2,where Ck and σk are the center and width of the hidden layer node, respectively. The hidden layer and the output layer are connected by the network weight ω, and the output of the network is given by(11)Y=∑k=1nωk⋅GkX,where n represents the number of hidden layers. The network structure of RBFNN is given in Figure 4.Figure 4
The structure of RBFNN.The initial parameters of the network include the data centerC, the data width σ, and the network weight ω. The selection of the initial parameters will affect the accuracy of the network, so we use the IGWO algorithm to optimize the initial parameters of the network. The fitness function of the IGWO algorithm is given by(12)F=∑i=1SYi−Y^i2S,where S represents the number of samples when calculating the fitness value and Yi and Y^i represent the expected output and predicted output of the network. The process of establishing the sea clutter prediction model is shown in Figure 5.Step 1: determine the topology of the network and encode initial parameters into the position vector of gray wolf individualsStep 2: initialize population with the chaos method, use IGWO algorithm to find the optimal solution, and save position vector of theα-wolf in the last generationStep 3: decode the saved position vector as the optimal initial parameter of the networkStep 4: normalize sea clutter time series without targets to construct training samples of the neural networkStep 5: train the network until it reaches the preset precision or the maximum number of training steps and finally obtain the sea clutter prediction model of IGWO-RBFNNFigure 5
Establishment of the sea clutter prediction model.The prediction accuracy of the prediction model is evaluated byρ:(13)ρ=1−varerrvarY×100%.In the formula,var⋅ represents variance, err represents errors between the output value and observed value, and Y represents the observed value of sea clutter.


### 3.2. Suppression of Sea Clutter

The sea conditions in the same maritime space are similar, and the internal dynamic system of sea clutter generated by resonance between electromagnetic waves and sea waves at different distances is also similar. We use a prediction model to predict radar echoes of the adjacent unit and then realize the suppression of sea clutter by subtracting predicted value from radar echo data. The suppression process is shown in Figure6.Figure 6
The flowchart of sea clutter suppression.The dynamic characteristics of sea clutter in radar echo are different from that of target signals. The prediction model can only predict sea clutter, and the target signal becomes the main component of prediction error. After subtracting the predicted value from radar echo, the target signal is left, and the sea clutter suppression of radar echo containing target signals is realized.


## 3.1. Construction of IGWO-RBFNN Prediction Model

The interior of sea clutter is a deterministic complex dynamical system. If the intrinsic dynamical law of sea clutter can be learned, we can realize the accurate prediction and suppression of sea clutter. To fully demonstrate the internal law of sea clutter, we extend the one-dimensional time series to higher dimensions based on phase space reconstruction theory. On this basis, Haykin proposed the prediction equation of sea clutter [25]:(9)xi+mτ=fxi,xi+1,…,xi+mτ−1,where m and τ are reconstruction parameters of phase space, which represent embedding dimension and time delay, respectively.We use RBFNN to learn the complex mapping relationship of the prediction equation. RBFNN is a simple three-layer structure, and the inputX=xi,xi+1,…,xi+mτ−1 and the output is x^i+mτ. Gaussian kernel function maps the input layer to the hidden layer, and the output of the kth hidden layer node is shown in(10)GkX=exp−X−Ck22σk2,where Ck and σk are the center and width of the hidden layer node, respectively. The hidden layer and the output layer are connected by the network weight ω, and the output of the network is given by(11)Y=∑k=1nωk⋅GkX,where n represents the number of hidden layers. The network structure of RBFNN is given in Figure 4.Figure 4
The structure of RBFNN.The initial parameters of the network include the data centerC, the data width σ, and the network weight ω. The selection of the initial parameters will affect the accuracy of the network, so we use the IGWO algorithm to optimize the initial parameters of the network. The fitness function of the IGWO algorithm is given by(12)F=∑i=1SYi−Y^i2S,where S represents the number of samples when calculating the fitness value and Yi and Y^i represent the expected output and predicted output of the network. The process of establishing the sea clutter prediction model is shown in Figure 5.Step 1: determine the topology of the network and encode initial parameters into the position vector of gray wolf individualsStep 2: initialize population with the chaos method, use IGWO algorithm to find the optimal solution, and save position vector of theα-wolf in the last generationStep 3: decode the saved position vector as the optimal initial parameter of the networkStep 4: normalize sea clutter time series without targets to construct training samples of the neural networkStep 5: train the network until it reaches the preset precision or the maximum number of training steps and finally obtain the sea clutter prediction model of IGWO-RBFNNFigure 5
Establishment of the sea clutter prediction model.The prediction accuracy of the prediction model is evaluated byρ:(13)ρ=1−varerrvarY×100%.In the formula,var⋅ represents variance, err represents errors between the output value and observed value, and Y represents the observed value of sea clutter.


## 3.2. Suppression of Sea Clutter

The sea conditions in the same maritime space are similar, and the internal dynamic system of sea clutter generated by resonance between electromagnetic waves and sea waves at different distances is also similar. We use a prediction model to predict radar echoes of the adjacent unit and then realize the suppression of sea clutter by subtracting predicted value from radar echo data. The suppression process is shown in Figure6.Figure 6
The flowchart of sea clutter suppression.The dynamic characteristics of sea clutter in radar echo are different from that of target signals. The prediction model can only predict sea clutter, and the target signal becomes the main component of prediction error. After subtracting the predicted value from radar echo, the target signal is left, and the sea clutter suppression of radar echo containing target signals is realized.


## 4. Experiment and Results Analysis

### 4.1. Analysis of Prediction Effect of Sea Clutter

A batch of HFSWR sea clutter measured data is used for simulation experiments. The operating frequency of radar is 3.7 MHz, and the sampling interval is 0.149 seconds. The radar echo signal is complex, so it is necessary to establish prediction models for the real part and the imaginary part (I channel and Q channel), respectively. Here, we take the prediction of real data as an example.Reconstruction parameters of phase space are calculated by the C-C algorithm [39], and we get time delay τ=4 and embedding dimension m=3, so the input number of the network is mτ=12. Besides, we set the number of hidden layer nodes to 4. To optimize the initial parameters of the network with different optimization algorithms, we set the population size to 25, the number of iteration steps to 300, and the convergence curve of the fitness value is given in Figure 7.Figure 7
Convergence curves of fitness values.It can be seen from Figure7 that the IGWO algorithm has the fastest convergence speed and the highest precision for optimization among three optimization algorithms.The sea clutter data without target signals in the 48th distance unit is used to construct training data, and 800 groups of training samples are used to train the neural network for 1000 times with an accuracy of 0.0001. The unoptimized network model is the RBFNN model, and the LDWPSO-RBFNN model, the GWO-RBFNN model, and the IGWO-RBFNN model can be obtained through using the LDWPSO algorithm, the GWO algorithm, and the IGWO algorithm to optimize RBFNN. The sea clutter data without target signals in the 54th distance unit is used as test data, and each model is trained independently for 50 times to predict the test data, the experimental results are shown in Table3. The data compared in the table includes the minimum fitness values (FV) of optimization algorithms, the standard deviation of fitness value (FSTD), the average time used in optimizing network (AVT), and the prediction accuracy (PA) of models.Table 3
Results of optimizing models and predicting data.
ModelsFVFSTDAVT (s)PA (%)RBFNN———85.22LDWPSO-RBFNN4.30E − 31.65E − 472.7588.92GWO-RBFNN3.14E − 31.53E − 466.5489.82IGWO-RBFNN2.30E − 31.06E − 462.8193.49As shown in Table3, the minimum fitness value and its standard deviation of the IGWO-RBFNN model are the smallest. The IGWO algorithm has the highest accuracy and the best stability in the optimization of the network. Also, the calculation speed of the IGWO algorithm has been improved. In this experiment, the calculation speed of the IGWO algorithm is 9.94 seconds faster than the LDWPSO algorithm. Because the RBFNN model is not optimized, the prediction accuracy is the lowest. The IGWO-RBFNN has the highest prediction accuracy, which is 8.27% higher than the RBFNN model, reaching 93.49%. The background noise of sea clutter accounts for most of the prediction errors.


### 4.2. Comparison and Analysis of Sea Clutter Suppression Effect

For the data of the imaginary part, prediction models are constructed in the same way. Trained prediction models are used to predict and suppress sea clutter in the 54th distance unit without target signals. The effect of sea clutter suppression is evaluated by the overall decline of echo power and the highest amplitude decline in the Doppler spectrum. The result is shown in Table4.Table 4
Suppression effect of different models on sea clutter.
ModelsPower decline (%)Amplitude decline (dB)RBFNN81.4615LDWPSO-RBFNN82.2119GWO-RBFNN82.9520IGWO-RBFNN83.4523In Table4, the suppression effect of the IGWO-RBFNN model is the best among four models, whether from the perspective of power or the perspective of amplitude. After suppressed by the IGWO-RBFNN model, the maximum amplitude of sea clutter in the Doppler spectrum is reduced by 23 dB. However, after suppressed by the RBFNN model, the maximum amplitude of sea clutter is only reduced by 15 dB, which is 8 dB less than the suppression effect of the IGWO-RBFNN model. Also, the IGWO-RBFNN method reduces the overall power of sea clutter by 83.45%, which is the most prominent among comparison methods. A local magnification of sea clutter suppression effects by different methods is shown in Figure 8.Figure 8
Suppression effect of different models on sea clutter.It can be seen from Figure8 that the amplitude of sea clutter is significantly reduced after suppressed by the IGWO-RBFNN model, which is basically equal to the amplitude of background noise. However, after suppressed by other models, the sea clutter still has residual. Next, simulated target signals are added to the radar echo of the 54th distance unit, using the IGWO-RBFNN model to suppress sea clutter in radar echo containing target signals. The distance of Doppler frequency between sea clutter and target signal is 0.35 Hz and 0.09 Hz, respectively. The suppression effect of the IGWO-RBFNN model on sea clutter is shown in Figure 9.Figure 9
The suppression effect of IGWO-RBFNN model on sea clutter. (a) The distance of Doppler frequency between sea clutter and analog target signal is 0.35 Hz; (b) The distance of Doppler frequency between sea clutter and analog target signal is 0.09 Hz.
(a)(b)As shown in the calculation results, after using the IGWO-RBFNN model to suppress sea clutter, the signal to clutter plus noise ratio (SCNR) is improved by 5.68 dB and 4.49 dB, respectively. Experimental results show that the IGWO-RBFNN model can effectively suppress sea clutter and retain target signals. After suppressing sea clutter, the target signal can be effectively highlighted.


## 4.1. Analysis of Prediction Effect of Sea Clutter

A batch of HFSWR sea clutter measured data is used for simulation experiments. The operating frequency of radar is 3.7 MHz, and the sampling interval is 0.149 seconds. The radar echo signal is complex, so it is necessary to establish prediction models for the real part and the imaginary part (I channel and Q channel), respectively. Here, we take the prediction of real data as an example.Reconstruction parameters of phase space are calculated by the C-C algorithm [39], and we get time delay τ=4 and embedding dimension m=3, so the input number of the network is mτ=12. Besides, we set the number of hidden layer nodes to 4. To optimize the initial parameters of the network with different optimization algorithms, we set the population size to 25, the number of iteration steps to 300, and the convergence curve of the fitness value is given in Figure 7.Figure 7
Convergence curves of fitness values.It can be seen from Figure7 that the IGWO algorithm has the fastest convergence speed and the highest precision for optimization among three optimization algorithms.The sea clutter data without target signals in the 48th distance unit is used to construct training data, and 800 groups of training samples are used to train the neural network for 1000 times with an accuracy of 0.0001. The unoptimized network model is the RBFNN model, and the LDWPSO-RBFNN model, the GWO-RBFNN model, and the IGWO-RBFNN model can be obtained through using the LDWPSO algorithm, the GWO algorithm, and the IGWO algorithm to optimize RBFNN. The sea clutter data without target signals in the 54th distance unit is used as test data, and each model is trained independently for 50 times to predict the test data, the experimental results are shown in Table3. The data compared in the table includes the minimum fitness values (FV) of optimization algorithms, the standard deviation of fitness value (FSTD), the average time used in optimizing network (AVT), and the prediction accuracy (PA) of models.Table 3
Results of optimizing models and predicting data.
ModelsFVFSTDAVT (s)PA (%)RBFNN———85.22LDWPSO-RBFNN4.30E − 31.65E − 472.7588.92GWO-RBFNN3.14E − 31.53E − 466.5489.82IGWO-RBFNN2.30E − 31.06E − 462.8193.49As shown in Table3, the minimum fitness value and its standard deviation of the IGWO-RBFNN model are the smallest. The IGWO algorithm has the highest accuracy and the best stability in the optimization of the network. Also, the calculation speed of the IGWO algorithm has been improved. In this experiment, the calculation speed of the IGWO algorithm is 9.94 seconds faster than the LDWPSO algorithm. Because the RBFNN model is not optimized, the prediction accuracy is the lowest. The IGWO-RBFNN has the highest prediction accuracy, which is 8.27% higher than the RBFNN model, reaching 93.49%. The background noise of sea clutter accounts for most of the prediction errors.


## 4.2. Comparison and Analysis of Sea Clutter Suppression Effect

For the data of the imaginary part, prediction models are constructed in the same way. Trained prediction models are used to predict and suppress sea clutter in the 54th distance unit without target signals. The effect of sea clutter suppression is evaluated by the overall decline of echo power and the highest amplitude decline in the Doppler spectrum. The result is shown in Table4.Table 4
Suppression effect of different models on sea clutter.
ModelsPower decline (%)Amplitude decline (dB)RBFNN81.4615LDWPSO-RBFNN82.2119GWO-RBFNN82.9520IGWO-RBFNN83.4523In Table4, the suppression effect of the IGWO-RBFNN model is the best among four models, whether from the perspective of power or the perspective of amplitude. After suppressed by the IGWO-RBFNN model, the maximum amplitude of sea clutter in the Doppler spectrum is reduced by 23 dB. However, after suppressed by the RBFNN model, the maximum amplitude of sea clutter is only reduced by 15 dB, which is 8 dB less than the suppression effect of the IGWO-RBFNN model. Also, the IGWO-RBFNN method reduces the overall power of sea clutter by 83.45%, which is the most prominent among comparison methods. A local magnification of sea clutter suppression effects by different methods is shown in Figure 8.Figure 8
Suppression effect of different models on sea clutter.It can be seen from Figure8 that the amplitude of sea clutter is significantly reduced after suppressed by the IGWO-RBFNN model, which is basically equal to the amplitude of background noise. However, after suppressed by other models, the sea clutter still has residual. Next, simulated target signals are added to the radar echo of the 54th distance unit, using the IGWO-RBFNN model to suppress sea clutter in radar echo containing target signals. The distance of Doppler frequency between sea clutter and target signal is 0.35 Hz and 0.09 Hz, respectively. The suppression effect of the IGWO-RBFNN model on sea clutter is shown in Figure 9.Figure 9
The suppression effect of IGWO-RBFNN model on sea clutter. (a) The distance of Doppler frequency between sea clutter and analog target signal is 0.35 Hz; (b) The distance of Doppler frequency between sea clutter and analog target signal is 0.09 Hz.
(a)(b)As shown in the calculation results, after using the IGWO-RBFNN model to suppress sea clutter, the signal to clutter plus noise ratio (SCNR) is improved by 5.68 dB and 4.49 dB, respectively. Experimental results show that the IGWO-RBFNN model can effectively suppress sea clutter and retain target signals. After suppressing sea clutter, the target signal can be effectively highlighted.


## 5. Conclusion

According to the sea clutter suppression in target detection of HFSWR, this paper proposes a sea clutter suppression method based on the RBFNN optimized by improved GWO algorithm. Through the establishment of the IGWO-RBFNN prediction model, the sea clutter is predicted and suppressed.The division of labor search strategy proposed by the IGWO algorithm makes the population have both large-scale search and local exploration capabilities, which improves the convergence speed and reduces the probability of falling into local optimum. In the solution of six test functions, the mean value and standard deviation of the calculation results of the IGWO algorithm are smaller than those of the comparison algorithms, and the accuracy and stability of optimization are improved.Using the IGWO algorithm to optimize parameters of the network, the calculation time is reduced by 9.94 seconds compared with the LDWPSO algorithm. After the suppression of the IGWO-RBFNN method, the maximum amplitude of sea clutter in the Doppler spectrum is reduced by 23 dB, which is 3 dB more than the optimal result of comparison methods. After suppressing sea clutter of two radar echoes containing target signals by the IGWO-RBFNN method, the SCNR increases by 5.68 dB and 4.49 d, respectively. The above results show that the improved optimization algorithm increases calculation speed. Furthermore, compared with RBFNN, LDWPSO-RBFNN, and GWO-RBFNN models, the IGWO-RBFNN model has a better suppression effect on sea clutter, has better highlight target signals, and provides a good prospect of application in sea clutter suppression.



---

*Source: 8842390-2020-11-16.xml*