# A Real-Time Image Semantic Segmentation Method Based on Multilabel Classification

Authors: Ran Jin; Xiaozhen Han; Tongrui Yu
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

Image semantic segmentation as a kind of technology has been playing a crucial part in intelligent driving, medical image analysis, video surveillance, and AR. However, since the scene needs to infer more semantics from video and audio clips and the request for real-time performance becomes stricter, whetherthe single-label classification method that was usually used before or the regular manual labeling cannot meet this end. Given the excellent performance of deep learning algorithms in extensive applications, the image semantic segmentation algorithm based on deep learning framework has been brought under the spotlight of development. This paper attempts to improve the ESPNet (Efficient Spatial Pyramid of Dilated Convolutions for Semantic Segmentation) based on the multilabel classification method by the following steps. First, the standard convolution is replaced by applying Receptive Field in Deep Convolutional Neural Network in the convolution layer, to the extent that every pixel in the covered area would facilitate the ultimate feature response. Second, the ASPP (Atrous Spatial Pyramid Pooling) module is improved based on the atrous convolution, and the DB-ASPP (Delate Batch Normalization-ASPP) is proposed as a way to reducing gridding artifacts due to the multilayer atrous convolution, acquiring multiscale information, and integrating the feature information in relation to the image set. Finally, the proposed model and regular models are subject to extensive tests and comparisons on a plurality of multiple data sets. Results show that the proposed model demonstrates a good accuracy of segmentation, the smallest network parameter at 0.3 M and the fastest speed of segmentation at 25 FPS.


---

## Body

## 1. Introduction

Multilabel classification evolved as the single-label classification method is gradually away from having the present needs satisfied. At first, it mainly took the form of text classification. The development of deep learning and the updates on computer vision have boosted image semantic segmentation, target recognition, and detection. Many kinds of deep learning-based methods for image semantic segmentation have been reported, including Fully Convolutional Network (FCN), Convolution and Graphics Model, Encoder-Decoder Model, Multiscale Pyramid Model, Region-Based Convolutional Neural Network (R-CNN) Model, Dilated Convolution and DeepLab Family Model, Recurrent Neural Network (RNN) Model, Attention Mechanism Model, Generate Adversarial Network (GAN), and Active Contour Model [1, 2]. Given the characteristics, these methods can be roughly categorized to the method based on region classification and that based on pixel classification. The method based on region classification refers to an alternative of dividing image into several blocks, extracting image feature by Convolutional Neural Network (CNN) and classifying the image blocks. This alternative can be subdivided into the method based on candidate region and that based on segmentation mask. In general, the category to which a pixel belongs may be marked according to the highest score region. This alternative may regard Visual Geometry Group Network (VGGNet), GoogLeNet, ResNet (Residual Neural Network), and other networks as the backbone network of the model for classification of image blocks. Since these methods contain Fully Connected Layer (FCL) in the classification network, the size of input image is required to be fixed and the model with generally a higher cost of memory, resulting in computational inefficiency and unsatisfactory segmentation effect. At present, there are also some extensions on this basis, such as the composite segmentation method based on encoder-decoder, combined with Dense Residual Block (DRB) and FCN [3–5]. Given this, FCN was put forward in 2014, which has been one of the most popular pixel-based classification methods. The space size of feature image as extracted by the CNN structure can be adjusted by upsampling until it matches the original image. For image segmentation task, FCN appears to be superior over conventional CNN because the input image in the model doesn’t have to be fixed size, and the network has an even higher computational efficiency. The stricter demand for real-time performance and huge computational power has put lightweight semantic segmentation under the spotlight. In 2017, Andrew Howard et al. proposed MobileNets (Efficient Convolutional Neural Networks for Mobile Vision) [6] and, later in 2018, proposed MobileNetV2. The underlying idea of MobileNets is to reduce the number of model parameters by means of separable convolution, leading to faster running speed of the model. In 2017, Zhang et al. from Megvill proposed ShuffleNet (an Extremely Efficient Convolutional Neural Network for Mobile) [7], and Ma et al. proposed ShuffleNetV2 in 2018. The underlying idea of ShuffleNet is to reduce the computational workload by using the convolution channel shuffle. For real-time semantic segmentation models, Adam Paszke et al. proposed ENet (a deep neural network architecture for real-time semantic segmentation) [8] in 2016, improved the pooling operation and output pooling mask at the time of downsampling, and improved recognition accuracy at the time of upsampling. In 2020, Tan [9] et al. from Google proposed ESPNet, which can capitalize on the two-way weighted feature pyramid structure for feature fusion and use the composite size method to uniformly scale down the resolution, depth, and width of backbone network, feature network, and predictive network.


## 2. Related Works

### 2.1. Multilabel Classification

Multilabel classification is considered as an issue in relation to classification, where a sample may be assigned with multiple target labels concurrently. For example, an image may contain urban buildings, vehicles, and people; a song is both lyrical and sentimental. Accordingly, a data sample (picture or music) may contain a plurality of different labels concurrently, which are used to characterize data attributes. What makes it hard to carry out multilabel learning is the explosive growth of output space. For example, if there are 10 labels available, the output space would be 210 in size. An effective mining of the label-to-label correlation is the only way to reduce the huge amount of output, which underpins the success of multilabel learning. Multilabel algorithms can be divided into three categories if we consider the intensity of correlation mining. First-order strategy: the correlation between one label and other labels is neglected. Second-order strategy: the pairwise correlation among labels is considered. High-order strategy: the correlation among a plurality of labels is considered. It should be noted that multilabel classification can be solved in three options. One alternative is issue transform options, including label transform-based options and instance transform-based options, e.g., binary relevance (BR) [10]. The second alternative is adaptive algorithm, that is, to modify some available learning algorithms, to the extent that the multilabel learning capability can be satisfied, e.g., Multilabel K-Nearest Neighbor (ML-KNN) [11]. The third alternative is integration method, an option evolved from regular issue transform or adaptive algorithm. The most famous ensemble of issue transform can be illustrated by RAKEL system [12], Ensemble of Pruned Sets (EPS) [13], and Ensemble of Classifier Chains (ECC) [14] proposed by Tsoumakas et al. Further details about these options are available in Figure 1.Figure 1
Method for multilabel classification.


