﻿<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.2 20190208//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article
    xmlns:mml="http://www.w3.org/1998/Math/MathML"
    xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">UJCSC</journal-id>
      <journal-title-group>
        <journal-title>Universal Journal of Computer Sciences and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub"></issn>
      <issn pub-type="ppub"></issn>
      <publisher>
        <publisher-name>Science Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.31586/ujcsc.2022.315</article-id>
      <article-id pub-id-type="publisher-id">UJCSC-315</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>
          Clutter Suppression Algorithm of Ultrasonic Color Doppler Imaging Based on BP Neural Network
        </article-title>
      </title-group>
      <contrib-group>
<contrib contrib-type="author">
<name>
<surname>Gan</surname>
<given-names>Jianhong</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Yilan</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Changyou</given-names>
</name>
<xref rid="af2" ref-type="aff">2</xref>
<xref rid="cr1" ref-type="corresp">*</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Hongmei</given-names>
</name>
<xref rid="af3" ref-type="aff">3</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Lu</surname>
<given-names>Jing</given-names>
</name>
<xref rid="af3" ref-type="aff">3</xref>
</contrib>
      </contrib-group>
<aff id="af1"><label>1</label> School of software engineering, Chengdu University of Information Engineering, Chengdu, Sichuan, 610103, China</aff>
<aff id="af2"><label>2</label> School of Applied Mathematics, Chengdu University of Information Engineering, Chengdu, Sichuan, 610103, China</aff>
<aff id="af3"><label>3</label> Sichuan Academy of Medical Sciences &#x025cf; Sichuan Provincial People's Hospital, China</aff>
<author-notes>
<corresp id="c1">
<label>*</label>Corresponding author at: School of Applied Mathematics, Chengdu University of Information Engineering, Chengdu, Sichuan, 610103, China
</corresp>
</author-notes>
      <pub-date pub-type="epub">
        <day>16</day>
        <month>06</month>
        <year>2022</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <history>
        <date date-type="received">
          <day>16</day>
          <month>06</month>
          <year>2022</year>
        </date>
        <date date-type="rev-recd">
          <day>16</day>
          <month>06</month>
          <year>2022</year>
        </date>
        <date date-type="accepted">
          <day>16</day>
          <month>06</month>
          <year>2022</year>
        </date>
        <date date-type="pub">
          <day>16</day>
          <month>06</month>
          <year>2022</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>&#xa9; Copyright 2022 by authors and Trend Research Publishing Inc. </copyright-statement>
        <copyright-year>2022</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p>
        </license>
      </permissions>
      <abstract>
        Aiming at the time complexity of singular value spectrum weighted Hankel SVD filtering algorithm, a clutter suppression algorithm for ultrasonic color Doppler imaging based on BP neural network model is proposed in this paper. Firstly, using the PRF data collected by portable ultrasound instrument, we verify the singular value weighted Hankel SVD filtering algorithm, and the results show that the algorithm has high accuracy; Then, the BP neural network model is established based on the input and output data of singular value weighted Hankel-SVD filtering algorithm; Finally, the clutter suppression algorithm of ultrasonic color Doppler imaging based on BP neural network model is established. The experimental results show that compared with Hankel SVD filtering algorithm, the clutter suppression algorithm proposed in this paper greatly shortens the operation time without reducing the accuracy, so as to improve the real-time performance of the filtering algorithm.
      </abstract>
      <kwd-group>
        <kwd-group><kwd>Ultrasound Color Doppler Imaging; Time Complexity; Singular Value Filtering; BP Neural Network</kwd>
