<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Mar. Sci.</journal-id>
<journal-title>Frontiers in Marine Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Mar. Sci.</abbrev-journal-title>
<issn pub-type="epub">2296-7745</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fmars.2023.1113224</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Marine Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Data augmentation and deep neural network classification based on ship radiated noise</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Xie</surname>
<given-names>Zhuofan</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2122240"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Lin</surname>
<given-names>Rongbin</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2120318"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Lingzhe</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Anmin</given-names>
</name>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Lin</surname>
<given-names>Jiaqing</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Tang</surname>
<given-names>Xiaoda</given-names>
</name>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Shenzhen Research Institute of Xiamen University</institution>, <addr-line>Shenzhen</addr-line>, <country>China</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>School of Informatics, Xiamen University</institution>, <addr-line>Xiamen</addr-line>, <country>China</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>School of Electronic Science and Engineering (National Model Microelectronics College), Xiamen University</institution>, <addr-line>Xiamen</addr-line>, <country>China</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>Key Laboratory of Southeast Coast Marine Information Intelligent perception and Application, Ministry of Natural Resources</institution>, <addr-line>Xiamen</addr-line>, <country>China</country>
</aff>
<aff id="aff5">
<sup>5</sup>
<institution>School Marine Science and Technology, Tianjin University</institution>, <addr-line>Tianjin</addr-line>, <country>China</country>
</aff>
<aff id="aff6">
<sup>6</sup>
<institution>Department of R&amp;D, Xiamen Weilai Marine Science and Technology Ltd.</institution>, <addr-line>Xiamen, Fujian</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: Xuebo Zhang, Northwest Normal University, China</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Xin Qing, Harbin Engineering University, China; Haocai Huang, Zhejiang University, China</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Rongbin Lin, <email xlink:href="mailto:rblin@xmu.edu.cn">rblin@xmu.edu.cn</email>
</p>
</fn>
<fn fn-type="other" id="fn002">
<p>This article was submitted to Ocean Observation, a section of the journal Frontiers in Marine Science</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>07</day>
<month>02</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>10</volume>
<elocation-id>1113224</elocation-id>
<history>
<date date-type="received">
<day>01</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>03</day>
<month>01</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Xie, Lin, Wang, Zhang, Lin and Tang</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Xie, Lin, Wang, Zhang, Lin and Tang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Various types of ships sail at sea, and identifying maritime ship types through shipradiated noise is one of the tasks of ocean observation. The ocean environment is complex and changeable, such rapid environmental changes underline the difficulties of obtaining a huge amount of samples. Meanwhile, the length of each sample has a decisive influence on the classification results, but there is no universal sampling length selection standard.</p>
</sec>
<sec>
<title>Methods</title>
<p>This study proposes an effective framework for ship-radiated noise classification. The framework includes: i) A comprehensive judgment method based on multiple features for sample length selecting. ii) One-dimensional deep convolution generative adversarial network (1-DDCGAN) model to augment the training datasets for small sample problem. iii) One-dimensional convolution neural network (CNN) trained by generated data and real data for ship-radiated noise classification. On this basis, a onedimensional residual network (ResNet) is designed to improve classification accuracy.</p>
</sec>
<sec>
<title>Results</title>
<p>Experiments are performed to verify the proposed framework using public datasets. After data augmentation, statistical parameters are used to measure the similarity between the original samples and the generated samples. Then, the generated samples are integrated into the training set. The convergence speed of the network is clearly accelerated, and the classification accuracy is significantly improved in the one-dimensional CNN and ResNet.</p>
</sec>
<sec>
<title>Discussion</title>
<p>In this study, we propose an effective framework for the lack of scientific sample length selection and lack of sample number in the classification of ship-radiated noise, but there aret still some problems: high complexity, structural redundancy, poor adaptability, and so on. They are also long-standing problems in this field that needs to be solved urgently.</p>
</sec>
</abstract>
<kwd-group>
<kwd>ship-radiated noise</kwd>
<kwd>data augmentation</kwd>
<kwd>generative adversarial network</kwd>
<kwd>deep learning</kwd>
<kwd>target classification</kwd>
</kwd-group>
<contract-sponsor id="cn001">Special Project for Marine Economy Development of Guangdong Province<named-content content-type="fundref-id">10.13039/100016098</named-content>
</contract-sponsor>
<contract-sponsor id="cn002">Ministry of Natural Resources of the People's Republic of China<named-content content-type="fundref-id">10.13039/100015809</named-content>
</contract-sponsor>
<counts>
<fig-count count="11"/>
<table-count count="4"/>
<equation-count count="8"/>
<ref-count count="34"/>
<page-count count="12"/>
<word-count count="6088"/>
</counts>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>Ship-radiated noise is the unavoidable noise emitted by ships during movement. Traditional classification for ship-radiated noise mainly relies on the artificial extraction of features, such as time, frequency and time-frequency domain characteristics <xref ref-type="bibr" rid="B27">Zhang et&#xa0;al. (2020a)</xref>.</p>
<p>Ship-radiated noise is generally modelled as a composition of mechanical, hydrodynamic and propeller noise components <xref ref-type="bibr" rid="B26">Yan et&#xa0;al. (2021)</xref>; <xref ref-type="bibr" rid="B30">Zhang and Yang (2022)</xref>. Mechanical noise is generated by diesel engines, the generators and air condition units, and mainly comprises line spectra <xref ref-type="bibr" rid="B34">Zhang et&#xa0;al. (2020b)</xref>. Hydrodynamic noise is a time-stationary signal with a continuous spectrum. Considered environmental noise, as well as multi-path and Doppler effects in the propagation process, which make ship-radiation noise an unstable process with nonlinear, non-Gaussian and non-stationary characteristics <xref ref-type="bibr" rid="B32">Zhang et&#xa0;al. (2022b)</xref>.</p>
<p>With the development of noise reduction technology, the distinguishing features have been significantly weakened, which increases the difficulty of collecting data. Meanwhile, the sample size in existing publicly available dataset is small. Most researchers commonly use feature extraction algorithms to solve this problem <xref ref-type="bibr" rid="B18">Qi et&#xa0;al. (2020)</xref>; <xref ref-type="bibr" rid="B28">Zhang et&#xa0;al. (2021)</xref>. In this paper, on the basis of traditional feature extraction and data augmentation <xref ref-type="bibr" rid="B7">Ian et&#xa0;al. (2014)</xref>, a new idea of noise data augmentation is proposed to deal with the problem of small sample sizes in ship-radiated noise classification.</p>
<p>Traditional approaches in ship-radiated noise classification with small sample size are based on an analysis of machine learning <xref ref-type="bibr" rid="B12">Li et&#xa0;al. (2019)</xref>; <xref ref-type="bibr" rid="B24">Xie et&#xa0;al. (2020)</xref>. The core steps are to extract the features of the signal, increase the differences between different samples, and use these features to identify or classify signals <xref ref-type="bibr" rid="B17">Pethiyagoda et&#xa0;al. (2018)</xref>. In earlier works, researches classify the signal using amplitude and frequency content <xref ref-type="bibr" rid="B25">Yang et&#xa0;al. (2021)</xref>. Based on the difficulties of effective features extracting, some researchers start to use artificial feature extraction techniques, such as principal component analysis <xref ref-type="bibr" rid="B23">Wei (2016)</xref>.</p>
<p>In <xref ref-type="bibr" rid="B12">Li et&#xa0;al. (2019)</xref>, Support vector machine (SVM) is used for ship classifying because its ability to perform non-linear classification. In <xref ref-type="bibr" rid="B24">Xie et&#xa0;al. (2020)</xref>, permutation entropy is combined with the normalized correlation coefficient and enhanced variational mode decomposition, and an SVM is used to classify three types of ships. In <xref ref-type="bibr" rid="B8">Jiao et&#xa0;al. (2021)</xref>, fluctuation-based dispersion entropy is combined with intrinsic time-scale decomposition, and SVM is used for classification. The common classification methods are compared in <xref ref-type="table" rid="T1">
<bold>Table&#xa0;1</bold>
</xref>. GAN is proposed by Goodfellow et&#xa0;al. <xref ref-type="bibr" rid="B7">Ian et&#xa0;al. (2014)</xref> for solving the imbalanced data problem. It is used in many fields <xref ref-type="bibr" rid="B1">Arniriparian et&#xa0;al. (2018)</xref>. In <xref ref-type="bibr" rid="B2">Atanackovic et&#xa0;al. (2020)</xref>, authors use GAN to augment ship-radiated noise data. In this study, we augment ship-radiated noise data using GAN models to obtain sufficiently similar and diverse samples.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Comparison of common ship-radiated noise classification methods.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="center">Classification Method</th>
<th valign="top" align="center">Feature Engineering</th>
<th valign="top" align="center">Drawbacks</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="center">Statistical analyze</td>
<td valign="top" align="center">Time-frequency features</td>
<td valign="top" align="center">High complexity, low adaptability</td>
</tr>
<tr>
<td valign="top" align="center">Machine learning</td>
<td valign="top" align="center">Principle component analysis</td>
<td valign="top" align="center">High feature extraction difficulties</td>
</tr>
<tr>
<td valign="top" align="center">Deep learning</td>
<td valign="top" align="center">Neural network</td>
<td valign="top" align="center">Large demand for data volume</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>With the development of neural networks in recent years, faster convergence times and higher accuracy have been achieved. This requires large amounts of balanced data to fully train the deep network structures. Some researchers have focused on manually extracted features combined with SVMs for ship-radiated noise classification <xref ref-type="bibr" rid="B14">Li and Yang (2021)</xref>. If the number of samples is small or there is a big gap in the proportion of different samples, then there will be reduced classification accuracy <xref ref-type="bibr" rid="B4">Buda et&#xa0;al. (2018)</xref>. When considering a one-dimensional speech signal, the length of the sample needs to be considered <xref ref-type="bibr" rid="B33">Zhang et&#xa0;al. (2022c)</xref>. Under normal circumstances, collected ship-radiated noise is a piece of audio, which needs to be split, and thus the appropriate length of each sample needs to be determined. In this paper, we propose a comprehensive judgment method based on multiple features to select an appropriate sample length. The model used for data augmentation and the deep neural networks are designed with the selected sample length.</p>
<p>In <xref ref-type="bibr" rid="B16">Pan et&#xa0;al. (2019)</xref>, two ways are proposed for the optimization GAN models: architecture optimization and objective function optimization. Convolutional neural networks (CNNs) are a kind of network that can adaptive extract the characteristics of the signal <xref ref-type="bibr" rid="B31">Zhang et&#xa0;al. (2022a)</xref>. Moreover, there are also deep features extracted by convolution that cannot be easily extracted manually. For the above reasons, we choose convolution-based GANs for structural optimization. Convolution-based GANs are a development of CNNs, and DCGAN is one of the main models used <xref ref-type="bibr" rid="B1">Arniriparian et&#xa0;al. (2018)</xref>. However, these GAN models are mostly used in the two-dimensional image processing domain. Based on DCGAN, in this paper we propose a one-dimensional DCGAN (1-DDCGAN) to generate ship-radiated noise samples.</p>
<p>In summary, in this paper, by using the public dataset ShipsEar <xref ref-type="bibr" rid="B21">Santos-Dom&#xed;nguez et&#xa0;al. (2016)</xref>, we propose a data augmentation method with a comprehensive length select algorithm. Then, construct a deep neural framework for ship classification. The main contributions can be summarized as follows:</p>
<list list-type="order">
<list-item>
<p>A new classification method is proposed, which is based on deep neural network classification combined with data augmentation. The proposed method is capable of performing accurate classification in the presence of small numbers of training samples.</p>
</list-item>
<list-item>
<p>We propose a decision-level fusion method to select sample length and combine 1-DDCGAN and ResNet for data augmentation and feature classification without manual feature extraction. The convergence time is reduced <xref ref-type="bibr" rid="B24">Xie et&#xa0;al. (2020)</xref> and the classification accuracy is improved <xref ref-type="bibr" rid="B10">Li et&#xa0;al. (2017)</xref>; <xref ref-type="bibr" rid="B12">Li et&#xa0;al. (2019)</xref>.</p>
</list-item>
<list-item>
<p>The performance of the proposed method is verified using experimental data <xref ref-type="bibr" rid="B21">Santos-Dom&#xed;nguez et&#xa0;al. (2016)</xref>. First, data augmentation is carried out and the generated sample is mixed with the original in different proportions to increase the number of sample in training sets. From using only the original sample to a ratio of the original sample to the generated sample being 1:2, the classification rate in CNN improved from 79% to 90%, while the classification rate in ResNet improved from 87.5% to 99.17%.</p>
</list-item>
</list>
<p>The overall approach is shown in <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref>. The rest of this paper is organized as follows. In Section 2, we discuss cepstrum coefficients and entropy characteristics. Then, an SVM is used for classification in order to determine the appropriate sample length. A 1-DDCGAN is then designed and the generated augmentation data are analyzed in Section 3. Section 4 describes merging the real and generated data in different proportions, and the classification accuracy under these training sets is compared. Conclusions are provided in Section 5.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>General algorithm framework.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g001.tif"/>
</fig>
</sec>
<sec id="s2">
<label>2</label>
<title>Sample length selection of ship-radiated noise</title>
<p>The cepstrum coefficients and entropy features reflect different aspects of the signal characteristics. In order to extract different aspects of the information contained in the signal, we select the appropriate sampling length according to the contribution of these characteristics in the classification process. The details are shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref>.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>Sample length selection algorithm framework.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g002.tif"/>
</fig>
<p>Mel-frequency cepstrum coefficient (MFCC)-based features reflect the timbre of the signal <xref ref-type="bibr" rid="B15">Noda et&#xa0;al. (2019)</xref>, while Gammatone cepstrum coefficients (GFCC)-based features reflect the robustness, the degree of influence of data disturbance, noise, and outliers in the model <xref ref-type="bibr" rid="B29">Zhang et&#xa0;al. (2018)</xref>. On the other hand, entropy-based features describe the extent of signal regularity, which can be useful for the classification of nonlinear non-stationary ship-radiated noise. These characteristics can be used to measure the amount of information contained in the sample from many aspects. Sample entropy measures the complexity of a time series by measuring the probability of encountering new patterns in the signal <xref ref-type="bibr" rid="B20">Richman et&#xa0;al. (2004)</xref>. Specifically, dispersion entropy is more suitable for long signals and represents the amplitude characteristics of the signals. Multi-scale weighted permutation entropy can retain the amplitude information of the signal when calculating the sequential mode of the time series <xref ref-type="bibr" rid="B22">Shi et&#xa0;al. (2021)</xref>. Since these features reflect different characteristics of signals, we selected them for comprehensive consideration and selection of an appropriate sample length of ship-radiated noise. Meanwhile, when the GAN is used for sample generation, GAN uses random noise as input to generate, longer inputs require longer iteration times, so longer sample lengths lead to longer computation times. The purpose of sample length selection is to determine the optimal trade-off between having sufficient features while maintaining the computational load to a minimum.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Cepstrum coefficient characteristics</title>
<p>MFCC is a characteristic parameter based on the characteristics of simulated acoustic signals passing through the cochlea <xref ref-type="bibr" rid="B13">Lin et&#xa0;al. (2021)</xref>. The Mel scale describes the nonlinear characteristics of human ear frequencies, and MFCC is the cepstrum coefficient extracted under the nonlinear characteristics of this frequency. The relationship between frequency and the Mel scale can be approximated using the following equation:</p>
<disp-formula>
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mn>2595</mml:mn>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>g</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>+</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo stretchy="false">/</mml:mo>
<mml:mn>700</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>f</italic> is the frequency of the signal, while the other fixed parameters are derived from the cochlea. The specific steps of the algorithm are shown in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>:</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>MFCC algorithm flow chart.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g003.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>, the signal is pre-weighted through a high-pass filter and divided into frames with a length of 256, while a Hamming window is applied to each frame to enhance the continuity at both ends. Next, a fast Fourier transform is applied on these frames, which then pass through the triangular filter banks based on the Mel scale. After that, the logarithmic energy of each filter output is calculated and the discrete cosine transform (DCT) is applied to finally obtain MFCC feature.</p>
<p>The Gammatone filter simulates the spectrum analysis and frequency selection characteristic of human ears to achieve strong noise resistance and maintain good classification performance in environments with strong interference. It is a bandpass filter, defined in time domain as:</p>
<disp-formula>
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mi>A</mml:mi>
<mml:msup>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>b</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mi>cos</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mi>t</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>&#x3d5;</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula><p>where <italic>n</italic> is the filter order, <italic>A</italic> is the filter gain, <italic>b</italic> is the filter attenuation factor, <italic>f<sub>c</sub>
</italic> is the center frequency, and &#x3c6; is the filter phase.</p><p>A Gammatone filter bank is formed using a series of Gammatone filter combinations with different center frequencies [282018Zhang et&#xa0;al.Zhang, Wu, Wang, Wang, Wang, and Zhang]. The center frequencies are first obtained by dividing the equivalent bandwidth scale in equal parts, and are then mapped to a linear scale to determine the center frequency of each Gammatone filter. After that, the characteristic GFCC parameters can be obtained using a logarithmic operation and the DCT. The detailed process is shown in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>GFCC algorithm flow chart.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g004.tif"/>
</fig>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Entropy feature</title>
<p>In this section, we describe sample entropy, dispersion entropy and multi-scale weighted permutation entropy.</p>
<sec id="s2_2_1">
<label>2.2.1</label>
<title>Sample entropy</title>
<p>Sample entropy is a nonlinear entropy metric commonly used to describe complexity <xref ref-type="bibr" rid="B20">Richman et&#xa0;al. (2004)</xref>. Sample entropy measures the likelihood of the occurrence of a new pattern in a time series, that is, it is a prediction of the amplitude distribution of future signals based on the current amplitude distribution. In essence, it is the quantification of the complexity and regularity of a sequence. The algorithm is described in <xref ref-type="statement" rid="st1">Algorithm 1</xref>.</p>
<statement id="st1">
<label>Algorithm 1Sample Entropy.</label>
<p>
<preformat>
<bold>Input:</bold> Time signal <italic>X</italic>(<italic>i</italic>), <italic>i</italic> = 1, 2, ...,<italic>N</italic>, embedding dimension <italic>m</italic>, threshold value <italic>r</italic> <bold>Output:</bold> <italic>SampleEn</italic> (<italic>m,r</italic>)
1Form a set of vector sequences of dimension m according to the sequence number, <italic>X<sub>m</sub>
</italic>(1),&#x2026;,<italic>X</italic>
<sub>m</sub>(<italic>N</italic> &#x2013; <italic>m</italic> + 1), where <italic>X<sub>m</sub>
</italic>(<italic>i</italic>) = <italic>x</italic>(<italic>i</italic>), <italic>x</italic>(<italic>i</italic>+1),&#x2026;,<italic>x</italic>(<italic>i</italic> + 1),&#x2026;,x(i + <italic>m</italic>&#x2013;1),1&#x2264; <italic>i &#x2264;N</italic>&#x2013;<italic>m</italic>+1, and these vectors represent the values of m consecutive x&#x2019;s starting from the i-th point. ;<italic>2Definethe distance between X<sub>m</sub>
</italic> (<italic>i</italic>) and <italic>X<sub>m</sub>
</italic>(<italic>j</italic>) as <italic>d<sub>ij</sub>
</italic>, which is the absolute value of the largest difference between them: <italic>d<sub>ij</sub>
</italic> = <italic>d</italic>[<italic>X<sub>m</sub>
</italic>(<italic>i</italic>), <italic>X<sub>m</sub>
</italic>(<italic>j</italic>)] = <italic>max<sub>k-0.1,&#x2026;,m-</sub>
</italic>
<sub>1</sub>[|<italic>x</italic>(<italic>i</italic>+<italic>k</italic>)&#x2013;<italic>x</italic>(<italic>j</italic>+<italic>k</italic>)|];
3<bold>for</bold> <italic>m or m</italic>+<italic>1</italic> <bold>do</bold>
4&#x2003;&#x2003;Given <italic>X<sub>m</sub>
</italic>(<italic>i</italic>), count the number of <italic>j</italic> whose distance between <italic>X<sub>m</sub>
</italic>(<italic>i</italic>) and <italic>X<sub>m</sub>
</italic>(<italic>j</italic>) is less than or equal to <italic>r</italic> and denote it as <italic>B<sub>i</sub>
</italic>, define <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:msubsup>
<mml:mtext>B</mml:mtext>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow><mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula></named-content> when 1&lt;<italic>i&lt;N&#x2013;m</italic>;
5&#x2003;&#x2003;Calculate<named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im2">
<mml:mrow>
<mml:msup>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:msub>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:msubsup>
<mml:mi>B</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content>
6<bold>end</bold>
7Obtain sample entropy <named-content content-type="inline-equation"><inline-formula>
<mml:math display="block" id="im3">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mi>lim</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2192;</mml:mo>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo> <mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mtext>In</mml:mtext>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mi>B</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow> <mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula></named-content>
</preformat>
</p>
</statement>
</sec>
<sec id="s2_2_2">
<label>2.2.2</label>
<title>Dispersion entropy</title>
<p>Dispersion entropy is a metric used to measure the complexity and irregularity of time series, which is sensitive to the variation of the frequency, amplitude, and time series&#x2019; bandwidth, and it does not require the sorting of the amplitude values of each embedded vector <xref ref-type="bibr" rid="B9">Li et&#xa0;al. (2022)</xref>. Because of the above characteristics, the calculation efficiency of the dispersion entropy is high. The calculation steps of dispersion entropy are given in <xref ref-type="statement" rid="st2">Algorithm 2</xref>.</p>
<statement id="st2">
<label>Algorithm 2 Dispersion Entropy.</label>
<p>
<preformat>
<bold>Input:</bold> Time signal <italic>x</italic>(<italic>i</italic>),<italic>i=</italic>1,2,&#x2026;,<italic>N</italic>, embedding dimension <italic>m</italic>, class number <italic>c</italic>, time delay <italic>d</italic>
<bold>Output:</bold> Dispersion Entropy <italic>DE</italic>(<italic>x,m,x,d</italic>)
1 Use the normal cumulative distribution function to map <italic>x</italic> to <italic>y</italic>=<italic>y<sub>j</sub>
</italic>,<italic>j</italic> = 1,2,&#x2026;,<italic>N</italic>,y<sub>j</sub> &#x2208; (0,1), using <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im4">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
<mml:msqrt>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:mrow>
<mml:munderover>
<mml:mo>&#x222b;</mml:mo>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x221e;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3bc;</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mtext>d</mml:mtext>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula></named-content> ;
2 Use a linear transformation to assign <italic>y</italic> to the range [1,2, &#x2026;,<italic>c</italic>]: <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula></named-content>;
3 Calculate the embedded vector <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im6">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>+</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>+</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula></named-content>;
4 Calculate the dispersion model <italic>&#x3c0;</italic>
<sub>
<italic>v</italic>
<sub>0</sub>,<italic>v</italic>
<sub>1</sub>
</sub>,&#x2026;,<italic>v</italic>
<sub>
<italic>m</italic>&#x2212;1</sub>(<italic>v</italic>=1,2,&#x2026;,<italic>c</italic>), if <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im7">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>+</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>c</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>v</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula></named-content>, the dispersion model corresponding to <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is <italic>&#x3c0;</italic>
<sub>
<italic>v</italic>
<sub>0</sub>,<italic>v</italic>
<sub>1,</sub>&#x2026;,<italic>v</italic>
<sub>
<italic>m</italic>&#x2212;1</sub>
</sub>;
5 Calculate the probability of each dispersion model and <italic>N</italic>
<sub>
<italic>b</italic>
</sub>(<italic>&#x3c0;</italic>
<sub>
<italic>v</italic>
<sub>0</sub>,<italic>v</italic>
<sub>1,</sub>&#x2026;,<italic>v</italic>
<sub>
<italic>m</italic>&#x2212;1</sub>
</sub>) is the number of maps from <inline-formula>
<mml:math display="inline" id="im10">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula></named-content>to <italic>&#x3c0;</italic>
<sub>
<italic>v</italic>
<sub>0</sub>,<italic>v</italic>
<sub>1,</sub>&#x2026;,<italic>v</italic>
<sub>
<italic>m</italic>&#x2212;1</sub>
</sub>;
</preformat>
</p>
</statement>
</sec>
<sec id="s2_2_3">
<label>2.2.3</label>
<title>Multi-scale weighted permutation entropy</title>
<p>Permutation entropy (PE) is suitable for time series, because it measures their randomness and detects their dynamic changes. It can be obtained at fast speeds through a comparison of neighboring values. Weighted PE (WPE) is an improved algorithm based on PE, which fully considers that the amplitude of adjacent vectors of the same order may be different. PE and WPE are already used in different fields, such as underwater acoustic signal denoising <xref ref-type="bibr" rid="B11">Li et&#xa0;al. (2018)</xref>. The detailed calculation steps are described in <xref ref-type="statement" rid="st3">Algorithm 3</xref>.</p>
<statement id="st3">
<label>Algorithm 3 Weighted Permutation Entropy.</label>
<p>
<preformat>
<bold>Input :</bold> Time signal <italic>x</italic>(<italic>i</italic>),<italic>i</italic>=1,2,&#x2026;,<italic>N</italic>, embedding dimension <italic>m</italic>, time delay <italic>&#x3c4;</italic>
<bold>Output:</bold> Weighted Permutation Entropy <italic>WPE</italic>(<italic>x, m, &#x3c4;</italic>)
1 Reconstruct time signal <italic>X<sub>i =</sub> x</italic>(<italic>i</italic>), <italic>x</italic>(i+&#x3c4;),&#x2026;,<italic>x</italic>(<italic>i</italic>+(<italic>m</italic>-1)<italic>&#x3c4;</italic>),<italic>i</italic> =1,2,&#x2026;,<italic>N</italic>-(<italic>m</italic>-1) <italic>&#x3c4;</italic>;
2 Rearrange <italic>Xi</italic> elements in increasing order: <italic>X</italic>(i) = x(i+(<italic>j</italic>
<sub>1</sub>-1) <italic>&#x3c4;</italic>)&#x2264;<italic>x</italic>(<italic>i</italic>+(j<sub>2</sub>-1) &#x3c4;)&#x2264;&#x2026;&#x2264;<italic>x</italic>(<italic>i</italic>+(<italic>j<sub>m</sub>
</italic>-1) &#x3c4;). In case of two if the rearranged elements are equal, then obtain new order: <italic>x</italic>(<italic>i</italic> + (<italic>j</italic>
<sub>1</sub>-1)&#x3c4;) &#x2264; <italic>x</italic>(<italic>i</italic>+ (<italic>j</italic>
<sub>2</sub>-1)&#x3c4;)(<italic>j</italic>
<sub>1</sub> &#x2264; j<sub>2</sub>) and obtain one of the <italic>m</italic>! symbol sequences in phase space: <italic>S</italic>(<italic>g</italic>) = (<italic>j</italic>
<sub>1</sub>,<italic>j</italic>
<sub>2</sub>,&#x2026;,<italic>j<sub>m</sub>
</italic>), <italic>j</italic> = 1,2,&#x2026;,<italic>k</italic>.<italic>k</italic> &#x2264;<italic>m</italic>!
3 If the probability distribution of the symbol sequence is <italic>P</italic>
<sub>1</sub>, <italic>P</italic>
<sub>2</sub>,&#x2026;, <italic>P<sub>k</sub>
</italic>, obtain the permutation entropy: <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:msub>
<mml:mi>H</mml:mi>
<mml:mi>p</mml:mi>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mtext>In</mml:mtext>
<mml:msup>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>!</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>g</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>k</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
<mml:mtext>&#x2009;In&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>g</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content>;
4 Calculate the weights wi of all adjacent vectors<named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im12">
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>:</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content>, <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im13">
<mml:mrow>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content>;
5 Calculate the weighted relative frequency: <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>w</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi>t</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>u</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>:</mml:mo>
<mml:mi>t</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>u</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x3a0;</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mover accent="true">
<mml:mi>X</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
<mml:msub>
<mml:mi>w</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula></named-content>;6&#xa0;Obtain&#xa0;WPE: <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im15">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:msub>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>:</mml:mo>
<mml:msubsup>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>&#x3a0;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>w</mml:mi>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content> In <named-content content-type="inline-equation"><inline-formula>
<mml:math id="im16">
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>w</mml:mi>
</mml:msub>
<mml:mo stretchy="false">(</mml:mo>
<mml:msubsup>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula></named-content>.</preformat>
</p>
</statement>
<p>The multi-scale analysis algorithm is developed by Costa, and can be used to estimate the complexity of the original data at different scales <xref ref-type="bibr" rid="B5">Chen et&#xa0;al. (2019)</xref>. Based on the concept of multi-scale analysis, multi-scale permutation entropy (MPE) is proposed by <xref ref-type="bibr" rid="B3">Aziz and Arif (2005)</xref>. The MPE algorithm is divided into two steps. The first step is the application of a coarse-grained procedure to obtain multi-scale time series from the original time series. The second step is the calculation of the WPE at each coarse-grained time series. The details of the algorithm are shown in <xref ref-type="statement" rid="st4">Algorithm 4</xref>.</p>
<statement id="st4">
<label>Algorithm 4 Multi-scale Weighted Permutation Entropy.</label>
<p>
<preformat>
<bold>Input:</bold> Time signal <italic>x</italic>(<italic>i</italic>),<italic>i</italic> = 1,2,&#x2026;,<italic>N</italic>, embedding dimension <italic>m</italic>, time delay &#x3c4;, scale factor <italic>s</italic>
<bold>Output:</bold> Dispersion Entropy <italic>MWPE</italic>(<italic>x,s,m, &#x3c4;</italic>)
1 Construct coarse-grained time series <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im17">
<mml:mrow>
<mml:msubsup>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>s</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula></named-content> at a scale factor of <italic>s</italic>: <named-content content-type="inline-equation"><inline-formula>
<mml:math display="inline" id="im18">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>:</mml:mo>
<mml:msubsup>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>s</mml:mi>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>s</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo stretchy="false">)</mml:mo>
<mml:mi>s</mml:mi>
<mml:mo>+</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mi>N</mml:mi>
<mml:mi>s</mml:mi>
</mml:mfrac>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</inline-formula></named-content></preformat>; 2 Calculate the WPE of each coarse-grained time series through <xref ref-type="statement" rid="st3"><bold>Algorithm 3</bold></xref>.;
3 Obtain MWPE<italic>: MW P E(x, s, m</italic>, <italic>&#x3c4;</italic>) = [<italic>WPE</italic>(1),&#x2026;,<italic>WPE</italic>(<italic>s</italic>).
</p>
</statement>
</sec>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Experimental results</title>
<p>In the ship-radiated noise generated by the four types of ships, we randomly selected 64 samples for each type, used 200 of the 256 samples as the training set and 56 as the test set for classification, and analyzed the classification results under different sample lengths. Support vector machine can achieve good classification results in a short time in the case of fewer samples and manual feature extraction. We used MFCC, GFCC, MWPE, SE, and DE to express different characteristics of signals for feature extraction, and the corresponding features are independently input into the SVM classifier, starting from a sample length of 100 sampling points and up to 2,500 sampling points at an interval of 100 sampling points.</p>
<p>
<xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref> shows the classification results for the above-mentioned features. In classification using MFCC, 256 or 512 sampling points are usually used as a frame when framing. We selected 256 sampling points as a basic frame. The algorithm cannot work when the sampling length is less than two basic frames, the classification rate is 0 when the sampling length is less than 500 sampling points. When the sample length increases, the classification accuracy of each feature also improves. At this time, the sample length has a greater impact on classification. The classification rate tends stabilize when the sample length is about 1,600 sampling points. We concluded that the ship-radiated noise sample at this time already contained enough information for classification. In a CNN, the time complexity of a single convolutional layer is <italic>TimeO</italic>(M<sup>2</sup> <italic>K</italic>
<sup>2</sup> <italic>C<sub>in</sub>C<sub>out</sub>
</italic>), where <italic>M</italic> is the side length of the convolution kernel; <italic>K</italic> is the side length of the convolution kernel; <italic>C<sub>in</sub>
</italic> is the number of input channels; <italic>C<sub>out</sub>
</italic> is the number of output channels; and the size of the output feature map <italic>M</italic> itself is determined by four parameters, the input matrix size <italic>X</italic>, the size of the convolution kernel <italic>K</italic>, <italic>Padding</italic>, and <italic>Stride</italic>, which are expressed as <italic>M</italic>=(<italic>X</italic>&#x2212;<italic>K</italic>+2&#x2217;<italic>Padding</italic>)/<italic>Stride</italic>+1. The space complexity of the CNN is determined by the total parameter amount and the feature map output by each layer as follows: <inline-formula>
<mml:math display="inline" id="im19">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>D</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:msup>
<mml:mi>K</mml:mi>
<mml:mrow>
<mml:msub>
<mml:mn>2</mml:mn>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
<mml:mo>&#xb7;</mml:mo>
</mml:mrow>
</mml:mstyle>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>D</mml:mi>
</mml:msubsup>
<mml:mrow>
<mml:msup>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
<mml:mo>&#xb7;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> .The total parameter amount is only related to the size of the convolution kernel <italic>K</italic>, the number of channels <italic>C</italic>, and the number of layers <italic>D</italic>; it has nothing to do with the size of the input data. The space occupation of the output feature map is related to the space size <italic>M</italic> and the number of channels <italic>C</italic>. In other words, the performances of the network are closely related to the input size. The sampling length we selected after a comprehensive analysis of multiple features is 1,600 sampling points. A sample of this size can not only reduce the time and space complexity of the network but also obtain results efficiently and prevent overfitting.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Classification results of different features.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g005.tif"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>1-DDCGAN for ship-radiated noise data augmentation</title>
<p>When training deep neural networks, too few training samples results in limited features learned by the network, making it difficult to perform more complex classification tasks. We used 1-DDCGAN to enhance the data and analyze the generated samples.</p>
<sec id="s3_1">
<label>3.1</label>
<title>1-DDCGAN structure</title>
<p>GANs provide a way to learn deep representations without extensive annotated training data by using backpropagation through a competitive process involving a pair of networks. GANs are used in a variety of applications, including image synthesis, semantic image editing, style transfer, image super-resolution, and classification <xref ref-type="bibr" rid="B1">Arniriparian et&#xa0;al. (2018)</xref>; <xref ref-type="bibr" rid="B16">Pan et&#xa0;al. (2019)</xref>. GANs are inspired by the game theory, where the generator and discriminator will compete with each other to achieve a Nash equilibrium during training. The architecture of GAN is shown in <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref>.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>GAN architecture in general.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g006.tif"/>
</fig>
<p>The function of generator <italic>G</italic> is to generate fake data to fool the discriminator as much as possible, while the discriminator <italic>D</italic> is trained to distinguish real data samples from synthesized samples. The input of the generator is a random noise vector <italic>z</italic>. The noise is mapped to a new data space through generator <italic>G</italic> to obtain a fake sample <italic>G</italic>(<italic>z</italic>), which is a multi-dimensional vector. Then, the discriminator <italic>D</italic>, which is a binary classifier, accepts either real data or fake data from generator <italic>G</italic> as an input and outputs the probability of the input being true and false. Then, the training process continues until the discriminator <italic>D</italic> cannot determine whether the data comes from the real dataset or from <italic>G</italic>. Finally, we obtained a model <italic>G</italic>, which can generate data that are similar to the real data. In prior work <xref ref-type="bibr" rid="B7">Ian et&#xa0;al. (2014)</xref>, the discriminator <italic>D</italic> is defined as a binary classifier, whose loss function is represented by the cross entropy as follows:</p>
<disp-formula>
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:msup>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>=</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:msub>
<mml:mi mathvariant="double-struck">E</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>p</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>log</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mn>2</mml:mn>
</mml:mfrac>
<mml:msub>
<mml:mi mathvariant="double-struck">E</mml:mi>
<mml:mi>z</mml:mi>
</mml:msub>
<mml:mtext>log</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>G</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <italic>x</italic> is the real sample, <italic>z</italic> is the random noise vector, <italic>G</italic>(<italic>z</italic>) are the data generated by the generator <italic>G</italic>, and <italic>E</italic> is the expectation. <italic>D</italic>(<italic>G</italic>(<italic>z</italic>)) indicates the probability that discriminator <italic>D</italic> determines the data are generated by <italic>G</italic>. The goal of <italic>D</italic> is for <italic>D</italic>(<italic>G</italic>(<italic>z</italic>)) to approach 0, while <italic>G</italic> aims to bring it closer to 1. Therefore, the loss of the generator can be derived <italic>via</italic> the discriminator <italic>D</italic>: <italic>f</italic>
<sup>(G)</sup>=-<italic>f</italic>
<sup>(D)</sup>
</p>
<p>For the above reasons, the optimization problem of GANs is transformed into the minimax game as shown below:</p>
<disp-formula>
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:munder>
<mml:mrow>
<mml:mi>min</mml:mi>
</mml:mrow>
<mml:mi>G</mml:mi>
</mml:munder>
<mml:munder>
<mml:mrow>
<mml:mi>max</mml:mi>
</mml:mrow>
<mml:mi>D</mml:mi>
</mml:munder>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>V</mml:mi>
<mml:mtext>&#x200a;</mml:mtext>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>G</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi mathvariant="double-struck">E</mml:mi>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>p</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>log</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi mathvariant="double-struck">E</mml:mi>
<mml:mrow>
<mml:mi>z</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mi>log</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>G</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The whole process of the algorithm is roughly as follows:</p>
<p>1. update the discriminator by ascending its stochastic gradient:</p>
<disp-formula>
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:mi>log</mml:mi>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>+</mml:mo>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>g</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>G</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>2. Sample mini-batch of <italic>m</italic> noise samples <italic>z</italic>
<sup>(1)</sup>, z<sup>(2)</sup>, &#x2026;,z<sup>(m)</sup>;</p>
<p>3. Update the generator by descending its stochastic gradient:</p>
<disp-formula>
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:mo>&#x2207;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mo>+</mml:mo>
<mml:mi>log</mml:mi>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>G</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>These training sessions are then alternated until equilibrium is achieved.</p>
<p>The performance of the GAN is basically determined by its structure. Due to the deficiencies of the original GANs, various derived GANs models have been proposed. DCGAN <xref ref-type="bibr" rid="B19">Radford et&#xa0;al. (2015)</xref> is based on the use of a CNN; it is regarded as an effective network model of supervised learning, and is the most common generator and discriminator structure. The general two-dimensional convolution kernel is mainly used to process images, and it is difficult to directly process the one-dimensional ship-radiated noise signal. We use a one-dimensional convolution filter to fit ship-radiated noise. The structure is illustrated in <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref>.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>One-dimensional DCGAN architecture.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g007.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Generated sample results analysis</title>
<p>Due to the non-linear, non-Gaussian and non-stationary characteristics of ship-radiated noise, it is difficult to evaluate the quality of the generated data with traditional amplitude and frequency characteristics. We used the statistical distribution characteristics of the generated data, such as Mutual information (MI) and correlation coefficient (CC), to conduct a preliminary similarity analysis of the generated samples. MI is a measure of the degree of interdependence between variables:</p>
<disp-formula>
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>I</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>;</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mtext>log</mml:mtext>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mi>p</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:math>
</disp-formula>
<p>We obtained MI between the generated samples and the original samples to measure the correlation between the samples. CC is the coefficient of correlation between different statistics:</p>
<disp-formula>
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mtext>Cov</mml:mtext>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>x</mml:mi>
</mml:msub>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>y</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where Cov(X,Y) is the covariance, and &#x3c3; is the standard deviation. Fifty pairs of samples are randomly selected from the original samples and the generated samples, and the average values of the MI and CC are calculated. The specific results are shown in <xref ref-type="table" rid="T2">
<bold>Tables&#xa0;2</bold>
</xref>, <xref ref-type="table" rid="T3">
<bold>3</bold>
</xref>.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Mutual information results.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="center">MI</th>
<th valign="top" align="center">GSample 1</th>
<th valign="top" align="center">GSample 2</th>
<th valign="top" align="center">GSample 3</th>
<th valign="top" align="center">Gsample 4</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="center">Sample 1</td>
<td valign="top" align="center">2.8937</td>
<td valign="top" align="center">2.3979</td>
<td valign="top" align="center">2.4599</td>
<td valign="top" align="center">2.2281</td>
</tr>
<tr>
<td valign="top" align="center">Sample 2</td>
<td valign="top" align="center">2.2112</td>
<td valign="top" align="center">2.2814</td>
<td valign="top" align="center">1.8438</td>
<td valign="top" align="center">1.8728</td>
</tr>
<tr>
<td valign="top" align="center">Sample 3</td>
<td valign="top" align="center">2.1499</td>
<td valign="top" align="center">2.4278</td>
<td valign="top" align="center">3.1285</td>
<td valign="top" align="center">2.2975</td>
</tr>
<tr>
<td valign="top" align="center">Sample 4</td>
<td valign="top" align="center">2.2590</td>
<td valign="top" align="center">2.2396</td>
<td valign="top" align="center">1.9204</td>
<td valign="top" align="center">2.6094</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>Correlation coefficient results.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="center">CC</th>
<th valign="top" align="center">GSample 1</th>
<th valign="top" align="center">GSample 2</th>
<th valign="top" align="center">GSample 3</th>
<th valign="top" align="center">Gsample 4</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="center">Sample 1</td>
<td valign="top" align="center">0.1151</td>
<td valign="top" align="center">0.0085</td>
<td valign="top" align="center">0.0775</td>
<td valign="top" align="center">0.0446</td>
</tr>
<tr>
<td valign="top" align="center">Sample 2</td>
<td valign="top" align="center">0.0045</td>
<td valign="top" align="center">0.0825</td>
<td valign="top" align="center">0.0026</td>
<td valign="top" align="center">0.0162</td>
</tr>
<tr>
<td valign="top" align="center">Sample 3</td>
<td valign="top" align="center">0.0095</td>
<td valign="top" align="center">0.0095</td>
<td valign="top" align="center">0.1438</td>
<td valign="top" align="center">0.0126</td>
</tr>
<tr>
<td valign="top" align="center">Sample 4</td>
<td valign="top" align="center">0.0130</td>
<td valign="top" align="center">0.0046</td>
<td valign="top" align="center">0.0142</td>
<td valign="top" align="center">0.0402</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>MI and CC are indices used to evaluate the similarity between two variables and for both indices, higher values correspond to a greater similarity between the variables. We see from the tables that MI and CC between samples of the same type, such as Sample 1 and Gsample 1, are higher than those between other samples. However, the gap between classes is not very obvious. To further verify the reliability of the generated samples, we used the DE, which is more suitable for nonlinear signal analysis, to compare the generated samples with the original samples. Similarly, we selected 50 samples of each kind and calculated the average value. The results are shown in <xref ref-type="table" rid="T4">
<bold>Table&#xa0;4</bold>
</xref>.</p>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>Dispersion entropy results.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="center">Sample name</th>
<th valign="top" align="center">GSample 1</th>
<th valign="top" align="center">GSample 2</th>
<th valign="top" align="center">GSample 3</th>
<th valign="top" align="center">GSample 4</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="center">DE</td>
<td valign="top" align="center">3.2164</td>
<td valign="top" align="center">4.5132</td>
<td valign="top" align="center">2.5607</td>
<td valign="top" align="center">4.5823</td>
</tr>
<tr>
<td valign="top" align="center">Sample name</td>
<td valign="top" align="center">Sample 1</td>
<td valign="top" align="center">Sample 2</td>
<td valign="top" align="center">Sample 3</td>
<td valign="top" align="center">Sample 4</td>
</tr>
<tr>
<td valign="top" align="center">DE</td>
<td valign="top" align="center">2.6951</td>
<td valign="top" align="center">4.3608</td>
<td valign="top" align="center">2.5028</td>
<td valign="top" align="center">4.4172</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="T4">
<bold>Table&#xa0;4</bold>
</xref>, the DE values of the generated samples of types 2, 3, and 4 are very close to the original samples, which indicates that the samples generated by GAN are consistent with the original samples, and there is diversity among samples. However, the DE values of type 2 and 4 are also relatively close, which is also one of the difficulties in the classification of ship-radiated noise. The DE values of type 1 had some gaps, but CC and MI performed better, and this also verifies the diversity of the generated samples. The generated samples could be therefore be used to form a new training dataset for training a ship-radiated noise classifier.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Classification based on deep learning</title>
<p>Given the connection between different network layers, deep neural networks extract signal features for classification inherently. Convolutional neural networks are a traditional type of deep neural network. Compared with SVMs, they require more data to ensure that the network will not be overfitted, but they perform better on unprocessed data. Deep networks with better performance have emerged with the continuous development of deep learning. ResNet <xref ref-type="bibr" rid="B6">He et&#xa0;al. (2015)</xref> uses direct mapping to connect different layers, solves the problem of gradient disappearance or gradient explosion problems, and greatly improves the model fitting capability than networks without this module. In this study, we used the sample length of 1,600 sampling points selected in Section 2 as the input size of the network for model construction, and the samples generated in Section 3 are used to mix with the original samples in different proportions to construct a new dataset as the training dataset of the network.</p>
<p>To observe the impact of generated samples on the final classification, we set up five training sets with different proportions of the original samples and the generated samples as follows: only 400 original samples, 400 original samples and 100 generated samples, 400 original samples and 200 generated samples, 400 original samples and 400 generated samples, and 400 original samples and 800 generated samples. The number of original samples in the test set is set according to the 10% ratio of the training set. The structure of the CNN is similar to the GAN discriminator, with the last dense classification layer changed to a layer using a four-way Softmax activation function, and the structure is shown in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>. The parameters of three 1D-convolution layers are (64,3,2), (128,3,2), and (256,3,1). The first parameter is the number of convolution kernels; the second parameter is the kernel size; the last parameter is stride; and the value of padding is set to <italic>same</italic>, which means that it complements 0 uniformly during the sliding process of the convolution kernel. The parameter in the dense layer is set to (4,<italic>softmax</italic>), which means that the CNN used Softmax as the activation function for the four classifications. The structure of ResNet is shown in <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>. The parameters of the 1D-convolution layers before the residual modules are (64,3,1) and (64,3,1); the parameters of the 1D-convolution layer in the first batch of residual modules are (16,1,1), (16,3,1), and (64,1,1); and the parameters of the next 1D-convolution layer are (128,3,1). The parameters of the 1D-convolution layer in the first batch of residual modules are (32,1,1), (32,3,1), and (128,1,1). Then, the parameter of the first dense layer is (2048, <italic>relu</italic>), which means that the dimension of the output is 2,048, and the dense layer used the ReLU function as the activation function to fully connect the data. The parameter of the second dense layer is (4,<italic>softmax</italic>), and the function is same to the dense layer in CNN. The results are shown in <xref ref-type="fig" rid="f10">
<bold>Figures&#xa0;10</bold>
</xref>, <xref ref-type="fig" rid="f11">
<bold>11</bold>
</xref>.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>CNN structure.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g008.tif"/>
</fig>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>ResNet structure.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g009.tif"/>
</fig>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>CNN classification results. <bold>(A)</bold> Results of the CNN on the original dataset. <bold>(B)</bold> Results of the CNN at 4:1 dataset. <bold>(C)</bold> Results of the CNN at 2:1 dataset. <bold>(D)</bold> Results of the CNN at 1:1 dataset. <bold>(E)</bold> Results of the CNN at 1:2 dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g010.tif"/>
</fig>
<fig id="f11" position="float">
<label>Figure&#xa0;11</label>
<caption>
<p>ResNet classification results. <bold>(A)</bold> Results of ResNet on the original dataset. <bold>(B)</bold> Results of ResNet at 4:1 dataset. <bold>(C)</bold> Results of ResNet at 2:1 dataset. <bold>(D)</bold> Results of ResNet at 1:1 dataset. <bold>(E)</bold> Results of ResNet at 1:2 dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-10-1113224-g011.tif"/>
</fig>
<p>The images on the left are the training accuracy results, while the images on the right are the training loss results. <xref ref-type="fig" rid="f10">
<bold>Figures&#xa0;10A</bold>
</xref> and <xref ref-type="fig" rid="f11">
<bold>11A</bold>
</xref> show 400 original samples of 4 categories, including 100 samples in each category. They are then input into the traditional CNN and one-dimensional ResNet for classification.</p>
<p>The rest of the figures are the classification results obtained from the datasets formed when the ratio of original to generated samples is 4:1 in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10B</bold>
</xref>, 2:1 in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10C</bold>
</xref>, 1:1 in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10D</bold>
</xref>, and 1:2 in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10E</bold>
</xref>, respectively. In <xref ref-type="fig" rid="f10">
<bold>Figures&#xa0;10</bold>
</xref>, <xref ref-type="fig" rid="f11">
<bold>11</bold>
</xref>, the lines &#x201c;train-acc&#x201d; and &#x201c;train-loss&#x201d; are the results obtained in the training set, and &#x201c;val-acc&#x201d; and &#x201c;val-loss&#x201d; are the results obtained in the testing set.</p>
<p>The classification accuracy of the CNN using the dataset with only original samples is 79% in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10A</bold>
</xref>. When 100 generated samples are added to the dataset, the classification rate significantly improved, reaching 85.6% in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>
<xref ref-type="fig" rid="f10">
<bold>B</bold>
</xref>. Adding another 100 generated samples to the dataset caused the classification accuracy to reach 86.68% in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10C</bold>
</xref>, with a 2:1 ratio of the original to generated samples. When the ratio is 1:1, the accuracy rose to 89.5% in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10D</bold>
</xref>. However, when the ratio is 1:2, the accuracy reached 90% in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10E</bold>
</xref> and did not increase significantly.</p>
<p>At this point, the sample size already met the requirements of the network structure, and the accuracy reached convergence, which also verifies the validity of the generated samples. ResNet has more network layers than a traditional CNN, and thus more training epochs are required. Therefore, the epoch number is set to 150. As shown in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>, when we used the original dataset, the accuracy and loss converged slowly, and the accuracy only reached an eventual value of 87.5% in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>
<xref ref-type="fig" rid="f11">
<bold>A</bold>
</xref>. As the number of samples increased, the accuracy gradually improved. After adding 100 samples into the dataset, the accuracy reached 92.5% in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>
<xref ref-type="fig" rid="f11">
<bold>B</bold>
</xref>, but it is not stable and there are still some problems with overfitting.</p>
<p>Then, another 100 generated samples are added to the dataset, and the accuracy reached 98.33% in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>
<xref ref-type="fig" rid="f11">
<bold>C</bold>
</xref>. The accuracy reached 97.5% in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>
<xref ref-type="fig" rid="f11">
<bold>D</bold>
</xref> when the ratio of the original sample to the number of generated samples is 1:1. Finally, the accuracy reached 99.17% in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref>
<xref ref-type="fig" rid="f11">
<bold>E</bold>
</xref> when the ratio is 1:2. In the process of network model training and testing, each epoch took about 16 seconds. The number of epochs needed for convergence is reduced from 150 to 50 on testing set, and the convergence time is reduced from 40 minutes to 13.3 minutes. After network training is completed, when the new ship-radiated noise data are obtained, we only needed to perform sample segmentation and input them into the network directly without complex signal decomposition and manual feature extraction for classification. A classification result with an accuracy of 99% could be obtained within a few minutes.</p>
</sec>
<sec id="s5" sec-type="conclusions">
<label>5</label>
<title>Conclusion</title>
<p>In this paper, a 1-DDCGAN based on GAN is applied to extend ship-radiated noise under small sample size conditions. Deep neural network can extract sufficiently deep and essential features through the network structure when the sample size is large enough, and these features are used as a basis for classification. One-dimensional CNN and ResNet are designed for data analysis. And the accuracy is improved from 79% to 90% in CNN, from 87.5% to 99.17% in ResNet as the sample size increases.</p>
</sec>
<sec id="s6" sec-type="data-availability">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material. Further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7" sec-type="author-contributions">
<title>Author contributions</title>
<p>ZX: Conceptualization, visualization, writing, project administration, original draft. RL: supervision, writing review. LW: supervision, writing review, editing. AZ: Supervision, conceptualization. JL: Writing review, editing. XT: Writing review, editing. All authors contributed to the article and approved the submitted version.</p>
</sec>
</body>
<back>
<sec id="s8" sec-type="funding-information">
<title>Funding</title>
<p>This work was supported by the Key Program of Marine Economy Development Special Foundation of Department of Natural Resources of Guangdong Province (GDNRC [2022]19), and Natural Resources Science and Technology Innovation Project of Fujian Province (KY-080000-04-2021-030).</p>
</sec>
<sec id="s9" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>Author XT was employed by Xiamen Weilai Marine Science and Technology Ltd.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s10" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Arniriparian</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Freitag</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Cummins</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Gerczuk</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Pugachevskiy</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Schuller</surname> <given-names>B.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>A fusion of deep convolutional generative adversarial networks and sequence to sequence autoencoders for acoustic scene classification</article-title>,&#x201d; in <source>2018 26th European signal processing conference (EUSIPCO)</source> (<publisher-loc>Rome, Italy</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>977</fpage>&#x2013;<lpage>981</lpage>.</citation>
</ref>
<ref id="B2">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Atanackovic</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Vakilian</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Wiebe</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Lampe</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Diamant</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Stochastic ship-radiated noise modelling via generative adversarial networks</article-title>,&#x201d; in <source>Global oceans 2020: Singapore&#x2013;US gulf coast</source> (<publisher-loc>Biloxi, MS, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>8</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Aziz</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Arif</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>Multiscale permutation entropy of physiological time series</article-title>,&#x201d; in <source>2005 Pakistan section multitopic conference</source> (<publisher-loc>Karachi, Pakistan</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Buda</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Maki</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Mazurowski</surname> <given-names>M. A.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A systematic study of the class imbalance problem in convolutional neural networks</article-title>. <source>Neural Networks</source> <volume>106</volume>, <fpage>249</fpage>&#x2013;<lpage>259</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neunet.2018.07.011</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Cao</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Ali</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A new feature extraction method for ship-radiated noise based on improved ceemdan, normalized mutual information and multiscale improved permutation entropy</article-title>. <source>Entropy</source> <volume>21</volume>, <fpage>624</fpage>. doi: <pub-id pub-id-type="doi">10.3390/e21060624</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>He</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ren</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Deep residual learning for image recognition</article-title>. <source>arXiv</source>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1512.03385</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ian</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Pouget-Abadie</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Mirza</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Warde-Farley</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Generative adversarial nets</article-title>,&#x201d; in <source>Advances in neural information processing systems. arXiv</source>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1406.2661</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiao</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Geng</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Fluctuation-based reverse dispersion entropy and its applications to signal classification</article-title>. <source>Appl. Acoust.</source> <volume>175</volume>, <fpage>107857</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.apacoust.2020.107857</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Geng</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Jiao</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Dispersion entropy-based lempel-ziv complexity: A new metric for signal analysis</article-title>. <source>Chaos Solitons Fractals</source> <volume>161</volume>, <fpage>112400</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.chaos.2022.112400</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Denoising and feature extraction algorithms using npe combined with vmd and their applications in ship-radiated noise</article-title>. <source>Symmetry</source> <volume>9</volume>, <fpage>256</fpage>. doi: <pub-id pub-id-type="doi">10.3390/sym9110256</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A new underwater acoustic signal denoising technique based on ceemdan, mutual information, permutation entropy, and wavelet threshold denoising</article-title>. <source>Entropy</source> <volume>20</volume>, <fpage>563</fpage>. doi: <pub-id pub-id-type="doi">10.3390/e21010011</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A feature extraction method of ship-radiated noise based on fluctuation-based dispersion entropy and intrinsic time-scale decomposition</article-title>. <source>Entropy</source> <volume>21</volume>, <elocation-id>693</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/e21070693</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lin</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Di</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Hou</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Acoustic recognition method in low snr based on human ear bionics</article-title>. <source>Appl. Acoust.</source> <volume>182</volume>, <fpage>108213</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.apacoust.2021.108213</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>The underwater acoustic target timbre perception and recognition based on the auditory inspired deep convolutional neural network</article-title>. <source>Appl. Acoust.</source> <volume>182</volume>, <fpage>108210</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.apacoust.2021.108210</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Noda</surname> <given-names>J. J.</given-names>
</name>
<name>
<surname>Travieso-Gonz&#xe1;lez</surname> <given-names>C. M.</given-names>
</name>
<name>
<surname>S&#xe1;nchez-Rodr&#xed;guez</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Alonso-Hern&#xe1;ndez</surname> <given-names>J. B.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Acoustic classification of singing insects based on mfcc/lfcc fusion</article-title>. <source>Appl. Sci.</source> <volume>9</volume>, <fpage>4097</fpage>. doi: <pub-id pub-id-type="doi">10.3390/app9194097</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Pan</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Yi</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Khan</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Yuan</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Zheng</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Recent progress on generative adversarial networks (gans): A survey</article-title>,&#x201d; in <source>IEEE Access</source>, Vol. <volume>7</volume>. <fpage>36322</fpage>&#x2013;<lpage>36333</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ACCESS.2019.2905015</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pethiyagoda</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Moroney</surname> <given-names>T. J.</given-names>
</name>
<name>
<surname>Macfarlane</surname> <given-names>G. J.</given-names>
</name>
<name>
<surname>Binns</surname> <given-names>J. R.</given-names>
</name>
<name>
<surname>McCue</surname> <given-names>S. W.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Time-frequency analysis of ship wave patterns in shallow water: modelling and experiments</article-title>. <source>Ocean Eng.</source> <volume>158</volume>, <fpage>123</fpage>&#x2013;<lpage>131</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.oceaneng.2018.01.108</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Qi</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Mod-rrt*: A sampling-based algorithm for robot path planning in dynamic environment</article-title>,&#x201d; in <conf-name>IEEE Transactions on Industrial Electronics</conf-name>, Vol. <volume>68</volume>. <fpage>7244</fpage>&#x2013;<lpage>7251</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TIE.2020.2998740</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Radford</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Metz</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Chintala</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Unsupervised representation learning with deep convolutional generative adversarial networks</article-title>. <source>arXiv</source>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1511.06434</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Richman</surname> <given-names>J. S.</given-names>
</name>
<name>
<surname>Lake</surname> <given-names>D. E.</given-names>
</name>
<name>
<surname>Moorman</surname> <given-names>J. R.</given-names>
</name>
</person-group> (<year>2004</year>). &#x201c;<article-title>). sample entropy</article-title>,&#x201d; in <source>Methods in enzymology</source>, vol. <volume>384</volume>. (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>Academic Press</publisher-name>), <fpage>172</fpage>&#x2013;<lpage>184</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/S0076-6879(04)84011-4</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Santos-Dom&#xed;nguez</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Torres-Guijarro</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Cardenal-L&#xf3;pez</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Pena-Gimenez</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Shipsear: An underwater vessel noise database</article-title>. <source>Appl. Acoust.</source> <volume>113</volume>, <fpage>64</fpage>&#x2013;<lpage>69</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.apacoust.2016.06.008</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shi</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Du</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Dai</surname> <given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Clustering framework based on multi-scale analysis of intraday financial time series</article-title>. <source>Physica A: Stat. Mechan. its Appl.</source> <volume>567</volume>, <fpage>125728</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.physa.2020.125728</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Wei</surname> <given-names>X.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>On feature extraction of ship radiated noise using 11/2 d spectrum and principal components analysis</article-title>,&#x201d; in <source>2016 IEEE international conference on signal processing, communications and computing (ICSPCC)</source> (<publisher-loc>Hong Kong, China</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>4</lpage>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Esmaiel</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Qi</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Qasem</surname> <given-names>Z. A. H.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Feature extraction of ship-radiated noise based on enhanced variational mode decomposition, normalized correlation coefficient and permutation entropy</article-title>. <source>Entropy</source> <volume>22</volume>, <elocation-id>468</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/e22040468</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Cheng</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A denoising method for ship radiated noise based on spearman variational mode decomposition, spatial-dependence recurrence sample entropy, improved wavelet threshold denoising, and savitzky-golay filter</article-title>. <source>Alexandria Eng. J.</source> <volume>60</volume>, <fpage>3379</fpage>&#x2013;<lpage>3400</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.aej.2021.01.055</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yan</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Song</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Peng</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Kong</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Cheng</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Han</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Review of research results concerning the modelling of shipping noise</article-title>. <source>Polish Maritime Res</source>. doi: <pub-id pub-id-type="doi">10.2478/pomr-2021-0027</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Junejo</surname> <given-names>N. U. R.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Yan</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2020</year>a). &#x201c;<article-title>Adaptive variational mode time-frequency analysis of ship radiated noise</article-title>,&#x201d; in <source>2020 7th international conference on information science and control engineering (ICISCE)</source> (<publisher-loc>Changsha, China</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1652</fpage>&#x2013;<lpage>1656</lpage>.</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
<name>
<surname>Ying</surname> <given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Multireceiver sas imagery based on monostatic conversion</article-title>. <source>IEEE J. Selected Topics Appl. Earth Observat. Remote Sens.</source> <volume>14</volume>, <fpage>10835</fpage>&#x2013;<lpage>10853</lpage>.</citation>
</ref>
<ref id="B29">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Wu</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Underwater target feature extraction and classification based on gammatone filter and machine learning</article-title>,&#x201d; in <source>2018 international conference on wavelet analysis and pattern recognition (ICWAPR)</source> (<publisher-loc>Chengdu, China</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>42</fpage>&#x2013;<lpage>47</lpage>.</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Back projection algorithm for multi-receiver synthetic aperture sonar based on two interpolators</article-title>. <source>J. Mar. Sci. Eng.</source> <volume>10</volume>, <fpage>718</fpage>. doi: <pub-id pub-id-type="doi">10.3390/jmse10060718</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Feng</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>a). <article-title>Efficient imaging method for multireceiver sas</article-title>. <source>IET Radar Sonar Navigat</source>.</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2022</year>b). <article-title>Frequency-domain multireceiver synthetic aperture sonar imagery with chebyshev polynomials</article-title>. <source>Electron. Lett</source>.</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>c). <article-title>Experiment results of a novel sub-bottom profiler using synthetic aperture technique</article-title>. <source>Curr. Sci. (00113891)</source> <volume>122</volume>, <fpage>461</fpage>&#x2013;<lpage>464</lpage>.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Ying</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>b). <article-title>Parameter estimation of underwater impulsive noise with the class b model</article-title>. <source>IET Radar Sonar Navigat.</source> <volume>14</volume>, <fpage>1055</fpage>&#x2013;<lpage>1060</lpage>.</citation>
</ref>
</ref-list>
</back>
</article>