### 2.2. ESPNet

The ESPNet was introduced by Mehta et al. [15], where a semantic segmentation network architecture featuring fast calculation and excellent effect of segmentation is presented in details. ESPNet can process data at 112 FPS on GPU in an ideal state or up to 9 FPS on edge device at a level even faster than the well-known lightweight networks—MobileNet [6], ENet [8], and ShuffleNet [7]. Provided that the control model only losses 8% of the classification accuracy, the ESPNet has the model parameters only 1/180 of PSPNet, known as the most excellent architecture at that time, but its processing speed is 22 times faster than PSPNet. In this published paper, a convolution module which is referred to as “Effective Spatial Pyramid” was introduced as a part of ESPNet. Consequently, such network architecture is characterized by fast speed, low power consumption, and low latency, which in turn makes it more suitable to deploy in some edge devices subject to more resource limits.Figure2 is the basic network architecture of ESPNet. In this model, point-by-point convolution is used to reduce the number of channels and sent to the hollow convolution pyramid. The greater receptive field is obtained from different scales of dilated convolution, alongside with feature fusion, so the amount of parameters is quite few. Following the reduced number of channels, the amount of parameters with respect to each dilated convolution is quite few. Figure 3 presents the number of channels, ratio, and merging strategy. The feature fusion method for merging strategy is sharply contrasted with that for the regular dilated convolution. The stepwise addition strategy is used as a way to avoiding gridding artifacts.Figure 2
Basic network architecture of ESPNet.Figure 3
Main architecture of ESPNet.ESPNetv2 was introduced by Mehta et al. in 2019. With the increased network depth in the EESP module, each convolution layer is improved by using the PRelu activation function, and the activation function is removed from the final group level convolution layer. The dilated convolution is used to the extent that the receptive field is dilated, the number of network parameters is reduced, and the running speed is increased. Figure4(a) provides an overview of the performance level of individual models by comparing the accuracy rate attainable by the respective model under different FLOPs, where the floating-point operations per second (FLOPs) is used as a reference. Figure 4(b) is the loss under the respective model, where the time is used as a reference.Figure 4
(a) Accuracy rate variation as a function of FLOPs. (b) Loss variation as a function of time.
(a)(b)In the past two years, some scholars have carried out useful research based on ESPNet [16–19]. Kim [16] proposed ESCNet based on ESPNet architecture which is one of the state-of-the-art real-time semantic segmentation network that can be easily deployed on edge devices. Nuechterlein [17] extended ESPNet, a fast and efficient network designed for vanilla 2D semantic segmentation, to challenging 3D data in the medical imaging domain.


## 2.1. Multilabel Classification

Multilabel classification is considered as an issue in relation to classification, where a sample may be assigned with multiple target labels concurrently. For example, an image may contain urban buildings, vehicles, and people; a song is both lyrical and sentimental. Accordingly, a data sample (picture or music) may contain a plurality of different labels concurrently, which are used to characterize data attributes. What makes it hard to carry out multilabel learning is the explosive growth of output space. For example, if there are 10 labels available, the output space would be 210 in size. An effective mining of the label-to-label correlation is the only way to reduce the huge amount of output, which underpins the success of multilabel learning. Multilabel algorithms can be divided into three categories if we consider the intensity of correlation mining. First-order strategy: the correlation between one label and other labels is neglected. Second-order strategy: the pairwise correlation among labels is considered. High-order strategy: the correlation among a plurality of labels is considered. It should be noted that multilabel classification can be solved in three options. One alternative is issue transform options, including label transform-based options and instance transform-based options, e.g., binary relevance (BR) [10]. The second alternative is adaptive algorithm, that is, to modify some available learning algorithms, to the extent that the multilabel learning capability can be satisfied, e.g., Multilabel K-Nearest Neighbor (ML-KNN) [11]. The third alternative is integration method, an option evolved from regular issue transform or adaptive algorithm. The most famous ensemble of issue transform can be illustrated by RAKEL system [12], Ensemble of Pruned Sets (EPS) [13], and Ensemble of Classifier Chains (ECC) [14] proposed by Tsoumakas et al. Further details about these options are available in Figure 1.Figure 1
Method for multilabel classification.


## 2.2. ESPNet

