<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Research on Traffic Target Detection Algorithm Based on Yolov5</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Runjie Liu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yipeng Duan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shuguang Li</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lei Shi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Supercomputing Center in Zhengzhou, Zhengzhou University</institution>
          ,
          <addr-line>Zhengzhou 450001, Henan</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <fpage>293</fpage>
      <lpage>299</lpage>
      <abstract>
        <p>Traffic target detection is a research hotspot in the fields of autonomous driving, intelligent transportation and so on. In recent years, with the rapid development of deep learning technology, it brings new opportunities and challenges to the field of traffic target detection. Aiming at the problems of missing target detection, low detection accuracy and large amount of network parameters and calculations in the traffic target detection algorithm, this paper proposes an improved YOLOv5-Ghost-CA target detection algorithm. Firstly, the CA (Coordinate Attention) module is introduced into the YOLOv5 Backbone network to enhance the receptive field of the Backbone network and the ability to capture location information. The detection accuracy is also improved. Then, GhostConv module is used to replace the convolution with step size of 2 in the whole network, so as to reduce the amount of network parameters and calculation. Experiments show that the improved algorithm has better detection accuracy, meets the real-time requirements and is easy to deploy on the equipment with insufficient resources than the benchmark algorithm on the KITTI dataset.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Object Detection</kwd>
        <kwd>YOLOv5</kwd>
        <kwd>CA</kwd>
        <kwd>GhostConv</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        and attention feature fusion module (AFFB) on the basis of YOLOv5. On the premise of ensuring
realtime performance, the mAP(mean average precision) of all targets is increased by 0.9%, while the mAP
of small targets is increased by 3.5%. In terms of reducing the complexity of the algorithm, Cao
Yuanjie[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], et al. proposed a lightweight target detection network (YOLO-GhostNet) with GhostNet
residual structure as the Backbone to solve the problem that YOLOv4 tiny network cannot be deployed
on platforms with less resources due to its large amount of parameters and calculations, which greatly
reduces the amount of network calculations and parameters without loss of accuracy and speeds up the
reasoning speed. Li Yushi[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] et al. introduced the lightweight network MobileNet as the Backbone
feature extraction network based on YOLOv5, and embedded the CBAM module to compensate the
loss of accuracy.
      </p>
      <p>In practical applications, the two-stage algorithm is difficult to meet the real-time requirements. In
the one-stage algorithm, the YOLO series algorithm has developed rapidly in recent years and
outperforms SSD and FCOS on the popular data sets. Compared with the previous version, YOLOv5
has greatly improved the detection speed. Therefore, this paper uses YOLOv5 algorithm to realize
realtime detection of targets in traffic scenes.</p>
    </sec>
    <sec id="sec-2">
      <title>2.Improvement of YOLOv5 network</title>
    </sec>
    <sec id="sec-3">
      <title>2.1.YOLOv5 network model</title>
      <p>The network model of the original YOLOv5 is composed of three parts: Backbone, Neck and Head.
According to the size of the model, it is divided into four versions: YOLOv5, YOLOv5m, YOLOv5l
and YOLOv5x. This paper not only wants to improve the detection accuracy, but also takes into account
two factors: detection speed and algorithm complexity. Therefore, this paper selects YOLOv5s as the
benchmark algorithm.</p>
      <p>
        The components of the network are shown in Figure 1. Backbone network of YOLOv5 is composed
of Fous, Conv, C3, SPP(spatial pyramid pooling) and other modules. The Fous module assembly, in the
channel dimension, vertical and horizontal intervals slicing section of the input. Compared with
convolution down sampling, the Fous output depth is increased by 4 times, more information is retained,
and the cost of convolution is reduced and the speed is improved. Conv module performs convolution,
regularization, activation and other operations on the input in turn. C3 module, refers to the structural
characteristics of CSPNet[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] , divides the input feature map into two parts. The splitting and merging
strategies are used across stages to reduce the duplicated gradient information, so that the network can
have better learning ability and less calculation The SPP module passes the input through three different
sizes of the largest pool layer, and then connects with the input, this structure can greatly improve the
receptive field, and the speed loss is small.
      </p>
      <p>
        The Neck part is mainly composed of FPN[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ](feature pyramid networks) and PAN[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ](path
aggregation networks). The FPN layer transfers strong semantic features downward while the PAN
layer transfers strong positioning features upward, The two parts complement each other to enhance the
feature extraction ability of the model. Head is the detection layer, and the traditional CNN network
only inputs the highest level features into the detection layer. Therefore, the information loss of small
target features after multi-layer transmission makes it difficult to identify. YOLOv5 inputs three
different sizes of features into the detection layer to detect large, medium and small targets respectively,
overcoming the limitations of the traditional detection layer.
      </p>
      <sec id="sec-3-1">
        <title>Backbone</title>
        <p>Focus tGchoonsv