</kwd-group>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
<title>Introduction</title><p>As an important index of human cardiovascular disease detection, hemodynamic information has been widely used in clinical medicine. In color Doppler imaging technology, Pulse Repetition Frequency (PRF) includes the interference caused by the slow movement of blood vessel wall and perivascular tissue (hereinafter referred to as clutter interference). The existence of clutter signal leads to large deviation in the estimation of hemodynamic parameters, which seriously reduces the blood flow discrimination ability of color blood flow imaging system. Therefore, the full suppression of clutter components is of great significance to improve the imaging quality of color ultrasonic Doppler system [
<xref ref-type="bibr" rid="R1">1</xref>,<xref ref-type="bibr" rid="R2">2</xref>,<xref ref-type="bibr" rid="R3">3</xref>].</p>
<p>Traditional clutter suppression filters, such as finite (infinite) impulse response filter and polynomial regression filter are static filters. When the clutter is a stationary signal, the clutter suppression effect is very good, but for the non-stationary clutter caused by blood vessel pulsation and tissue time-varying motion, the clutter suppression effect of the above static filters is not ideal [
<xref ref-type="bibr" rid="R4">4</xref>]. For non-stationary clutter, Kruse et al. [
<xref ref-type="bibr" rid="R5">5</xref>] proposed and designed a clutter filter based on eigenvalue decomposition (eigen) in 2002. The filtering algorithm has good suppression effect on non-stationary clutter, but does not have spatial adaptability [
<xref ref-type="bibr" rid="R6">6</xref>]. In order to improve the spatial adaptability of clutter filter, Yu and Cobbold [
<xref ref-type="bibr" rid="R7">7</xref>] proposed a singular value decomposition (SVD) filtering algorithm based on Hankel matrix in 2008. Both Eigen and Hankel SVD filters use the strict threshold method to determine the coefficients of the regression filter according to the preset threshold. Clutter suppression is achieved by discarding clutter components and retaining blood flow components, but it is difficult to achieve consistent filtering effect in the face of high-intensity time-varying movement of tissue [
<xref ref-type="bibr" rid="R8">8</xref>,<xref ref-type="bibr" rid="R9">9</xref>]. In 2016, aiming at the non-stationary clutter caused by high-intensity time-varying motion in tissue space, Wang Lutao et al. [
<xref ref-type="bibr" rid="R10">10</xref>] proposed Hankel SVD clutter filtering algorithm based on singular value spectrum weighting. The algorithm constructs Hankel data matrix according to the echo Doppler vector in a single slow time direction, performs singular value decomposition, and uses the decomposed Hankel principal components to construct the orthogonal basis function of regression filter, At the same time, the improved sigmoid function is introduced to calculate the regression filter coefficients according to the energy normalized singular value, which makes the detection of clutter region highly specific, so as to improve the suppression ability of non-stationary clutter. From 2018 to 2021, Baranger et al. [
<xref ref-type="bibr" rid="R11">11</xref>,<xref ref-type="bibr" rid="R12">12</xref>,<xref ref-type="bibr" rid="R13">13</xref>] proposed some clutter filters based on Casorati SVD, which continuously improved the clutter suppression effect by combining the spatial information provided by ultrafast composite plane wave, the spatial adaptability of eigenvalue extraction algorithm and the advantages of subregional filtering algorithm, and provided technical support for many new application research.</p>
<p>However, Hankel-SVD and Casorati SVD filter algorithms construct the matrix and perform singular value decomposition, the mathematical operation takes a long time, which makes the real-time performance of blood flow image based on this algorithm poor. In order to improve the real-time performance of Hankel-SVD clutter filtering algorithm based on singular value spectrum weighting, a clutter suppression algorithm for ultrasonic color Doppler imaging based on BP neural network model is proposed in this paper.</p>
</sec><sec id="sec2">
<title>Color Doppler ultrasound imaging process</title><p>In color Doppler ultrasound imaging technology, ultrasonic equipment is used to send ultrasonic sound beam to scan the imaging area, and each pixel emits eight to sixteen finite pulses. The pulse repetition frequency (PRF) often affects the accuracy of blood flow detection. The number of transmitted pulses is large, and the accuracy of blood flow information at the scanning position is high [
<xref ref-type="bibr" rid="R6">6</xref>]. PRF generally consists of three components: (1) blood flow ultrasonic echo signal (i.e. ultrasonic beam returns from moving erythrocyte scatterers), the intensity of blood flow vector component is low, but the frequency is higher than clutter vector component; (2) Clutter is generated by slowly moving or stationary tissue. It is usually 40~100dB higher than the Doppler frequency shift generated by moving blood flow, so that it occupies the dominant part in the echo signal; (3) Random white noise, caused by thermal vibration of electrons [
<xref ref-type="bibr" rid="R14">14</xref>]. Fig. 1 shows the flow chart of color Doppler imaging processing. The Doppler echo signal is stored in the memory, and the and data are rearranged to form a slow time signal data, and then most of the clutter signals are removed by the filtering algorithm to obtain the blood flow echo signal with low power; Then, the average angular frequency and power of blood flow are obtained by autocorrelation algorithm, and then substituted into the calculation formula of hemodynamic information to obtain the estimation of blood flow velocity, and priority coding is carried out. The specific position of blood vessel is determined by estimating the pseudo image of blood flow by distinguishing blood flow signal and noise signal, and the display effect of blood flow image is improved by post-processing algorithm; Finally, the processed two-dimensional image is mapped to the color indexTable <xref ref-type="table" rid="tabtable and"> table and</xref> superimposed with the gray image in mode B to display the color blood flow imaging image [
<xref ref-type="bibr" rid="R15">15</xref>].</p>
<fig id="fig1">
<label>Figure 1</label>
<caption>
<p>Flow chart of ultrasonic color Doppler imaging</p>
</caption>
<graphic xlink:href="315.fig.001" />
</fig></sec><sec id="sec3">
<title>Clutter suppression algorithm based on BP neural network</title><p>BP (back propagation) neural network [
<xref ref-type="bibr" rid="R16">16</xref>] is a multilayer feedforward neural network. The main feature of BP is that the signal propagates forward and the error propagates backward. After one training, the error value and the expected error result are obtained for error analysis. Taking the sum of squares of errors of all output layer nodes of the network as the objective function, the gradient descent algorithm is used to optimize the objective function, and then modify the weights and thresholds of each layer. After repeated iterative training, the network is updated to obtain the artificial neural network simulating the original problem.</p>
<title>3.1. Verify Hankel SVD filtering algorithm</title><p>In this paper, the PRF data is collected by portable ultrasound instrument, the clutter signal is filtered by using the algorithm proposed in reference [
<xref ref-type="bibr" rid="R10">10</xref>], and the color blood flow image is displayed in MATLAB simulation software (see Fig. 2 and Fig. 3). The experimental results show that the filtering algorithm has high accuracy and can suppress the non-stationary clutter caused by high-intensity time-varying motion of perivascular tissue.</p>
<fig id="fig2">
<label>Figure 2</label>
<caption>
<p>Ultrasonic signal acquisition and mapping</p>
</caption>
<graphic xlink:href="315.fig.002" />
</fig><fig id="fig3">
<label>Figure 3</label>
<caption>
<p>Color blood flow diagram displayed by filtering algorithm</p>
</caption>
<graphic xlink:href="315.fig.003" />
</fig><title>3.2. Data collection and processing</title><p>In this paper, a handheld ultrasonic instrument is used to collect multiple PRF. PRF have the following characteristics:</p>
<p>The amplitude of the original signal data fluctuates greatly, and the data range is from -1800 to 1900;</p>
<p>Because the signal data contains complex envelope, the singular value filtered data still retains the phase and amplitude information related to blood flow velocity, so the filtered PRF data has high complexity.</p>
<p></p>
<p>In view of the above problems, this paper adopts multi-layer hidden layer and adjusting the network super parameters to increase the learning ability of the model. BP network is a fully connected neural network, and its nonlinear mapping ability can approach any nonlinear function with any accuracy [
<xref ref-type="bibr" rid="R17">17</xref>]. However, from a mathematical point of view, as a local search optimization method, the weight of BP network is gradually adjusted along the local improvement, which may lead to the algorithm falling into local extremum. In order to get the optimal solution faster in BP neural network and eliminate the adverse effect of network learning caused by singular sample data, we normalized the original data in the experiment, so that multiple input set samples are in the same order of magnitude. The formula of data normalization is as follows:</p>