The ESPNet was introduced by Mehta et al. [15], where a semantic segmentation network architecture featuring fast calculation and excellent effect of segmentation is presented in details. ESPNet can process data at 112 FPS on GPU in an ideal state or up to 9 FPS on edge device at a level even faster than the well-known lightweight networks—MobileNet [6], ENet [8], and ShuffleNet [7]. Provided that the control model only losses 8% of the classification accuracy, the ESPNet has the model parameters only 1/180 of PSPNet, known as the most excellent architecture at that time, but its processing speed is 22 times faster than PSPNet. In this published paper, a convolution module which is referred to as “Effective Spatial Pyramid” was introduced as a part of ESPNet. Consequently, such network architecture is characterized by fast speed, low power consumption, and low latency, which in turn makes it more suitable to deploy in some edge devices subject to more resource limits.Figure2 is the basic network architecture of ESPNet. In this model, point-by-point convolution is used to reduce the number of channels and sent to the hollow convolution pyramid. The greater receptive field is obtained from different scales of dilated convolution, alongside with feature fusion, so the amount of parameters is quite few. Following the reduced number of channels, the amount of parameters with respect to each dilated convolution is quite few. Figure 3 presents the number of channels, ratio, and merging strategy. The feature fusion method for merging strategy is sharply contrasted with that for the regular dilated convolution. The stepwise addition strategy is used as a way to avoiding gridding artifacts.Figure 2
Basic network architecture of ESPNet.Figure 3
Main architecture of ESPNet.ESPNetv2 was introduced by Mehta et al. in 2019. With the increased network depth in the EESP module, each convolution layer is improved by using the PRelu activation function, and the activation function is removed from the final group level convolution layer. The dilated convolution is used to the extent that the receptive field is dilated, the number of network parameters is reduced, and the running speed is increased. Figure4(a) provides an overview of the performance level of individual models by comparing the accuracy rate attainable by the respective model under different FLOPs, where the floating-point operations per second (FLOPs) is used as a reference. Figure 4(b) is the loss under the respective model, where the time is used as a reference.Figure 4
(a) Accuracy rate variation as a function of FLOPs. (b) Loss variation as a function of time.
(a)(b)In the past two years, some scholars have carried out useful research based on ESPNet [16–19]. Kim [16] proposed ESCNet based on ESPNet architecture which is one of the state-of-the-art real-time semantic segmentation network that can be easily deployed on edge devices. Nuechterlein [17] extended ESPNet, a fast and efficient network designed for vanilla 2D semantic segmentation, to challenging 3D data in the medical imaging domain.


## 3. The Proposed Algorithm

ESPNet is evolved from the Efficient Spatial Pyramid (ESP) module, where the point convolution maps high-dimensional features to low-dimensional space by 1 × 1 convolution. In this section, ESPNet is improved based on integration and tuning of a plurality of technical methods as mentioned earlier, and its core constituent modules are described here. Figure5 is the process flow with respect to the improved model. The spatial pyramid of dilated convolution exploits K and N × N dilated convolution kernels, while resampling these low-dimensional feature images. The dilation rate of each convolution kernel is 2K−1(K = F1). This decomposition sharply reduces the number of parameters and memory required for the ESP module and retains a large effective receiving field (n−1) 2K−1. This sort of pyramid convolution operation is also referred to as “Spatial Dilation Convolution Pyramid.” Each dilated convolution kernel learns the weight of the respective receptive field, so it appears to be similar to spatial pyramid. Since ESPNet is superior to all high-efficiency CNN networks that are currently available, this model is designed and improved. Figure 6 is the ESPNet improvement based on the convolution factor decomposition as the first step.Figure 5
Functional flow figure of the improved model.Figure 6
Schematic diagram of convolution factorization.Provided that the parameters are constantly the same, a greater receptive field can be assured by atrous convolution, but it may be unfriendly to the recognition effect of some tiny objects. Finally, the improved model generates segmented images by exploiting the deconvolution principle of the decoding part in the similar encoding-decoding structure. The segmented images are fused with original images on the merging module, which provides an intuitive feeling of the accuracy of the model segmentation. Figure7 is the working principle figure of the improved model, and the algorithm used in the proposed model will use image pyramid during training, as expressed in equation (1).where Pnout is the feature prediction output of nth layer and Pnin is the feature input of nth layer. Resize(.) is used to adjust the image size.Figure 7
Working principle of the improved model.(1)Pnout=ConvPninPn−1out=ConvPn−1in+ResizePnout⋯P1out=ConvP1in+ResizeP2out,


### 3.1. Depthwise Separable Convolution

It can be inferred from the semantic segmentation analysis of CNN and decoding-encoding that the convolution layer stands as the core part. A matching convolution method should be available for adapting to different kinds of environments; otherwise, gridding, gridding artifacts, and other unfriendly phenomena would be aggravated. As a consequence, the model may not lead to a good effect of semantic segmentation. Given this, the convolution layer is improved by treating depthwise separable convolution as its core part, using a set of dilation rates and joining them by the segmentation method in ResNet. Figure8 describes how it works.Figure 8
Schematic structure diagram of depthwise separable convolution.As seen from Figure8, the input in the layer-by-layer convolution is M channel feature images, which are, respectively, convolved with M filters until M feature images are output. In contrast with the conventional convolution method, what makes this convolution method significantly different is that the learning process with respect to the channel-space correlation is asynchronous. To put it in other way, it will not follow synchronous learning, just as conventional convolution method does. Comparing the regular convolution equation (2) and the depthwise separable convolution equation (3), this can increase the speed of network training and widen up the network. As a result, the network can accommodate and transmit more available feature information, leading to improved working efficiency.(2)ConvW,yi,y=∑k,l,mK,l,MWk,l,m⋅yi+k,j+l,m.In the first step, the depth separable convolution is subject to channel convolution by equation (3) (in this paper, Θdenotes the multiplication of the corresponding elements) and then the pointwise convolution is performed by equation (4). Substituting equation (3) into equation (4), equation (5) with respect to the depthwise separable convolution can be obtained.(3)DepthwiseconvW,Yi,j=∑k,lK,LWk,lΘyi+k,j+l,(4)PointwiseconvW,Yi,j=∑mMWm⋅yi,j,m,(5)SepconvWp,Wd,yi,j=Pointwiseconvi,jWp,Depthwiseconvi,yWd,y,where W is convolution kernel, y is input feature image, both i and j are the resolution of input feature image, both k and l are the resolution of output feature image, and m is the number of channels.


### 3.2. DB-ASPP