= conv BN SiLU</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>2.2.CA module</title>
      <p>
        Hou Q[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] proposed CA(coordinate attention) in CVPR2021. For SE(Squeeze-and-Excitation)[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
attention, only the importance of each channel is measured by modeling the channel relationship, and
the problem of location information is ignored.
      </p>
      <sec id="sec-4-1">
        <title>Neck C3 C3 C3</title>
        <p>A
d
d
Head</p>
      </sec>
      <sec id="sec-4-2">
        <title>Conv</title>
      </sec>
      <sec id="sec-4-3">
        <title>Upsampling</title>
      </sec>
      <sec id="sec-4-4">
        <title>Concat C3</title>
      </sec>
      <sec id="sec-4-5">
        <title>Conv</title>
      </sec>
      <sec id="sec-4-6">
        <title>Upsampling</title>
      </sec>
      <sec id="sec-4-7">
        <title>Ghostc onv</title>
      </sec>
      <sec id="sec-4-8">
        <title>Ghostc onv</title>
        <sec id="sec-4-8-1">
          <title>Conv</title>
        </sec>
        <sec id="sec-4-8-2">
          <title>Conv n*CA-Bottleneck (True/False)</title>
        </sec>
        <sec id="sec-4-8-3">
          <title>Conv</title>
          <p>(c)
C
o
n
c
a
t
C
o
n
c
a
t
C
o
n
c
a
t
(a)</p>
        </sec>
        <sec id="sec-4-8-4">
          <title>Conv</title>
          <p>(b)</p>
        </sec>
        <sec id="sec-4-8-5">
          <title>Conv</title>
        </sec>
        <sec id="sec-4-8-6">
          <title>Conv</title>
          <p>map respectively to form a pair of direction aware and position sensitive feature map, They can
complementarily enhance the representation of the object of interest. The network structure of CA
module is shown in Figure 2.</p>
          <p>As shown in Figure 3, this paper adds the CA module to the Bottleneck module in the C3 module of
the Backbone network to enhance the feature extraction ability of the backbone network and reduce the
missed detection rate of the target detection algorithm. After introducing CA module, the original
Bottleneck module is changed into CA- Bottleneck module, and C3 module is changed into CA-C3
module.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>2.3.GhostConv module</title>
      <p>
        After adding CA attention to the benchmark algorithm, this paper continues to introduce GhostConv
module to reduce the parameter quantity and complexity of the network model under the condition of
ensuring the accuracy, so that it can be deployed on devices with insufficient computing power. In
general, in order to ensure that the network a comprehensive understanding of the input data, the deep
neural network will contain rich or even redundant feature map, and many of the feature layers are
similar. These similar feature layers are like ghost to each other GhostConv module comes from
GhostNet[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], which does not try to remove these redundancies, but obtains them with a lower cost
budget.
      </p>
      <sec id="sec-5-1">
        <title>Conv</title>
      </sec>
      <sec id="sec-5-2">
        <title>Conv</title>
      </sec>
      <sec id="sec-5-3">
        <title>Input</title>
      </sec>
      <sec id="sec-5-4">
        <title>Output</title>
      </sec>
      <sec id="sec-5-5">
        <title>Input</title>
        <p>Identity
w1
w2
w3
.
.
.</p>
      </sec>
      <sec id="sec-5-6">
        <title>Output</title>
        <p>Fig 4.convolution and GhostConv.</p>
        <p>GhostConv integrates standard volumes into two steps. The first step is to use fewer convolution
kernels to perform convolution operations and generate a small number of feature map, the second step
is to generate more feature map with simple linear operations, Finally, the two-step feature map is
concatenated, and the size and number of the feature map are unchanged, but the overall amount of
parameters and calculations are significantly reduced. Its structure is shown in Figure 4. The
convolution can be expressed as:</p>
        <p>Y=X*w+b 1</p>
        <p>Where X∈Rc×h×w is convolution input，c is the number of input channels, h and w represent the
height and width of the input feature map respectively, Y∈Rh'×w' ×nis convolution output, n represents
the number of output channels, h' and w' Indicates the height and width of the output, w ∈Rc×k×k×n
indicates that the convolution operation is c×n convolution kernels with size k×k convolution kernel,
b is the offset term.</p>
        <p>GhostConv：</p>
        <p>Y'=X*w'
2</p>
        <p>Yij=φijY i',i∈ 1,m ,j∈ 1,s 3
m≤n, the offset term b is omitted. GhostConv module finally needs to generate n feature map,
equation (3) needs to generate n-m feature map. Suppose that each feature graph in Y'needs to generate
s feature map, Yi' is the ith feature map in Y',  is the linear operation used by each Yi' to generate
the jth. Finally, as shown in Figure 4, the two parts of the feature map are directly spliced to complete
the GhostConv module.</p>
        <p>The computation of GhostConv module is approximately 1/s of convolution. All convolution
modules with step size of 2 in YOLOv5s are replaced by GhostConv module. The new structure
effectively reduces the amount of parameter calculation and compresses the model.
2.4.overall structure of Improved YOLOv5 network</p>
        <p>YOLOv5s is very practical, and it is feasible to use it as a benchmark algorithm for traffic scene
target detection. However, from the current application scenario, YOLOv5s can still be further
improved. Combined with the improvement measures described earlier in this paper, the improved
algorithm YOLOv5-Ghost-CA is obtained. The overall structure of the algorithm is shown in Figure 1.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3.Experiment and result analysis</title>
    </sec>
    <sec id="sec-7">
      <title>3.1.Experimental dataset</title>
      <p>This paper selects the KITTI 2D scene training dataset as the dataset of this paper. The KITTI dataset
is widely used in the field of automatic driving, including images in a variety of actual scenes of urban
areas, villages and highways. KITTI dataset contains 9 types of target: 'car', 'van', 'truck', 'pedestrian',
'person_sitting', 'cycle', 'tram', 'misc', 'dontcare', here 'misc' and 'dontcare' are ignored, and the dataset is
finally changed into seven categories. At the same time, the dataset is divided into training set,
verification set and test set according to 6:2:2.</p>
    </sec>
    <sec id="sec-8">
      <title>3.2.Experimental environment</title>
      <p>The experiment in this paper uses pytorch 1.10 framework, training environment: CUDA version is
10.2, GPU is Tesla V100S-PCIE-32GB, compilation language is python3.6.8, initial learning rate is
0.01, final learning rate is 0.2, batchsize is 16, and warm-up method with epoch of 3 and momentum
parameter of 0.8 is used to warm up the learning rate.</p>
      <p>Among them, TP (true positive) is a positive sample correctly detected as a positive sample, FP (false
positive) is a negative sample incorrectly detected as a positive sample, and FN (false negative) is a
model
Yolov5s
Yolov5s-CA
Yolov5s-Ghost
Yolov5s-Ghost-CA
91.8
92.3
92.9
92.4</p>
    </sec>
    <sec id="sec-9">
      <title>3.3.Measurement indicators</title>
      <p>In this paper missed detection rate, mAP, parameters, GFLOPs and FPS are used to quantitatively
evaluate the performance of the algorithm. The specific calculation formula of the above evaluation
indicators is as follows:
82.1
84
82.7
86.6
7.07
6.5
5.93
5.35
16.4
16.8
14.1
14.4
88.1
90.9
90.4
91.7
100
91
95
79
5
6
7
8
9
negative sample incorrectly detected as a positive sample. Ld is the missed detection rate, and mAP is
used to measure the detection ability of the algorithm. Parameter quantity and calculation quantity are
used to measure the complexity of the algorithm. FPS represents the number of detected pictures per
second, which is used to show the detection speed of the algorithm.</p>
    </sec>
    <sec id="sec-10">
      <title>3.4.comparison experiment</title>
      <p>In order to verify the effectiveness of the improved algorithm in this paper, a comparative experiment
was designed on the basis of YOLOv5s, and four groups of tests were conducted. The four algorithms
were trained on the KITTI dataset, and each group of experiments used the same super parameters and
training skills. The experimental results are shown in Table 1.</p>
      <p>It can be seen from Table 1 that the YOLOv5-CA algorithm after the introduction of the CA module
into the YOLOv5s algorithm has an increase of 2.8% compared with the benchmark algorithm
YOLOv5s, which proves that the CA module can effectively enhance the feature extraction ability of
the Backbone network. After introducing GhostConv module, the parameter quantity of
YOLOv5sGhost algorithm is reduced by 16%, the calculation quantity is reduced by 14%, and the mAP is
increased by 2.3%, indicating that the GhostConv module has the function of lightweight, which can
effectively improve the overall performance of the algorithm. YOLOv5-Ghost-CA algorithm, which
combines CA module and GhostConv module, reduces the missed detection rate by 4.5% and increases
the mAP by 3.6% when the parameter quantity is reduced by 24.3% and the calculation amount is
reduced by 12.2%. While effectively improving the detection accuracy, the smaller algorithm
complexity is convenient for deployment on equipment with insufficient resources, and the detection
speed of 79 FPS also meets the requirements of real-time.</p>
    </sec>
    <sec id="sec-11">
      <title>4.Conclusion</title>
    </sec>
    <sec id="sec-12">
      <title>5.References</title>
      <p>This paper proposes an improved traffic target detection algorithm YOLOv5-Ghost-CA based on
YOLOv5s. The CA module is introduced to enhance the ability to capture location information of the
Backbone network, and improve the feature extraction ability of the Backbone network. Replacing the
convolution with step size of 2 in the network with GhostConv module reduces the amount of
parameters and GFLOPs. The experimental results show that the mAP of the improved algorithm is
increased by 3.5%, the amount of parameters is reduced by 24.3%, and the amount of computation is
reduced by 12.2%. It is more conducive to deploy on the equipment with insufficient computing
resources, and meets the real-time requirements, which has high application value.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L P</given-names>
            <surname>Fang</surname>
            , H J He
          </string-name>
          ,
          <string-name>
            <given-names>G M</given-names>
            <surname>Zhou.</surname>
          </string-name>
          <article-title>Overview of target detection algorithm[J]</article-title>
          .
          <source>Computer engineering and application</source>
          ,
          <year>2018</year>
          ,
          <volume>54</volume>
          (
          <issue>13</issue>
          ):
          <fpage>11</fpage>
          -
          <lpage>18</lpage>
          +
          <fpage>33</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J</given-names>
            <surname>Donahue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T</given-names>
            <surname>Darrell</surname>
          </string-name>
          , et al.
          <article-title>Rich feature hierarchies for object detection</article-title>
          and semanticsegmentation[C]//2014IEEE Conference on Computer Vision and Pattern Recognition,
          <year>2014</year>
          :
          <fpage>580</fpage>
          -
          <lpage>587</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <surname>Fast R-CNN</surname>
          </string-name>
          [C]//2015 IEEE International Conference on
          <source>Computer Vision</source>
          ,
          <year>2015</year>
          :
          <fpage>1440</fpage>
          -
          <lpage>1448</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S P</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <surname>K He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R</given-names>
            <surname>Girshick</surname>
          </string-name>
          , et al.
          <article-title>Faster R-CNN: towards real time object detection with region proposal networks[</article-title>
          <source>J]IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <year>2017</year>
          ,
          <volume>39</volume>
          (
          <issue>6</issue>
          ):
          <fpage>1137</fpage>
          -
          <lpage>1149</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X Y</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S P</given-names>
            <surname>Ren</surname>
          </string-name>
          , et al.
          <article-title>Spatial pyramid pooling in deep convolutional networks for visual</article-title>
          ,
          <source>cognition[J]IEEE transactions on pattern analysis and machine intelligence</source>
          ,
          <year>2015</year>
          ,
          <volume>37</volume>
          (
          <issue>9</issue>
          ):
          <fpage>1904</fpage>
          -
          <lpage>1916</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J</given-names>
            <surname>Redmon</surname>
          </string-name>
          ,
          <string-name>
            <surname>S Divvala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R</given-names>
            <surname>Girshick</surname>
          </string-name>
          , et al.
          <article-title>You only look once: unified, real-time object detection</article-title>
          [C]//2015 IEEE Conference on
          <source>Computer Vision and Pattern Recognition</source>
          ,
          <year>2015</year>
          :
          <fpage>6517</fpage>
          -
          <lpage>6525</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D</given-names>
            <surname>Anguelov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D</given-names>
            <surname>Erhan</surname>
          </string-name>
          , et al.
          <article-title>SSD:single shot multi-box detector</article-title>
          [C]//14th European Conference on Computer Vision.Cham:Springer,
          <year>2016</year>
          :
          <fpage>21</fpage>
          -
          <lpage>37</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Z</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.
          <article-title>Fcos: Fully convolutional one-stage object detection</article-title>
          [C]// Proceedings of the IEEE/CVF international conference on
          <source>computer vision</source>
          ,
          <year>2019</year>
          :
          <fpage>9627</fpage>
          -
          <lpage>9636</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S S</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Traffic scene multi-target detection based on deep learning[D]</article-title>
          . Hunan University,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>X</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>W Haiyan.</surname>
          </string-name>
          <article-title>Research on target detection algorithm in dense traffic scenes[J]</article-title>
          .
          <source>Computer technology and development</source>
          ,
          <year>2020</year>
          ,
          <volume>30</volume>
          (
          <issue>07</issue>
          ):
          <fpage>46</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>C H</surname>
          </string-name>
          <article-title>Liu</article-title>
          .
          <article-title>Automatic driving road target detection in complex traffic scenes</article-title>
          [D] Dalian University of technology,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y H</given-names>
            <surname>Yin.</surname>
          </string-name>
          <article-title>Research on traffic scene target detection method based on feature fusion</article-title>
          [D] Dalian University of technology,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y J</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y X</given-names>
            <surname>Gao</surname>
          </string-name>
          .
          <article-title>Lightweight beverage recognition network based on GhostNet residual structure</article-title>
          [J] Computer engineering,
          <year>2022</year>
          ,
          <volume>48</volume>
          (
          <issue>03</issue>
          ):
          <fpage>310</fpage>
          -
          <lpage>314</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y S</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C Y</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y K</given-names>
            <surname>Zhao</surname>
          </string-name>
          , et al.
          <article-title>Research on lightweight obstacle detection model based on model compression</article-title>
          [J/OL].
          <source>Laser Journal: 1-7.</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C Y</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H Y</given-names>
            <surname>LIAO</surname>
            , Y H Wu
          </string-name>
          , et al.
          <article-title>CSPNet: a new backbone that can enhance learning capability</article-title>
          of CNN[C]//Proceedings of IEEE/CVF Conference on Computer Vision and Pattern Recognition. Washington D. C. USA:IEEE Press，
          <year>2020</year>
          :
          <fpage>571</fpage>
          -
          <lpage>1580</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T Y</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <surname>P Dollar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R</given-names>
            <surname>Girshick</surname>
          </string-name>
          , et al.
          <article-title>Feature pyramid networks for object detection</article-title>
          [C]//2017 IEEE Conference on
          <article-title>Computer Vision and Pattern Recognition(CVPR)</article-title>
          .
          <source>Honolulu: IEEE Computer Society</source>
          ,
          <year>2017</year>
          , OI
          <volume>10</volume>
          .1109/CVPR.
          <year>2017</year>
          .
          <volume>106</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L</given-names>
            <surname>Qin</surname>
          </string-name>
          , et al.
          <article-title>Path aggregation network for instance segmentation[C]//Proceedings of the IEEE conference on computer vision and pattern recognition</article-title>
          .
          <year>2018</year>
          :
          <fpage>8759</fpage>
          -
          <lpage>8768</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Q</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J</given-names>
            <surname>Feng</surname>
          </string-name>
          .
          <article-title>Coordinate attention for efficient mobile network design[C]//</article-title>
          <source>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          .
          <year>2021</year>
          :
          <fpage>13713</fpage>
          -
          <lpage>13722</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G</given-names>
            <surname>Sun</surname>
          </string-name>
          .
          <article-title>Squeeze-and-excitation networks[C]//Proceedings of the IEEE conference on computer vision and pattern recognition</article-title>
          .
          <year>2018</year>
          :
          <fpage>7132</fpage>
          -
          <lpage>7141</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>K</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q</given-names>
            <surname>Tian</surname>
          </string-name>
          , et al. GhostNet
          <string-name>
            <surname>:More Features From Cheap Operations</surname>
          </string-name>
          [C]. /IEEE/CVF Conference on
          <source>Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2020</year>
          :
          <fpage>1577</fpage>
          -
          <lpage>1586</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>