<disp-formula id="FD1"><label>(1)</label><math> <semantics>  <mrow>   <msup>    <mi>x</mi>    <mo>&#x2032;</mo>   </msup>   <mo>=</mo><mfrac>    <mrow>     <mi>x</mi><mo>&#x2212;</mo><mtext>u</mtext></mrow>    <mrow>     <msup>      <mi>&#x03C3;</mi>      <mn>2</mn>     </msup>     </mrow>   </mfrac>   <mo>,</mo></mrow>   </semantics></math></disp-formula><p>In this expression, <math> <semantics>  <mi>x</mi>   </semantics></math> is the original data, <math> <semantics>  <mtext>u</mtext>   </semantics></math> is the mean value of the sample, <math> <semantics>  <mrow>   <msup>    <mi>&#x03C3;</mi>    <mn>2</mn>   </msup>   </mrow>   </semantics></math> is the variance of the sample, and <math> <semantics>  <msup>   <mi>x</mi>   <mo>&#x2032;</mo>  </msup>     </semantics></math> is the normalized data. Finally, the normalized sample set is used as input to the model built by BP neural network for training.</p>
<title>3.3. Activation function and determination of the number of hidden layers</title><p>An important part of neural network is activation function. The introduction of appropriate activation function will make the deep neural network have strong learning ability. In this paper, the primary purpose of choosing BP neural network to replace singular value filtering algorithm is to solve the problem of time complexity of the algorithm, and the operation of relu activation function is very efficient. Its formula is as follows:</p>