In this paper, the ASPP module is introduced as a part of HDC to collect multiscale information, and the image-level feature information is integrated in available ASPP module. Considering the fusion needs, the batch normalization (BN) layer is filtered out. The course of ablation experiment can increase the number of BN layers and improve the accuracy of the activation function PRelu by approximately 1.4%, but the benefit of removal is that the parallel branch results directly disappear without postprocessing. In other words, the network parameters are reduced, and the speed is increased. Accordingly, the improved DB-ASPP module based on ASPP is proposed here.The atrous convolution has two functions: first, the receptive field is dilated; for example, whenr = 1, subject to dilated convolution, it becomes r = 2. However, the deficiency is that the reduced resolution in spatial distribution, and if the compression level is high, it will add to the difficulty level of the subsequent upsampling or deconvolution to restore the original image size. Further, the continuous downsampling combination layer will cause a serious reduction in the spatial resolution of feature image. And more context information can be extracted by atrous convolution. Figure 9 is the schematic diagram of how atrous convolution works. When r−1, the receptive field is 3 × 3. Subject to atrous convolution, namely, when r−2 as shown below, the receptive field will be 5 × 5. It is apparent that as the atrous rate increases, the range of receptive field that is recognizable by original convolution kernel has been significantly increased.Figure 9
Schematic structure diagram of depthwise separable convolution.Atrous convolution can increase the receptive field and control the resolution, but the current atrous convolution method is still vulnerable to an inherent issue—gridding issue. If the atrous convolution is continuously used and the atrous rate is improperly selected, certain pixels may not be always involved in the calculation process. For example, with respect to the pixelp in a certain layer of the atrous convolution, its value is limited to the adjacent zone of the upper layer, and its size is ksize × ksize with p as the center point. Assume that the atrous rate is r = 1 and ksize = 3, the pixel p is expressed by the red points as shown in Figure 10, the blue area denotes the range to be captured by the convolution, and then the lower layer image of Figure 10 can be obtained after two steps of operation (r = 1).Figure 10
Schematic structure diagram of depthwise separable convolution.From the white spots as shown in Figure10, many adjacent pixels are overlooked, and only a small part is used in the repetitive atrous convolution calculations. In addition, since the atrous convolution is constructed by zero value insertion among parameters in the convolution kernel, when the applicable atrous rate increases, the distance between non-zero values would also increase, and the relevance between local information will be destructed, leading to more serious loss of local information, aggravating the gridding effect in the generated feature image.Accordingly, Wang et al. proposed the Hybrid Dilated Convolution (HDC), and the atrous convolutions with different atrous rates are used continuously and alternately to reduce the impact of gridding issue. At one dimension, HDC is defined in the following equation:(6)ki=∑l=1Lhi+r⋅lgl,where h[i] denotes input signal, k[i] denotes output signal, gl denotes the filter with length L, and r is the dilation rate used for sampling process h[i]. In standard convolution, r = 1. Assume there are N atrous convolutions, whose convolution kernel size is ks × ks, {d1,…,di,…,dm} is its atrous rate, and Mi is the maximum distance between two non-zero points, which is computed using di as in the following equation:(7)Mi=MAXMi+1−2di,M−i+12Mi+1−di,di.Figure11 is the schematic diagram of the receptive field with respect to d = {1, 2, 5}. It can be confirmed that all pixels are involved as a part of the convolution operation, which suggests that HDC can solve gridding issue well.Figure 11
Schematic diagram of HDC.Based on the above HDC, the ASPP module as a part of ESPNet is improved here by introducing HDC and removing the BN layer. Figure12 presents the functional architecture. The dilated convolution available with four dilation rates can capture multiscale information in parallel on the top-level feature response of the backbone network. The improved ASPP module confers a greater receptive field to neurons, and the Pyramid Pooling Module (PPM) is introduced to the proposed ESP. As a result, the contextual semantic information in different regions can be aggregated to attain a better effect of segmentation.Figure 12
DB-ASPP schematic.In addition, for control of the model size and prevention of over-sized network, 1 × 1 convolution layer is added in front of each atrous convolution layer in DB-ASPP with reference to DenseNet and DenseASPP in order to reduce the depth of feature image to the specified size and further control the output size. Assume that each atrous convolution layer output hasn feature images, DB-ASPP has C0 feature images as input, and the lth 1 × 1 convolution layer in front of the lth convolution layer has Cl input feature images. Cl is computed using input C0, n, and l as in the following equation:(8)Cl=C0+nl−1.In DB-ASPP, each 1 × 1 convolution layer in front of the atrous convolution layer reduces the depth of the corresponding input feature image to C0/4, and all atrous convolution layers output C0/4. The parameters in DB-ASPP can be computed as written in the following equation:(9)Params=∑l=1Lcl×0.25c0+0.25k2×nc0,where L is the number of atrous convolution layers in DB-ASPP and k is the size of the convolution kernel to validate the effectiveness of DB-ASPP.


## 3.1. Depthwise Separable Convolution

It can be inferred from the semantic segmentation analysis of CNN and decoding-encoding that the convolution layer stands as the core part. A matching convolution method should be available for adapting to different kinds of environments; otherwise, gridding, gridding artifacts, and other unfriendly phenomena would be aggravated. As a consequence, the model may not lead to a good effect of semantic segmentation. Given this, the convolution layer is improved by treating depthwise separable convolution as its core part, using a set of dilation rates and joining them by the segmentation method in ResNet. Figure8 describes how it works.Figure 8
Schematic structure diagram of depthwise separable convolution.As seen from Figure8, the input in the layer-by-layer convolution is M channel feature images, which are, respectively, convolved with M filters until M feature images are output. In contrast with the conventional convolution method, what makes this convolution method significantly different is that the learning process with respect to the channel-space correlation is asynchronous. To put it in other way, it will not follow synchronous learning, just as conventional convolution method does. Comparing the regular convolution equation (2) and the depthwise separable convolution equation (3), this can increase the speed of network training and widen up the network. As a result, the network can accommodate and transmit more available feature information, leading to improved working efficiency.(2)ConvW,yi,y=∑k,l,mK,l,MWk,l,m⋅yi+k,j+l,m.In the first step, the depth separable convolution is subject to channel convolution by equation (3) (in this paper, Θdenotes the multiplication of the corresponding elements) and then the pointwise convolution is performed by equation (4). Substituting equation (3) into equation (4), equation (5) with respect to the depthwise separable convolution can be obtained.(3)DepthwiseconvW,Yi,j=∑k,lK,LWk,lΘyi+k,j+l,(4)PointwiseconvW,Yi,j=∑mMWm⋅yi,j,m,(5)SepconvWp,Wd,yi,j=Pointwiseconvi,jWp,Depthwiseconvi,yWd,y,where W is convolution kernel, y is input feature image, both i and j are the resolution of input feature image, both k and l are the resolution of output feature image, and m is the number of channels.


## 3.2. DB-ASPP

In this paper, the ASPP module is introduced as a part of HDC to collect multiscale information, and the image-level feature information is integrated in available ASPP module. Considering the fusion needs, the batch normalization (BN) layer is filtered out. The course of ablation experiment can increase the number of BN layers and improve the accuracy of the activation function PRelu by approximately 1.4%, but the benefit of removal is that the parallel branch results directly disappear without postprocessing. In other words, the network parameters are reduced, and the speed is increased. Accordingly, the improved DB-ASPP module based on ASPP is proposed here.The atrous convolution has two functions: first, the receptive field is dilated; for example, whenr = 1, subject to dilated convolution, it becomes r = 2. However, the deficiency is that the reduced resolution in spatial distribution, and if the compression level is high, it will add to the difficulty level of the subsequent upsampling or deconvolution to restore the original image size. Further, the continuous downsampling combination layer will cause a serious reduction in the spatial resolution of feature image. And more context information can be extracted by atrous convolution. Figure 9 is the schematic diagram of how atrous convolution works. When r−1, the receptive field is 3 × 3. Subject to atrous convolution, namely, when r−2 as shown below, the receptive field will be 5 × 5. It is apparent that as the atrous rate increases, the range of receptive field that is recognizable by original convolution kernel has been significantly increased.Figure 9
Schematic structure diagram of depthwise separable convolution.Atrous convolution can increase the receptive field and control the resolution, but the current atrous convolution method is still vulnerable to an inherent issue—gridding issue. If the atrous convolution is continuously used and the atrous rate is improperly selected, certain pixels may not be always involved in the calculation process. For example, with respect to the pixelp in a certain layer of the atrous convolution, its value is limited to the adjacent zone of the upper layer, and its size is ksize × ksize with p as the center point. Assume that the atrous rate is r = 1 and ksize = 3, the pixel p is expressed by the red points as shown in Figure 10, the blue area denotes the range to be captured by the convolution, and then the lower layer image of Figure 10 can be obtained after two steps of operation (r = 1).Figure 10
Schematic structure diagram of depthwise separable convolution.From the white spots as shown in Figure10, many adjacent pixels are overlooked, and only a small part is used in the repetitive atrous convolution calculations. In addition, since the atrous convolution is constructed by zero value insertion among parameters in the convolution kernel, when the applicable atrous rate increases, the distance between non-zero values would also increase, and the relevance between local information will be destructed, leading to more serious loss of local information, aggravating the gridding effect in the generated feature image.Accordingly, Wang et al. proposed the Hybrid Dilated Convolution (HDC), and the atrous convolutions with different atrous rates are used continuously and alternately to reduce the impact of gridding issue. At one dimension, HDC is defined in the following equation:(6)ki=∑l=1Lhi+r⋅lgl,where h[i] denotes input signal, k[i] denotes output signal, gl denotes the filter with length L, and r is the dilation rate used for sampling process h[i]. In standard convolution, r = 1. Assume there are N atrous convolutions, whose convolution kernel size is ks × ks, {d1,…,di,…,dm} is its atrous rate, and Mi is the maximum distance between two non-zero points, which is computed using di as in the following equation:(7)Mi=MAXMi+1−2di,M−i+12Mi+1−di,di.Figure11 is the schematic diagram of the receptive field with respect to d = {1, 2, 5}. It can be confirmed that all pixels are involved as a part of the convolution operation, which suggests that HDC can solve gridding issue well.Figure 11
Schematic diagram of HDC.Based on the above HDC, the ASPP module as a part of ESPNet is improved here by introducing HDC and removing the BN layer. Figure12 presents the functional architecture. The dilated convolution available with four dilation rates can capture multiscale information in parallel on the top-level feature response of the backbone network. The improved ASPP module confers a greater receptive field to neurons, and the Pyramid Pooling Module (PPM) is introduced to the proposed ESP. As a result, the contextual semantic information in different regions can be aggregated to attain a better effect of segmentation.Figure 12
DB-ASPP schematic.In addition, for control of the model size and prevention of over-sized network, 1 × 1 convolution layer is added in front of each atrous convolution layer in DB-ASPP with reference to DenseNet and DenseASPP in order to reduce the depth of feature image to the specified size and further control the output size. Assume that each atrous convolution layer output hasn feature images, DB-ASPP has C0 feature images as input, and the lth 1 × 1 convolution layer in front of the lth convolution layer has Cl input feature images. Cl is computed using input C0, n, and l as in the following equation:(8)Cl=C0+nl−1.In DB-ASPP, each 1 × 1 convolution layer in front of the atrous convolution layer reduces the depth of the corresponding input feature image to C0/4, and all atrous convolution layers output C0/4. The parameters in DB-ASPP can be computed as written in the following equation:(9)Params=∑l=1Lcl×0.25c0+0.25k2×nc0,where L is the number of atrous convolution layers in DB-ASPP and k is the size of the convolution kernel to validate the effectiveness of DB-ASPP.


## 4. Experiment and Analysis