<disp-formula id="FD2"><label>(2)</label><math> <semantics>  <mrow>   <mi>R</mi><mi>e</mi><mi>L</mi><mi>U</mi><mo stretchy='false'>(</mo><mi>x</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>max</mi><mo stretchy='false'>(</mo><mn>0</mn><mo>,</mo><mi>x</mi><mo stretchy='false'>)</mo><mi>&#xFF0C;</mi></mrow>   </semantics></math></disp-formula><p>Therefore, the middle layer of BP model in this paper uses relu activation function. Then, due to the sparsity of relu activation function, if only relu activation function is referenced, some components of the network may never be updated to. Therefore, this BP model introduces sigmoid activation function in the output layer. The expression of the sigmoid function is as follows:</p>

<disp-formula id="FD3"><label>(3)</label><math> <semantics>  <mrow>   <mi>S</mi><mtext>igmoid</mtext><mo stretchy='false'>(</mo><mi>x</mi><mo stretchy='false'>)</mo><mo>=</mo><mi>&#x03C3;</mi><mo>=</mo><mfrac>    <mn>1</mn>    <mrow>     <mn>1</mn><mo>+</mo><msup>      <mi>e</mi>      <mrow>       <mo>&#x2212;</mo><mi>x</mi></mrow>     </msup>     </mrow>   </mfrac>   <mo>.</mo></mrow>   </semantics></math></disp-formula><p>In order to detect the influence of different layers on the prediction results of the model, we select root mean square error (RMSE) and mean absolute error (MAE) as the evaluation indexes, and the calculation formula is as follows:</p>

<disp-formula id="FD4"><label>(4)</label><math> <semantics>  <mrow>   <mi>R</mi><mi>M</mi><mi>S</mi><mi>E</mi><mo>=</mo><msqrt>    <mrow>     <mfrac>      <mn>1</mn>      <mi>m</mi>     </mfrac>     <mstyle displaystyle='true'>      <munderover>       <mo>&#x2211;</mo>       <mrow>        <mi>i</mi><mo>=</mo><mn>1</mn></mrow>       <mi>m</mi>      </munderover>      <mrow>       <mo stretchy='false'>(</mo><msubsup>        <mi>g</mi>        <mrow>         <mi>p</mi><mi>r</mi><mi>e</mi></mrow>        <mrow>         <mo stretchy='false'>(</mo><mi>i</mi><mo stretchy='false'>)</mo></mrow>       </msubsup>       <mo>&#x2212;</mo><msup>        <mi>y</mi>        <mrow>         <mo stretchy='false'>(</mo><mi>i</mi><mo stretchy='false'>)</mo></mrow>       </msup>       <mo stretchy='false'>)</mo></mrow>     </mstyle></mrow>   </msqrt>   <mi>&#xFF0C;</mi><mi>M</mi><mi>A</mi><mi>E</mi><mo stretchy='false'>(</mo><mi>x</mi><mo>,</mo><mi>h</mi><mo stretchy='false'>)</mo><mo>=</mo><mfrac>    <mn>1</mn>    <mi>m</mi>   </mfrac>   <mstyle displaystyle='true'>    <munderover>     <mo>&#x2211;</mo>     <mrow>      <mi>i</mi><mo>=</mo><mn>1</mn></mrow>     <mi>m</mi>    </munderover>    <mrow>     <mo>&#x007C;</mo><mi>h</mi><mo stretchy='false'>(</mo><msup>      <mi>x</mi>      <mrow>       <mo stretchy='false'>(</mo><mi>i</mi><mo stretchy='false'>)</mo></mrow>     </msup>     <mo stretchy='false'>)</mo><mo>&#x2212;</mo><msup>      <mi>y</mi>      <mrow>       <mo stretchy='false'>(</mo><mi>i</mi><mo stretchy='false'>)</mo></mrow>     </msup>     <mo>&#x007C;</mo></mrow>   </mstyle><mo>.</mo></mrow>   </semantics></math></disp-formula><p>After a large number of experiments, the error of the prediction results of different hidden layers is analyzed (seeTable <xref ref-type="table" rid="tab1">1</xref> for the results), and finally the number of hidden layers is 6.</p>
<table-wrap id="tab1">
<label>Table 1</label>
<caption>
<p>Performance and ranking of BP neural network models with different hidden layers on the test set</p>
</caption>
<table> <tr>  <td rowspan="2">  <p><b >Number of hidden layers</b></p>  </td>  <td colspan="2">  <p><b >Test set</b></p>  </td>  <td colspan="2">  <p><b >Rank</b></p>  </td> </tr> <tr>  <td>  <p><b >MAE</b></p>  </td>  <td>  <p><b >RMSE</b></p>  </td>  <td>  <p><b >MAE</b></p>  </td>  <td>  <p><b >MSE</b></p>  </td> </tr> <tr>  <td>  <p>2</p>  </td>  <td>  <p>0.18498</p>  </td>  <td>  <p>1.29932</p>  </td>  <td>  <p>5</p>  </td>  <td>  <p>5</p>  </td> </tr> <tr>  <td>  <p>3</p>  </td>  <td>  <p>0.18500</p>  </td>  <td>  <p>0.59934</p>  </td>  <td>  <p>4</p>  </td>  <td>  <p>4</p>  </td> </tr> <tr>  <td>  <p>4</p>  </td>  <td>  <p>0.18396</p>  </td>  <td>  <p>0.39820</p>  </td>  <td>  <p>3</p>  </td>  <td>  <p>3</p>  </td> </tr> <tr>  <td>  <p>5</p>  </td>  <td>  <p>0.17998</p>  </td>  <td>  <p>0.28945</p>  </td>  <td>  <p>2</p>  </td>  <td>  <p>2</p>  </td> </tr> <tr>  <td>  <p>6</p>  </td>  <td>  <p>0.17512</p>  </td>  <td>  <p>0.28152</p>  </td>  <td>  <p>1</p>  </td>  <td>  <p>1</p>  </td> </tr></table>
</table-wrap><p></p>
<title>3.4. Determination of the number of nodes in each hidden layer</title><p>In the BP network designed in this paper, the number of hidden layer nodes (number of neurons) is also a super parameter that is difficult to select. It not only has a great impact on the performance of the neural network, but also is the direct cause of "over fitting" [
<xref ref-type="bibr" rid="R18">18</xref>]. This paper uses the method of literature [
<xref ref-type="bibr" rid="R18">18</xref>] to manually adjust the number of hidden layer nodes, and the number of nodes meets the following formula:</p>

<disp-formula id="FD5"><label>(5)</label><math> <semantics>  <mrow>   <mstyle displaystyle='true'>    <munderover>     <mo>&#x2211;</mo>     <mrow>      <mi>i</mi><mo>=</mo><mn>0</mn></mrow>     <mi>x</mi>    </munderover>    <mrow>     <msubsup>      <mi>C</mi>      <mi>H</mi>      <mi>i</mi>     </msubsup>     <mo>&#x003E;</mo><mi>m</mi><mtext>&#x00A0;</mtext></mrow>   </mstyle><mi>&#xFF0C;</mi><mi>H</mi><mo>=</mo><msqrt>    <mrow>     <mi>X</mi><mo>+</mo><mi>O</mi></mrow>   </msqrt>   <mo>+</mo><mi>a</mi><mtext>&#x00A0;</mtext><mtext>.</mtext></mrow>   </semantics></math></disp-formula><p>In this expression <math> <semantics>  <mi>x</mi>   </semantics></math> is the number of neurons in the input layer; m is the number of training set samples; <math> <semantics>  <mi>O</mi>   </semantics></math> is the number of neurons in the output layer&#x26;#x0ff1b;<math> <semantics>  <mi>a</mi>   </semantics></math> is a constant between [
<xref ref-type="bibr" rid="R1">1</xref>,<xref ref-type="bibr" rid="R10">10</xref>]. Number of training set samples in this paper m is 90; input layer neuron <math> <semantics>  <mi>x</mi>   </semantics></math> Doppler echo vector signal <math> <semantics>  <mi>I</mi>   </semantics></math> and <math> <semantics>  <mi>Q</mi>   </semantics></math> combined composition (i.e.x=32); Number of neurons in output layer <math> <semantics>  <mi>O</mi>   </semantics></math> vector signal filtered for singular value(i.e. <math> <semantics>  <mi>O</mi>   </semantics></math> = 32). According to formula (5), Manually adjust the number of nodes of each hidden layer <math> <semantics>  <mi>H</mi>   </semantics></math> , based on a large number of experimental results, the number of neurons in each hidden layer is finally determined based on the minimum of root mean square error and average absolute error, as shown inTable <xref ref-type="table" rid="tab2">2</xref>.</p>
<table-wrap id="tab2">
<label>Table 2</label>
<caption>
<p>Number of neurons in each hidden layer</p>
</caption>
<table> <tr>  <td>  <p><b >Hidden layer</b></p>  </td>  <td>  <p><b >Hidden layer neuron </b></p>  </td> </tr> <tr>  <td>  <p>1</p>  </td>  <td>  <p>32</p>  </td> </tr> <tr>  <td>  <p>2</p>  </td>  <td>  <p>64</p>  </td> </tr> <tr>  <td>  <p>3</p>  </td>  <td>  <p>128</p>  </td> </tr> <tr>  <td>  <p>4</p>  </td>  <td>  <p>512</p>  </td> </tr> <tr>  <td>  <p>5</p>  </td>  <td>  <p>128</p>  </td> </tr> <tr>  <td>  <p>6</p>  </td>  <td>  <p>32</p>  </td> </tr></table>
</table-wrap><p></p>
<title>3.5. Algorithm verification</title><p>The model loss value after 10000 times of training on the training set is shown inTable <xref ref-type="table" rid="tab3">3</xref>. The training error is reduced from 14.772 at the initial random initialization to 0.1872 at the end. In the initial stage of model training, the error decreases rapidly. After the training times reach about 400, the training error of the BP neural network model on the training set decreases gently and converges gradually.</p>
<table-wrap id="tab3">
<label>Table 3</label>
<caption>
<p>Model training times and cost function values</p>
</caption>
<table> <tr>  <td>  <p>Training  times</p>  </td>  <td>  <p>1</p>  </td>  <td>  <p>300</p>  </td>  <td>  <p>400</p>  </td>  <td>  <p>500</p>  </td>  <td>  <p>1000</p>  </td>  <td>  <p>5000</p>  </td>  <td>  <p>10000</p>  </td> </tr> <tr>  <td>  <p>Cost-function  value</p>  </td>  <td>  <p>14.772</p>  </td>  <td>  <p>4.1481</p>  </td>  <td>  <p>0.8873</p>  </td>  <td>  <p>0.7004</p>  </td>  <td>  <p>0.5499</p>  </td>  <td>  <p>0.2960</p>  </td>  <td>  <p>0.1872</p>  </td> </tr></table>
</table-wrap><p></p>
<p>The test set is a separate ultrasonic signal data (the vector signal size is 800 * 144). We input the test set into the above built and trained BP neural network model, and compare the predicted value of the model with the real value (the signal value of the test set filtered by literature [
<xref ref-type="bibr" rid="R10">10</xref>]). In this paper, the two-dimensional vector data is expanded into one-dimensional and compared with the real value, by observing the experimental fitting, it can be concluded that BP neural network can learn the law of singular value filtering algorithm, and the predicted data is roughly fitted with the actual real value. The comparison results are shown inFigure <xref ref-type="fig" rid="fig4"> 4</xref>.</p>
<fig id="fig4">
<label>Figure 4</label>
<caption>
<p>Comparison between predicted value and real value data of BP model</p>
</caption>
<graphic xlink:href="315.fig.004" />
</fig><p>In order to verify the real-time performance of the algorithm in this paper, we use two groups of different PRF data for experiments. The experimental results show that the algorithm in this paper greatly reduces the filtering time compared with the algorithm in reference [
<xref ref-type="bibr" rid="R4">4</xref>]. The filtering time of the two algorithms is shown inTable <xref ref-type="table" rid="tab4">4</xref>.</p>
<table-wrap id="tab4">
<label>Table 4</label>
<caption>
<p>Comparison of filtering time between the algorithm in this paper and the algorithm in reference [10]</p>
</caption>
<table> <tr>  <td>  <p><b >PRF data</b></p>  </td>  <td>  <p><b >Algorithm of reference [10]/s</b></p>  </td>  <td>  <p><b >The algorithm of this paper/s</b></p>  </td> </tr> <tr>  <td>  <p>1</p>  </td>  <td>  <p>10.17</p>  </td>  <td>  <p>0.517</p>  </td> </tr> <tr>  <td>  <p>2</p>  </td>  <td>  <p>11.02</p>  </td>  <td>  <p>0.624</p>  </td> </tr></table>
</table-wrap></sec><sec id="sec4">
<title>Conclusion</title><p>As one of the excellent clutter filtering algorithms in PRF, Hankel-SVD filter based on singular value spectrum weighting has its own advantages. However, due to the complex mathematical operation of the filter, the filtering time is too long, which hinders the application of the filter in practical clinical medicine. In order to improve the real-time performance of Hankel-SVD clutter filtering algorithm based on singular value spectrum weighting, this paper proposes a clutter suppression algorithm for ultrasonic color Doppler imaging based on BP neural network model. The algorithm establishes BP neural network model based on the input and output data of singular value weighted Hankel-SVD filtering algorithm. The experimental results show that the clutter suppression algorithm proposed in this paper is compared with Hankel-SVD filtering algorithm, On the premise of hardly reducing the accuracy, the operation time is greatly shortened, so as to improve the real-time performance of the filtering algorithm.</p>
<p>Compared with the algorithm in reference [
<xref ref-type="bibr" rid="R10">10</xref>], the algorithm proposed in this paper performs well in various evaluation indexes, especially improves the real-time performance of the filtering algorithm, which provides a theoretical basis for the clinical application of the algorithm. In the next step, on the premise of ensuring real-time performance, we further improve the network structure to get better filtering effect.</p>
</sec><sec id="sec5">
<title>Acknowledgements</title><p>This work is supported by the Scientific and Technology Project of Sichuan Provincial (Grant no. 2021YFS0379) of China, the Scientific Research Fund of Chengdu University of Information Technology (Grant no. KYTZ201820) of China.</p>
<p></p>
</sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      
<ref id="R1">
<label>[1]</label>
<mixed-citation publication-type="other">Bercoff J, Montaldo G, Loupas T, et al. Ultrafast compound doppler imaging: Providing full blood flow characterization, IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 2011, 58(1): 134-147.
</mixed-citation>
</ref>
<ref id="R2">
<label>[2]</label>
<mixed-citation publication-type="other">Oeltze S, Lehmann D J, Kuhn A, Blood flow clustering and applications in virtual stinting of intracranial aneurysms, IEEE Transactions on Visualization and Computer Graphics, 2014, 20(5): 686-701.
</mixed-citation>
</ref>
<ref id="R3">
<label>[3]</label>
<mixed-citation publication-type="other">Shung K K, Diagnostic Ultrasound: Imaging and Blood Flow Measurements, New York: Taylor Francis Group, 2006. 34-37.
</mixed-citation>
</ref>
<ref id="R4">
<label>[4]</label>
<mixed-citation publication-type="other">Kadi A P&#x0ff0c;Loupas T, On the performance of regression and step-initialized IIR clutter filters for color Doppler systems in diagnostic medical ultrasound, IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 1995, 42(3): 927-937.
</mixed-citation>
</ref>
<ref id="R5">
<label>[5]</label>
<mixed-citation publication-type="other">Kruse D E, Ferrara K W, A new high resolution color flow system using an eigen decomposition-based adaptive filter for clutter rejection, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, 2002, 49 (12): 1384-1399.
</mixed-citation>
</ref>
<ref id="R6">
<label>[6]</label>
<mixed-citation publication-type="other">Song F, Zhang D, Gong X, Performance evaluation of eigendecomposition-based adaptive clutter filter for color flow imaging, Ultrasonics, 2006, 44 (1): 67-71.
</mixed-citation>
</ref>
<ref id="R7">
<label>[7]</label>
<mixed-citation publication-type="other">Yu A C H, Cobbold&#x0ff32;S C, Single ensemble based eigen-processing methods for color flow imaging part 1 the Hankel-SVD filter, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, 2008, 55( 3) : 559-573.
</mixed-citation>
</ref>
<ref id="R8">
<label>[8]</label>
<mixed-citation publication-type="other">Yu A C H, Lovstakken L, Eigen-based clutter filter design for ultrasound color flow imaging: a review, IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 2010, 57(5): 1096-1111.
</mixed-citation>
</ref>
<ref id="R9">
<label>[9]</label>
<mixed-citation publication-type="other">Wang L, Wang W, Jing G, Research on clutter suppression technology of non-stationary ultrasonic blood flow imaging based on Hankel SVD, Journal of electronics and information, 2015, 37 (4): 830-835. (In Chinese)
</mixed-citation>
</ref>
<ref id="R10">
<label>[10]</label>
<mixed-citation publication-type="other">Wang L, Wu X, Jing G, Zou J, A clutter suppression algorithm for ultrasonic color Doppler imaging based on singular value spectrum weighting, Acta electronica Sinica, 2016,44 (6): 1294-1299. (In Chinese)
</mixed-citation>
</ref>
<ref id="R11">
<label>[11]</label>
<mixed-citation publication-type="other">Baranger J, Arnal B, Perren F, et al. Adaptive spatiotemporal SVD clutter filtering for Ultrafast Doppler Imaging using similarity of spatial singular vectors, IEEE Transactions on Medical Imaging, 2018, 37(7): 1574-1586.
</mixed-citation>
</ref>
<ref id="R12">
<label>[12]</label>
<mixed-citation publication-type="other">Hingot V, Brodin C, Lebrun F, et al. Early Ultrafast Ultrasound Imaging of Cerebral Perfusion correlates with Ischemic Stroke outcomes and responses to treatment in Mice, Theranostics, 2020, 10(17): 7480-7491.
</mixed-citation>
</ref>
<ref id="R13">
<label>[13]</label>
<mixed-citation publication-type="other">Xu Y, Yang C, Xu J, et al, An adaptive spatiotemporal clutter suppression algorithm for ultrafast plane wave ultrasonic Doppler based on Casorati singular value decomposition, Journal of electronics and information, 2021, 43 (8): 2334-2342. (In Chinese)
</mixed-citation>
</ref>
<ref id="R14">
<label>[14]</label>
<mixed-citation publication-type="other">Li W, Jiang X, Chen H, et al, Based on EEMD_ Hankel_ Noise reduction method of mine microseismic signal based on SVD, Journal of coal, 2018, 43 (7): 1910-1917. (In Chinese)
</mixed-citation>
</ref>
<ref id="R15">
<label>[15]</label>
<mixed-citation publication-type="other">Kargel C, H&#x000f6;benreich G, Trummer B, et al, Adaptive clutter rejection filtering in ultrasonic strain-flow imaging, IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 2003, 50(7): 824-835.
</mixed-citation>
</ref>
<ref id="R16">
<label>[16]</label>
<mixed-citation publication-type="other">Zhang L, Wang F, Sun T, et al, A constrained optimization method based on BP neural network, Neural Computing &#x00026; Applications, 2018, 29(2): 413-421.
</mixed-citation>
</ref>
<ref id="R17">
<label>[17]</label>
<mixed-citation publication-type="other">Yang A, Zhuansun Y, Liu C, et al. Design of intrusion detection system for internet of things based on improved BP neural network, IEEE Access, 2019, 7:106043-106052.
</mixed-citation>
</ref>
<ref id="R18">
<label>[18]</label>
<mixed-citation publication-type="other">Feisi technology product R &#x00026; D Center, Neural network theory and MATLAB 7 implementation, Beijing: Electronic Industry Press, 2005. (In Chinese)
</mixed-citation>
</ref>
    </ref-list>
  </back>
</article>