### 4.1. Parameter Setting and Criteria for Evaluation

The proposed network model is trained based on the SGD algorithm, and its parameters are given in Table1. Following the experiment comparison as described above, the PReLU activation function and maximum pooling with proven best effect are selected. For assessment of the generalization ability in transfer learning, the loss function set with 4,200 iterations is used for testing so as to observe the numerical results in the optimization process.Table 1
SGD parameter setting.
Description parameterParameter settingLearning rate0.01Momentum0.8Weight decay4The Mean Intersection over Union (MIoU), Params, and FPs are used to evaluate the performance of model. MIoU is one of the important evaluation indexes in the semantic segmentation model, which measures the advantages and disadvantages of the algorithm by calculating the intersection and union ratio (that is, calculating the ratio between TP and TP + FN + FP). The calculation method is shown in formula (10). Params is the parameter value, and the smaller value means the better lightweight feature of the model and the lower dependence on high-performance equipment. FPS is the number of frames transmitted and recognized per second in semantic segmentation. The higher the T values, the faster speed it means:(10)MIoU=1k+1∑i=0kpii∑j=0kpij+∑j=0kpji−pii,where Pij is the number of pixels misjudged as class j in class i. Pii is the number of pixels predicted correctly.


### 4.2. Self-Built Datasets

The experimental data are modified on the basis of Pascal VOC dataset, adding the road images taken by the author around the campus and removing some small category images in Pascal VOC dataset, such as potted plant and chair. The classification of the self-built datasets is shown in Table2.Table 2
The self-built datasets.
Train setTrain setTrain set 1Train set 1ImagesObjectImagesObjectImagesObjectImagesObjectAeroplane112151126155238306204285Bicycle116176127177243353239337Bus9711589114186229174213Car37662533762571312507211201Horse139182148180287362274348Motorbike120167125172245339222325Person1025235898323322008469020074528Total19853774193537553920752938417237


### 4.3. Experiment Results

We conduct three kinds of comparative experiments in order to fully prove the performance of the proposed algorithm. The first is the ablation comparative experiment of DB-ASPP proposed in this paper. The second is the comparison of the experimental results between ESPNet and improved model. The third is the comparison of the improved model and other sever models such as SegNet (a Deep Convolutional Encoder-Decoder Architecture for Image Segmentation).


#### 4.3.1. Performance Comparison of DB-ASPP Ablation Experiment

The Pascal VOC verification set is used to conduct ablation experiment. Provided that other parameters are the same, the performance of ASPP, DenseNet, DenseASPP, and DB-ASPP is compared. Table3 lists the experiment results. Referring to the experiment results, the accuracy of DB-ASPP increases by 0.4% MIoU, 1.1% MIoU, and 2.3% MIoU, respectively, compared with DenseASPP, DenseNet, and ASPP.Table 3
Comparison of experiment results.
ASPPDenseASPPDenseNetDB-ASPPMIoU (%)√68.2√70.1√69.4


#### 4.3.2. Comparison of ESPNet and Improved ESPNet Model

In this section, the segmentation results of ESPNet and improved ESPNet on self-result datasets are showed, as well as the loss function of the improved model in the numerical optimization process. As shown in Figures13–15, respectively, it can be seen from Figures 13 and 14 that the output segmentation images of the improved model are almost consistent with the segmentation standard image, and the output segmentation images of the improved model are also well fused with the original images. It shows that the improved models have good accuracy segmentation and good semantic segmentation effect.Figure 13
The segmentation of ESPNet on self-built datasets.Figure 14
Results of the improved ESPNet model on self-built dataset: (a) original image; (b) segmented image; (c) fused image.
(a)(b)(c)Figure 15
Results of the improved ESPNet model on self-built datasets.There are 6 loss curves in Figure15, with an aim of analyzing the loss of different functions in a full scale, so that the experiment results can be accurately optimized.In addition to the loss function of train sets and the validation set loss function, the attention mechanism loss curve (loss_att) and the time correlation loss function (loss_ctc) with respect to train sets and test sets are configured to detect the model capability to solve and generalize real-time issues.


#### 4.3.3. Comparison of the Proposed Model and Common Models

The proposed model is validated on the self-built datasets. Provided with the same memory and calculation condition, its performance is superior to some efficient convolutional neural networks under the standard metrics and introduced performance metrics, with the test results given in Tables4 and 5.Table 4
Comparison of the experiment results on self-built datasets by category.
Network modelBuildingsTreesSkyCarsRoadPedestriansCyclistsMIoU (%)Accuracy (%)The proposed model81.185.982.083.795.242.650.374.489.1SegNet78.879.990.583.292.951.240.873.988.8RefineNet78.274.592.183.593.546.548.173.888.4DeepLab81.573.288.384.194.948.450.174.489.1PSPNet8074.290.583.190.549.747.373.688.3LRR76.479.392.581.589.755.247.574.689.2Dilation-877.985.092.279.392.452.448.975.491.5FCN-8s79.981.588.676.892.241.64071.584.3Table 5
The self-built datasets.
ModelThe proposed modelSegNetRefineNetDeepLabPSPNetLRRDilation-8FCN-8Params3.0 K29.5 M42.6 M44.04 M65.7 M48M141.13 M134.5 MFPs25161212691915Table4 provides a summary of the recognition ability of the proposed model and other seven models for different kinds of objects on the self-built dataset, where the bold figures denote the highest accuracy in the respective category. The MIoU refers to the mean value of the overlapping rates with respect to the target window generated by the proposed model and the previously marked window. The higher value of this parameter means the higher recognition accuracy.It can be seen from Table4 that the recognition accuracy of the proposed model is high in most categories. However, in the Sky and Pedestrian, corresponding value is 82.0 and 42.6, respectively, and the ranking is the penultimate and the penultimate, respectively, which is the obvious shortcomings of the proposed model. The preliminary analysis is due to the fuzzy absence of boundary information in the ablation experiment and data training stage.In addition, different models are compared for the amount of parameters and real-time performance, as given in Table5.Referring to Table5, the amount of parameters involved in the paper is very small and the recognition and segmentation are fast. This suggests that provided with good accuracy, the proposed model has high real-time performance without the support of strong computing power.


## 4.1. Parameter Setting and Criteria for Evaluation

The proposed network model is trained based on the SGD algorithm, and its parameters are given in Table1. Following the experiment comparison as described above, the PReLU activation function and maximum pooling with proven best effect are selected. For assessment of the generalization ability in transfer learning, the loss function set with 4,200 iterations is used for testing so as to observe the numerical results in the optimization process.Table 1
SGD parameter setting.
Description parameterParameter settingLearning rate0.01Momentum0.8Weight decay4The Mean Intersection over Union (MIoU), Params, and FPs are used to evaluate the performance of model. MIoU is one of the important evaluation indexes in the semantic segmentation model, which measures the advantages and disadvantages of the algorithm by calculating the intersection and union ratio (that is, calculating the ratio between TP and TP + FN + FP). The calculation method is shown in formula (10). Params is the parameter value, and the smaller value means the better lightweight feature of the model and the lower dependence on high-performance equipment. FPS is the number of frames transmitted and recognized per second in semantic segmentation. The higher the T values, the faster speed it means:(10)MIoU=1k+1∑i=0kpii∑j=0kpij+∑j=0kpji−pii,where Pij is the number of pixels misjudged as class j in class i. Pii is the number of pixels predicted correctly.


## 4.2. Self-Built Datasets

The experimental data are modified on the basis of Pascal VOC dataset, adding the road images taken by the author around the campus and removing some small category images in Pascal VOC dataset, such as potted plant and chair. The classification of the self-built datasets is shown in Table2.Table 2
The self-built datasets.
Train setTrain setTrain set 1Train set 1ImagesObjectImagesObjectImagesObjectImagesObjectAeroplane112151126155238306204285Bicycle116176127177243353239337Bus9711589114186229174213Car37662533762571312507211201Horse139182148180287362274348Motorbike120167125172245339222325Person1025235898323322008469020074528Total19853774193537553920752938417237


## 4.3. Experiment Results

We conduct three kinds of comparative experiments in order to fully prove the performance of the proposed algorithm. The first is the ablation comparative experiment of DB-ASPP proposed in this paper. The second is the comparison of the experimental results between ESPNet and improved model. The third is the comparison of the improved model and other sever models such as SegNet (a Deep Convolutional Encoder-Decoder Architecture for Image Segmentation).


### 4.3.1. Performance Comparison of DB-ASPP Ablation Experiment

The Pascal VOC verification set is used to conduct ablation experiment. Provided that other parameters are the same, the performance of ASPP, DenseNet, DenseASPP, and DB-ASPP is compared. Table3 lists the experiment results. Referring to the experiment results, the accuracy of DB-ASPP increases by 0.4% MIoU, 1.1% MIoU, and 2.3% MIoU, respectively, compared with DenseASPP, DenseNet, and ASPP.Table 3
Comparison of experiment results.
ASPPDenseASPPDenseNetDB-ASPPMIoU (%)√68.2√70.1√69.4


### 4.3.2. Comparison of ESPNet and Improved ESPNet Model

In this section, the segmentation results of ESPNet and improved ESPNet on self-result datasets are showed, as well as the loss function of the improved model in the numerical optimization process. As shown in Figures13–15, respectively, it can be seen from Figures 13 and 14 that the output segmentation images of the improved model are almost consistent with the segmentation standard image, and the output segmentation images of the improved model are also well fused with the original images. It shows that the improved models have good accuracy segmentation and good semantic segmentation effect.Figure 13
The segmentation of ESPNet on self-built datasets.Figure 14
Results of the improved ESPNet model on self-built dataset: (a) original image; (b) segmented image; (c) fused image.
(a)(b)(c)Figure 15
Results of the improved ESPNet model on self-built datasets.There are 6 loss curves in Figure15, with an aim of analyzing the loss of different functions in a full scale, so that the experiment results can be accurately optimized.In addition to the loss function of train sets and the validation set loss function, the attention mechanism loss curve (loss_att) and the time correlation loss function (loss_ctc) with respect to train sets and test sets are configured to detect the model capability to solve and generalize real-time issues.


### 4.3.3. Comparison of the Proposed Model and Common Models

The proposed model is validated on the self-built datasets. Provided with the same memory and calculation condition, its performance is superior to some efficient convolutional neural networks under the standard metrics and introduced performance metrics, with the test results given in Tables4 and 5.Table 4
Comparison of the experiment results on self-built datasets by category.
Network modelBuildingsTreesSkyCarsRoadPedestriansCyclistsMIoU (%)Accuracy (%)The proposed model81.185.982.083.795.242.650.374.489.1SegNet78.879.990.583.292.951.240.873.988.8RefineNet78.274.592.183.593.546.548.173.888.4DeepLab81.573.288.384.194.948.450.174.489.1PSPNet8074.290.583.190.549.747.373.688.3LRR76.479.392.581.589.755.247.574.689.2Dilation-877.985.092.279.392.452.448.975.491.5FCN-8s79.981.588.676.892.241.64071.584.3Table 5
The self-built datasets.
ModelThe proposed modelSegNetRefineNetDeepLabPSPNetLRRDilation-8FCN-8Params3.0 K29.5 M42.6 M44.04 M65.7 M48M141.13 M134.5 MFPs25161212691915Table4 provides a summary of the recognition ability of the proposed model and other seven models for different kinds of objects on the self-built dataset, where the bold figures denote the highest accuracy in the respective category. The MIoU refers to the mean value of the overlapping rates with respect to the target window generated by the proposed model and the previously marked window. The higher value of this parameter means the higher recognition accuracy.It can be seen from Table4 that the recognition accuracy of the proposed model is high in most categories. However, in the Sky and Pedestrian, corresponding value is 82.0 and 42.6, respectively, and the ranking is the penultimate and the penultimate, respectively, which is the obvious shortcomings of the proposed model. The preliminary analysis is due to the fuzzy absence of boundary information in the ablation experiment and data training stage.In addition, different models are compared for the amount of parameters and real-time performance, as given in Table5.Referring to Table5, the amount of parameters involved in the paper is very small and the recognition and segmentation are fast. This suggests that provided with good accuracy, the proposed model has high real-time performance without the support of strong computing power.


## 4.3.1. Performance Comparison of DB-ASPP Ablation Experiment

The Pascal VOC verification set is used to conduct ablation experiment. Provided that other parameters are the same, the performance of ASPP, DenseNet, DenseASPP, and DB-ASPP is compared. Table3 lists the experiment results. Referring to the experiment results, the accuracy of DB-ASPP increases by 0.4% MIoU, 1.1% MIoU, and 2.3% MIoU, respectively, compared with DenseASPP, DenseNet, and ASPP.Table 3
Comparison of experiment results.
ASPPDenseASPPDenseNetDB-ASPPMIoU (%)√68.2√70.1√69.4


## 4.3.2. Comparison of ESPNet and Improved ESPNet Model

In this section, the segmentation results of ESPNet and improved ESPNet on self-result datasets are showed, as well as the loss function of the improved model in the numerical optimization process. As shown in Figures13–15, respectively, it can be seen from Figures 13 and 14 that the output segmentation images of the improved model are almost consistent with the segmentation standard image, and the output segmentation images of the improved model are also well fused with the original images. It shows that the improved models have good accuracy segmentation and good semantic segmentation effect.Figure 13
The segmentation of ESPNet on self-built datasets.Figure 14
Results of the improved ESPNet model on self-built dataset: (a) original image; (b) segmented image; (c) fused image.
(a)(b)(c)Figure 15
Results of the improved ESPNet model on self-built datasets.There are 6 loss curves in Figure15, with an aim of analyzing the loss of different functions in a full scale, so that the experiment results can be accurately optimized.In addition to the loss function of train sets and the validation set loss function, the attention mechanism loss curve (loss_att) and the time correlation loss function (loss_ctc) with respect to train sets and test sets are configured to detect the model capability to solve and generalize real-time issues.


## 4.3.3. Comparison of the Proposed Model and Common Models

The proposed model is validated on the self-built datasets. Provided with the same memory and calculation condition, its performance is superior to some efficient convolutional neural networks under the standard metrics and introduced performance metrics, with the test results given in Tables4 and 5.Table 4
Comparison of the experiment results on self-built datasets by category.
Network modelBuildingsTreesSkyCarsRoadPedestriansCyclistsMIoU (%)Accuracy (%)The proposed model81.185.982.083.795.242.650.374.489.1SegNet78.879.990.583.292.951.240.873.988.8RefineNet78.274.592.183.593.546.548.173.888.4DeepLab81.573.288.384.194.948.450.174.489.1PSPNet8074.290.583.190.549.747.373.688.3LRR76.479.392.581.589.755.247.574.689.2Dilation-877.985.092.279.392.452.448.975.491.5FCN-8s79.981.588.676.892.241.64071.584.3Table 5
The self-built datasets.
ModelThe proposed modelSegNetRefineNetDeepLabPSPNetLRRDilation-8FCN-8Params3.0 K29.5 M42.6 M44.04 M65.7 M48M141.13 M134.5 MFPs25161212691915Table4 provides a summary of the recognition ability of the proposed model and other seven models for different kinds of objects on the self-built dataset, where the bold figures denote the highest accuracy in the respective category. The MIoU refers to the mean value of the overlapping rates with respect to the target window generated by the proposed model and the previously marked window. The higher value of this parameter means the higher recognition accuracy.It can be seen from Table4 that the recognition accuracy of the proposed model is high in most categories. However, in the Sky and Pedestrian, corresponding value is 82.0 and 42.6, respectively, and the ranking is the penultimate and the penultimate, respectively, which is the obvious shortcomings of the proposed model. The preliminary analysis is due to the fuzzy absence of boundary information in the ablation experiment and data training stage.In addition, different models are compared for the amount of parameters and real-time performance, as given in Table5.Referring to Table5, the amount of parameters involved in the paper is very small and the recognition and segmentation are fast. This suggests that provided with good accuracy, the proposed model has high real-time performance without the support of strong computing power.


## 5. Conclusion

In this paper, a real-time image semantic segmentation model based on multilabel classification is proposed. The ESPNet model is improved with reference to the characteristics of multilabel classification learning by the following steps: first, the standard convolution is replaced by applying Receptive Field in Deep Convolutional Neural Network in the convolution layer, to the extent that every pixel in the covered area would facilitate the ultimate feature response; second, the ASPP module is improved based on the atrous convolution, the DB-ASPP is proposed as a way to reducing gridding artifacts due to the multilayer atrous convolution, acquiring multiscale information, and integrating the feature information in relation to the image set; finally, subject to extensive tests and comparisons, the proposed model demonstrates smaller number of parameters, faster segmentation, and higher accuracy, compared with other models.Although the proposed model has improved in real-time and accuracy, there is still a gap compared with the accuracy of non real-time image semantic segmentation model. The next work will focus on improving the accuracy, mainly considering the integration of shallow network in feature information and the optimization of boundary information collection and processing methods.



---

*Source: 9963974-2021-06-01.xml*