# Intelligent Detection of Foreign Matter in Coal Mine Transportation Belt Based on Convolution Neural Network

Authors: Guanchao Ma; Xisheng Wang; Jianfeng Liu; Weibiao Chen; Qinghe Niu; Yun Liu; Xiaocheng Gao
Journal: Scientific Programming
 (2022)

---

## Abstract

This paper applies the CenterNet target detection algorithm to the foreign object detection of coal conveying belts in coal mines. Given the fast running speed of coal conveying belts and the influence of background and light sources on the objects to be inspected, an improved algorithm of CenterNet is proposed. First, the depth separable volume is introduced. The product replaces the standard convolution, which improves the detection efficiency. At the same time, the normalization method is optimized to reduce the consumption of computer memory. Finally, the weighted feature fusion method is added so that the features of each layer are fully utilized, and the detection accuracy is improved. The experimental results show that the improved algorithm has improved speed and accuracy compared with the original CenterNet algorithm. The foreign object detection algorithm proposed in this paper mainly detects coal gangue and can also detect iron tools such as bolts, drill bits, and channel steel. In the experimental environment, the average detection rate is about 20fps, which can meet the needs of real-time detection.


---

## Body

## 1. Introduction

As the main artery of coal mining and transportation, the working state of coal transportation belt directly affects the mining and transportation volume of coal. Foreign matters on the belt, such as large gangue and anchor bolt, are easy to cause problems such as scratch and tear of the belt and coal stacking and blocking at the coal chute during the high-speed operation of the belt. Therefore, the detection of large blocks, anchor bolts, and other foreign matters on the transportation belt can effectively ensure the safe production of the coal mine [1, 2].Both target detection and image classification technology can realize the classification and recognition of belt foreign objects. However, target detection needs to locate the foreign object in the image before recognition, which increases the amount of calculation of the network to a certain extent, while image classification technology can directly identify the foreign object without locating the foreign object, and more computing resources can be used in fast foreign object recognition.The complex environment of the mine makes the application of the existing image classification methods in the classification of foreign objects in coal conveying belt very challenging. Many scholars introduce machine vision technology into the image classification of foreign objects in the mine. Wang et al. [3] identified large foreign bodies of belt conveyor based on interframe difference method, threshold classification, and select-shape operator. He et al. [4] used the classification method of support vector machine to classify foreign objects in combination with the texture and gray features of foreign objects. Zhang [5] used multifeature fusion, combined with k-nearest neighbor algorithm and support vector machine for foreign object recognition. The above methods have achieved good results, but the image processing method combining feature extraction and classification algorithm has some problems, such as poor robustness and easy to be affected by illumination [6–9].Convolution neural network uses convolution method for feature extraction, which has strong robustness and has been widely used in many fields [10–13]. Some scholars also study the image classification network of mine foreign bodies. Pu et al. [14] established a foreign object recognition model based on vgg16 network and the idea of transfer learning, but the sample set was small, only 240 pieces. Su et al. [15] designed an improved LeNet-5 network and trained 20000 foreign object pictures in nonproduction environment, with a recognition rate of 95.88%. Ma [16], based on MobileNet network, optimized the network structure, improved the loss function, and further improved the recognition rate according to the characteristics of foreign object image. At this stage, the shortcomings of image classification of mine foreign bodies are as follows: (1). The sample collection is ideal without considering the actual working environment. (2). The network model has high complexity, large amount of parameters, low accuracy, and poor real-time performance.Based on convolution neural network, in order to improve the adaptability of the algorithm for the detection of foreign matters in coal conveying belt under coal mine, this paper puts forward the corresponding improved method. In view of the low image quality caused by dark and uneven illumination in the underground, firstly, the dataset is preprocessed. Aiming at the problem of complex background of foreign object and large interference by coal block, the training data is correctly marked, the backbone network with good effect is adopted, and the weighted feature fusion of feature layers with different scales is introduced, which speeds up the convergence speed and reduces the amount of parameter calculation. Under the condition of ensuring the detection speed, the detection accuracy has been greatly improved.


## 2. Methods

### 2.1. Target Detection Algorithm

The CenterNet target detection method was proposed at the 2019 CVPR (Computer Vision and Pattern Recognition) conference [17–21]. The core idea of the algorithm is to regard the object to be detected as a point, that is, the center point of the target frame. Then, the center is found through the heat map and other attributes of the target object, such as the size information and pose information of the thing. The network structure of the CenterNet algorithm adopts ResNet-18, DLA-34, and Hourglass-104, three backbone networks for design and experiment. The three networks are complete encoding-decoding networks. The resolution of the final output feature map is subsampled 4 times compared to the original image, so that it can adapt to the detection of objects of various scales without multiscale design. The algorithm is based on anchor-free, so there is no need to set anchor boxes in advance, thereby avoiding the selection of related hyperparameters and eliminating the postprocessing process of NMS, which significantly reduces the computational load and training time of the network. The CenterNet object detection algorithm consists of three independent head structures: the center point prediction, the center point offset, and the target box’s size, as shown in Figure 1.Figure 1
Algorithm structure.Assuming thatI∈RW×H×3 is the input image, where W and H represent the width and height of the image, respectively. After it is sent to the backbone network, a heat map containing the key will be generated.(1)Y∈0,1W/R×H/R×C,where R is the subsampled factor and C is the number of classes in the detection target.If classc is detected at the position x,iyi of the heat map, Y^x,y,c=1; on the contrary, if there is no target object at the point, Y^x,y,c=0.In the training phase, for an object, assuming that the coordinates of its real frame in the input image arex1,y1,x2,andy2, the center point of the object can be expressed as p=x1+x2/2,y1+y2/2. After subsampled, the coordinates of the point are mapped to the heat map as p˜=⌊p/R⌋ and mapped it to the heat map Y∈0,1W/R×H/R×C through the Gaussian kernel transformation of the following formula:(2)yxyc=exp−x−p˜x2+y−p˜y22σp2.where σp is the standard deviation of the object size adaptation if the Gaussian kernels of two objects of the same category overlap, taking the one with the most value.In the prediction stage, the most considerable eight-neighborhood value is first screened on the heat map, which is equivalent to performing an entire pooling operation with a kernel size of 3 on the heat map, and a total of 100 such values are selected. Assuming thatPc is the detected point, the coordinate of the i-th key point is x,iyi and using this point to regress, the calibration frame is(3)xi+δxi−wi2,yi+δyi−hi2,xi+δxi+wi2,yi+δyi+hi2s.where x^i,y^i=O^x^i,y^i is the offset of the point in the heat map relative to the original image during the subsampled process and w^i,h^i=S^x^i,y^i is the length and width of the target corresponding to the current point measured.Y^x,y,c=0 is used to represent the confidence of the point, that is, the probability of the existence of an object at the current center point. In this paper, the screening threshold is set to 0.3. For the 100 values selected above, it will be reserved as the final result if the predicted probability is greater than the threshold.The Loss function of the CenterNet algorithm consists of three parts: the category loss functionLcls, the regression loss function Lsize, and the bias loss function Loff, which are linear combinations of the three.(4)Ldet=Lcls+λregLreg+λoffLoff.The category loss function is the Focal Loss function.(5)Lcls=−1N1−Y^xyclogY^xycYxyc=1,1−YxycβY^xycαlog1−Y^xycother.The target center bias loss function is(6)Loff=1N∑pO^p˜−pR−p˜.The regression loss function is(7)Lreg=1N∑k=1NSpk−sk.The relevant hyperparameters are chosen asλreg=0.1, λoff=0.1, α=2, and β=4.


### 2.2. Hourglass Network Improvements

In this paper, the Hourglass-104 network [22] is selected as the backbone network of the CenterNet algorithm to extract features and generate heat maps. The network consists of two Hourglass modules stacked, as shown in Figure 2.Figure 2
The structure of Hourglass-104 network.For the first-order module shown in Figure3, the network adopts a fully convolutional neural network structure in the form of encoding-decoding. The repeated use of bottom-up and top-down supervision mechanisms combined with intermediate results has achieved good results in keypoint detection.Figure 3
The first-order module.The most basic network unit in the Hourglass-104 network is the residual module, as shown in Figure4. Almost all the network computation is consumed in the convolution operation of the residual module. For the detection task in this paper, since the datasets are directly derived from video surveillance, the image resolution is vast, the training time is also very long, and the consumption of computer hardware facilities is also relatively high.Figure 4
The residual module in the Hourglass-104 network.To solve this problem, depthwise separable convolution (DSC) module is introduced. The DSC module is a lightweight network. In the processing process, the depthwise convolution of spatial relationship mapping is performed first, and then the point-by-point convolution of channel relationship mapping is performed. In the process of network training and detection, the calculation of parameters can be significantly reduced, which dramatically improves the network’s work efficiency. The structure diagram of the residual module after introducing DSC is shown in Figure5.Figure 5
The residual module after introducing DSC.Assume that the input is (B, C, W, H) data, where B, C, W, and H are the size of the feature image batch size, the number of channels, width, and height, respectively. The convolution operation of3×3is performed, and the calculation of standard convolution is as follows:(8)stc=B×C×W×H×3×3.Depthwise separable convolution for calculation is used first, and then the depthwise convolution operation is performed, the calculation of the amount is as follows:(9)dw=C×H×W×3×3.Then, the pointwise convolution operation is performed, and the calculation of the amount is as follows:(10)pw=B×C×W×H.The total computational cost of depthwise separable convolution is the sum of the two.(11)dsc=dw+pw=B+3×3×C×W×H.The computational cost ratio of the standard convolution operation and the depthwise separable convolution operation is as follows:(12)dscstc=B+3×3×C×W×HB×C×W×H×3×3=1B+13×3.When a lot of data are processed, the difference between the two calculation methods is more prominent.


### 2.3. Group Normalization Method

The calculation result of the BN layer depends on the data of the current batch. When the batch size is small, the mean and variance of the batch data are less representative, so the final result is also greatly affected. As shown in Figure4, as the batch size becomes smaller and smaller, the reliability of the statistical information calculated by the BN layer becomes worse and worse, which will quickly lead to an increase in the final error rate. However, when the batch size is more significant, there is no noticeable difference. In target detection, segmentation, and video-related algorithms, the batch size is generally set relatively small due to large input images, diverse dimensions, and computer performance reasons. To weaken the influence of small-batch training on the detection results and make the CenterNet algorithm more flexibly applied to different hardware configuration environments, this paper improves the BN (batching normalization) in the backbone network to GN (grouping normalization).Unlike BN, which normalizes channel by channel, GN groups channels and normalizes them in groups. First, the C channels are divided intoG groups, and S=kc|c/G=k,c=0,1,…,C is the channel number set composed of the channel numbers that fall into the k-th channel group, where k∈0,1,…,G−1, let the i-th feature of the j-th sample of the current mini-batch sample set in the c-th channel be xij,c, the result after normalization is yij,c, and the corresponding calculation formula is as follows:(13)xij,c=1σikxij,c−μikand(14)yij,c=ax^ij,c+b,where sum is the mean and standard deviation of the i-th feature of each feature map of the k-th channel, respectively,(15)μik=1m⋅Sk∑j=1m∑c∈Skxij,cand(16)σik=1m⋅Sk∑j=1m∑c∈Skxij,c−μik2+ε.The group-based normalization groups the feature map channels, making each channel’s mean and standard deviation more stable, effectively weakening the influence of the number of samples in the small-batch sample set on the feature normalization, and at the same time, the learning efficiency of the model based on the gradient descent method under low memory capacity is improved.


### 2.4. Weighted Feature Map Fusion

In the CenterNet network structure, the input image is input into the Hourglass-104 network after being subsampled 4 times. After 8 times, 16 times, 32 times, 64 times, and 128 times of subsampled in turn, and then 2 times of upsampling in turn, only one feature map is output. The output feature map size is subsampled 4 times from the input image. It can be seen that only using the most extensive feature map for target detection will inevitably lose some features of the image.To make full use of the feature map generated after the convolution operation, improve the detection ability of small-sized targets, and reduce the algorithm’s complexity. In this paper, the input image is subsampled 2 times, and then sent to Hourglass, and then subsampled2 times, 4 times, 8 times, and 16 times in a turn, and output four feature maps, namely,P1, P2, P3, and P4, each feature’s layer resolution is 1/2i+1 times the input image, and multiple output feature maps are fused. Since each feature map contributes differently to the final fusion output, feature fusion cannot be performed directly. This paper uses a weighted method to fuse the features of each feature map; that is, when the feature map is fused, a learnable weight is assigned to each input feature map. During training, the network can learn to change the fusion weight of each feature map to change the importance of each feature map to the final detection result. To reduce the number of parameters and computation, the improved model directly uses short-circuit connections in the bypass convolution and instantly removes the convolution operation. The schematic diagram of feature fusion is shown in Figure 6. The feature maps from high-level to low-level are obtained after upsampling, and then added, and the final output has only one fused feature map pout.Figure 6
Feature fusion.The calculation formula of feature fusion is(17)O=∑iωiε+∑jωj⋅Ii,where Ii is the input feature map, the fused feature map, and ωi, ωi∈0,1 is the corresponding weight. A minimum value ε=1e−4 is set to avoid the situation where the denominator in the above formula is 0.The fast normalized fusion method is also used for weight fusion of the feature maps output by the two Hourglasses, and the calculation formula is(18)Pout=∑ωij⋅Pij∑ωij+ε.The schematic diagram of weight fusion is shown in Figure7.Figure 7
Weight fusion.The final improved CenterNet (Improve-CN) algorithm network structure is shown in Figure8.Figure 8
Improved CenterNet (Improve-CN) algorithm network structure.


## 2.1. Target Detection Algorithm

The CenterNet target detection method was proposed at the 2019 CVPR (Computer Vision and Pattern Recognition) conference [17–21]. The core idea of the algorithm is to regard the object to be detected as a point, that is, the center point of the target frame. Then, the center is found through the heat map and other attributes of the target object, such as the size information and pose information of the thing. The network structure of the CenterNet algorithm adopts ResNet-18, DLA-34, and Hourglass-104, three backbone networks for design and experiment. The three networks are complete encoding-decoding networks. The resolution of the final output feature map is subsampled 4 times compared to the original image, so that it can adapt to the detection of objects of various scales without multiscale design. The algorithm is based on anchor-free, so there is no need to set anchor boxes in advance, thereby avoiding the selection of related hyperparameters and eliminating the postprocessing process of NMS, which significantly reduces the computational load and training time of the network. The CenterNet object detection algorithm consists of three independent head structures: the center point prediction, the center point offset, and the target box’s size, as shown in Figure 1.Figure 1
Algorithm structure.Assuming thatI∈RW×H×3 is the input image, where W and H represent the width and height of the image, respectively. After it is sent to the backbone network, a heat map containing the key will be generated.(1)Y∈0,1W/R×H/R×C,where R is the subsampled factor and C is the number of classes in the detection target.If classc is detected at the position x,iyi of the heat map, Y^x,y,c=1; on the contrary, if there is no target object at the point, Y^x,y,c=0.In the training phase, for an object, assuming that the coordinates of its real frame in the input image arex1,y1,x2,andy2, the center point of the object can be expressed as p=x1+x2/2,y1+y2/2. After subsampled, the coordinates of the point are mapped to the heat map as p˜=⌊p/R⌋ and mapped it to the heat map Y∈0,1W/R×H/R×C through the Gaussian kernel transformation of the following formula:(2)yxyc=exp−x−p˜x2+y−p˜y22σp2.where σp is the standard deviation of the object size adaptation if the Gaussian kernels of two objects of the same category overlap, taking the one with the most value.In the prediction stage, the most considerable eight-neighborhood value is first screened on the heat map, which is equivalent to performing an entire pooling operation with a kernel size of 3 on the heat map, and a total of 100 such values are selected. Assuming thatPc is the detected point, the coordinate of the i-th key point is x,iyi and using this point to regress, the calibration frame is(3)xi+δxi−wi2,yi+δyi−hi2,xi+δxi+wi2,yi+δyi+hi2s.where x^i,y^i=O^x^i,y^i is the offset of the point in the heat map relative to the original image during the subsampled process and w^i,h^i=S^x^i,y^i is the length and width of the target corresponding to the current point measured.Y^x,y,c=0 is used to represent the confidence of the point, that is, the probability of the existence of an object at the current center point. In this paper, the screening threshold is set to 0.3. For the 100 values selected above, it will be reserved as the final result if the predicted probability is greater than the threshold.The Loss function of the CenterNet algorithm consists of three parts: the category loss functionLcls, the regression loss function Lsize, and the bias loss function Loff, which are linear combinations of the three.(4)Ldet=Lcls+λregLreg+λoffLoff.The category loss function is the Focal Loss function.(5)Lcls=−1N1−Y^xyclogY^xycYxyc=1,1−YxycβY^xycαlog1−Y^xycother.The target center bias loss function is(6)Loff=1N∑pO^p˜−pR−p˜.The regression loss function is(7)Lreg=1N∑k=1NSpk−sk.The relevant hyperparameters are chosen asλreg=0.1, λoff=0.1, α=2, and β=4.


## 2.2. Hourglass Network Improvements

In this paper, the Hourglass-104 network [22] is selected as the backbone network of the CenterNet algorithm to extract features and generate heat maps. The network consists of two Hourglass modules stacked, as shown in Figure 2.Figure 2
The structure of Hourglass-104 network.For the first-order module shown in Figure3, the network adopts a fully convolutional neural network structure in the form of encoding-decoding. The repeated use of bottom-up and top-down supervision mechanisms combined with intermediate results has achieved good results in keypoint detection.Figure 3
The first-order module.The most basic network unit in the Hourglass-104 network is the residual module, as shown in Figure4. Almost all the network computation is consumed in the convolution operation of the residual module. For the detection task in this paper, since the datasets are directly derived from video surveillance, the image resolution is vast, the training time is also very long, and the consumption of computer hardware facilities is also relatively high.Figure 4
The residual module in the Hourglass-104 network.To solve this problem, depthwise separable convolution (DSC) module is introduced. The DSC module is a lightweight network. In the processing process, the depthwise convolution of spatial relationship mapping is performed first, and then the point-by-point convolution of channel relationship mapping is performed. In the process of network training and detection, the calculation of parameters can be significantly reduced, which dramatically improves the network’s work efficiency. The structure diagram of the residual module after introducing DSC is shown in Figure5.Figure 5
The residual module after introducing DSC.Assume that the input is (B, C, W, H) data, where B, C, W, and H are the size of the feature image batch size, the number of channels, width, and height, respectively. The convolution operation of3×3is performed, and the calculation of standard convolution is as follows:(8)stc=B×C×W×H×3×3.Depthwise separable convolution for calculation is used first, and then the depthwise convolution operation is performed, the calculation of the amount is as follows:(9)dw=C×H×W×3×3.Then, the pointwise convolution operation is performed, and the calculation of the amount is as follows:(10)pw=B×C×W×H.The total computational cost of depthwise separable convolution is the sum of the two.(11)dsc=dw+pw=B+3×3×C×W×H.The computational cost ratio of the standard convolution operation and the depthwise separable convolution operation is as follows:(12)dscstc=B+3×3×C×W×HB×C×W×H×3×3=1B+13×3.When a lot of data are processed, the difference between the two calculation methods is more prominent.


## 2.3. Group Normalization Method

The calculation result of the BN layer depends on the data of the current batch. When the batch size is small, the mean and variance of the batch data are less representative, so the final result is also greatly affected. As shown in Figure4, as the batch size becomes smaller and smaller, the reliability of the statistical information calculated by the BN layer becomes worse and worse, which will quickly lead to an increase in the final error rate. However, when the batch size is more significant, there is no noticeable difference. In target detection, segmentation, and video-related algorithms, the batch size is generally set relatively small due to large input images, diverse dimensions, and computer performance reasons. To weaken the influence of small-batch training on the detection results and make the CenterNet algorithm more flexibly applied to different hardware configuration environments, this paper improves the BN (batching normalization) in the backbone network to GN (grouping normalization).Unlike BN, which normalizes channel by channel, GN groups channels and normalizes them in groups. First, the C channels are divided intoG groups, and S=kc|c/G=k,c=0,1,…,C is the channel number set composed of the channel numbers that fall into the k-th channel group, where k∈0,1,…,G−1, let the i-th feature of the j-th sample of the current mini-batch sample set in the c-th channel be xij,c, the result after normalization is yij,c, and the corresponding calculation formula is as follows:(13)xij,c=1σikxij,c−μikand(14)yij,c=ax^ij,c+b,where sum is the mean and standard deviation of the i-th feature of each feature map of the k-th channel, respectively,(15)μik=1m⋅Sk∑j=1m∑c∈Skxij,cand(16)σik=1m⋅Sk∑j=1m∑c∈Skxij,c−μik2+ε.The group-based normalization groups the feature map channels, making each channel’s mean and standard deviation more stable, effectively weakening the influence of the number of samples in the small-batch sample set on the feature normalization, and at the same time, the learning efficiency of the model based on the gradient descent method under low memory capacity is improved.


## 2.4. Weighted Feature Map Fusion

In the CenterNet network structure, the input image is input into the Hourglass-104 network after being subsampled 4 times. After 8 times, 16 times, 32 times, 64 times, and 128 times of subsampled in turn, and then 2 times of upsampling in turn, only one feature map is output. The output feature map size is subsampled 4 times from the input image. It can be seen that only using the most extensive feature map for target detection will inevitably lose some features of the image.To make full use of the feature map generated after the convolution operation, improve the detection ability of small-sized targets, and reduce the algorithm’s complexity. In this paper, the input image is subsampled 2 times, and then sent to Hourglass, and then subsampled2 times, 4 times, 8 times, and 16 times in a turn, and output four feature maps, namely,P1, P2, P3, and P4, each feature’s layer resolution is 1/2i+1 times the input image, and multiple output feature maps are fused. Since each feature map contributes differently to the final fusion output, feature fusion cannot be performed directly. This paper uses a weighted method to fuse the features of each feature map; that is, when the feature map is fused, a learnable weight is assigned to each input feature map. During training, the network can learn to change the fusion weight of each feature map to change the importance of each feature map to the final detection result. To reduce the number of parameters and computation, the improved model directly uses short-circuit connections in the bypass convolution and instantly removes the convolution operation. The schematic diagram of feature fusion is shown in Figure 6. The feature maps from high-level to low-level are obtained after upsampling, and then added, and the final output has only one fused feature map pout.Figure 6
Feature fusion.The calculation formula of feature fusion is(17)O=∑iωiε+∑jωj⋅Ii,where Ii is the input feature map, the fused feature map, and ωi, ωi∈0,1 is the corresponding weight. A minimum value ε=1e−4 is set to avoid the situation where the denominator in the above formula is 0.The fast normalized fusion method is also used for weight fusion of the feature maps output by the two Hourglasses, and the calculation formula is(18)Pout=∑ωij⋅Pij∑ωij+ε.The schematic diagram of weight fusion is shown in Figure7.Figure 7
Weight fusion.The final improved CenterNet (Improve-CN) algorithm network structure is shown in Figure8.Figure 8
Improved CenterNet (Improve-CN) algorithm network structure.


## 3. Experiments and Analysis

### 3.1. Data Preprocessing and Labeling

The dataset images in this paper include two types of gangue and iron. The gangue is mainly coal road gangue and washing gangue, and the iron includes bolts, drills, steel bars, and channel steel. The data is obtained through industrial infrared surveillance cameras. The foreign bodies obtained with this mounting type have the largest geometry. Detecting the foreign object early in entering the belt, effectively reducing the missed detection rate. There is no additional light source in the experiment, only the underground lighting source, and the possible miner’s head-mounted lamp.Due to low brightness in the coal mine and the uneven illumination caused by the irritating light source, the image quality obtained is poor. It is necessary to preprocess the directly acquired coal mine images to solve this problem. There is a lot of underground impulse noise in coal mines, so median filtering is performed first to eliminate the influence of noise and slight jitter. Although the effect of noise is eliminated, the contrast of the denoised image is still not high, and it is not easy to distinguish the foreground and background accurately. Therefore, the image continues to be enhanced. The method used is adaptive histogram equalization (AHE). AHE achieves the purpose of adjusting the image contrast by calculating the local histogram of the image and redistributing the brightness. The AHE algorithm improves the local contrast of the original image, makes the dark image brighter, suppresses the overbright area, and obtains more detailed information, which enhances the quality of the image.Figure9 compares the original image and the image after median filtering and adaptive histogram equalization.Figure 9
Comparison of the three images.The dataset in this paper is mainly composed of two classes, namely, “gangue” and “iron” (including channel steel, anchor rod, drill bit, and I-beam), which are marked with label software. After an image is observed, a file with the suffix “json” will be generated in the directory, which contains the name and ID of the marked image, the category label of the significant object, and the coordinates of the object frame. The coordinates are marked as the coordinates of the upper left corner and the lower right corner of the box. A total of 5,605 images of two types were collected in the dataset of this paper. Since the foreign objects in the coal conveyor belt are mainly gangue, the majority of gangue images are 3,421, and there are a total of 2,184 iron images. The pictures are divided in the dataset, 70% of which are used as the train set, 20% are used as a validation set, and the remaining 10% are used as the test set. The distribution of the datasets is shown in Table1.Table 1
Foreign object dataset in the coal belt.
DatasetsGangue/pieceIron/pieceTrain set23881545Validation set676423Test set355223


### 3.2. Network Training

Since the collected dataset pictures are few and cannot meet the training requirements of deep learning, the dataset needs to be augmented. In this paper, the dataset is augmented by random cropping, flipping, rotation, translation, and scaling. There are five types of scaling factors in augmentation (0.5,0.8,1,1.2, and1.5). During training, Batch size is set to 8, an epoch is 140, and the initial learning rate is5×10−5. At 90 rounds and 120 rounds, respectively, it is attenuated 10 times, and SGD is used for network optimization. The weight decay rate and momentum factor are designed to be 10−4 and 0.9, respectively, and the input image is uniformly scaled to 512×512 sizes. The experiments are all completed on Ubuntu18.04, Nvidia GTX1060 graphics card, E5-2650 v2 CPU, CUDA10.1, cudnn7.6.5, Pytorch1.2.0, and the hyperparameters selection of each algorithm is completely consistent.


### 3.3. Experimental Results and Analysis

After about 100 rounds of training, the network converges. The loss function comparison between the improved algorithm and the original standard CenterNet algorithm is shown in Figures10–13. The four figures are in order of total loss function curve, center point prediction loss function curve, target box regression loss function curve, and center point bias loss function curve. The abscissa is the number of training rounds, and the ordinate is loss change value. The blue line in the comparison image is the loss curve of the standard CenterNet algorithm and the orange line is the loss curve of the improved algorithm. It can be seen that the loss of the enhanced algorithm is reduced by about 0.3 compared with the original algorithm, and the original algorithm converges in about 120 rounds, that is, the improved algorithm speeds up the convergence speed. It can be seen from the loss function comparison curve that the improved algorithm has a smaller loss value than the original algorithm.Figure 10
Total loss function curve.Figure 11
Center point prediction loss function curve.Figure 12
Target box regression loss function curve.Figure 13
Center point bias loss function curve.The quantitative comparison results of the two algorithms on the test set at 140 rounds are shown in Table2. The main test indicators are average precision (AP) and average recall (AR), AP reflects the algorithm’s accuracy and AR reflects the false detection level of the algorithm. The larger these two indicators are, the better the algorithm’s performance is. AP50 and AP75 in Table 2 are the average accuracy rates when they are IOU≥0.5 and IOU≥0.75, respectively. APS, APM, and APL are the average accuracy indicators for small targets, medium targets, and large targets, respectively, and the AR indicators are marked in the same way.Table 2
Comparison between CenterNet and Improve-CN.
Evaluation indicatorsCenterNetImprove-CNAverage precision (AP)AP500.48220.5522AP750.26690.3080APs0.10560.1834APM0.27780.3422APL0.45310.4734Average recall (AR)AR500.38880.5025AR750.25220.3138ARs0.18350.3221ARM0.43410.5551ARL0.50120.5982It can be seen from Table2 that the improved algorithm has a significant improvement in accuracy compared to the original algorithm, and the improved algorithm has improved target accuracy and recalls for various scales, which is related to feature weighted fusion. By fusing the features at multiple scales, on the one hand, the rich semantic information of the high level can be fully utilized. On the other hand, the spatial location information of the low level can be obtained, which significantly improves the accuracy of the target detection.Four test images are randomly selected from the test set and tested with the algorithm designed in this paper. The detection results are shown in Figure14. It can be seen that the proposed algorithm can accurately detect targets of various scales, and the improved algorithm can also accurately detect slender “iron objects,” especially those close to the edge of the conveyor belt and along with the movement direction distribution target.Figure 14
The foreign objects detection result with the proposed algorithm.Table3 compares the detection results of different target detection algorithms in the test set after training under the same dataset. It can be seen that nearly 130 ms reduces the average detection time of the improved algorithm compared with the original algorithm, and the overall accuracy rate is improved by 6.9% or so. Compared with the two-stage faster R-CNN algorithm [23–26], the algorithm before and after the improvement significantly shortens the detection time, but the accuracy rate decreases because the improved algorithm only needs to predict the target’s center point compared to the anchor frame. The computational complexity is significantly reduced, so the speed is improved. Still, many anchor boxes provide a greater possibility of correctly detecting the target, so the accuracy rate is higher, and the application can be used to monitor the same transmission belt through multiple cameras to offset this shortcoming. Compared with the one-stage detection algorithm YOLOv3, the detection speed and accuracy of the improved algorithm have been improved. The results show that the enhanced algorithm achieves a good balance between detection speed and accuracy.Table 3
The comparison among other objects detection algorithm.
AlgorithmAverage detection Time/sMAPFaster R-CNN4.16710.5877YOLOv30.09430.4344CenterNet0.06260.4828Improve-CN0.05080.5521


## 3.1. Data Preprocessing and Labeling

The dataset images in this paper include two types of gangue and iron. The gangue is mainly coal road gangue and washing gangue, and the iron includes bolts, drills, steel bars, and channel steel. The data is obtained through industrial infrared surveillance cameras. The foreign bodies obtained with this mounting type have the largest geometry. Detecting the foreign object early in entering the belt, effectively reducing the missed detection rate. There is no additional light source in the experiment, only the underground lighting source, and the possible miner’s head-mounted lamp.Due to low brightness in the coal mine and the uneven illumination caused by the irritating light source, the image quality obtained is poor. It is necessary to preprocess the directly acquired coal mine images to solve this problem. There is a lot of underground impulse noise in coal mines, so median filtering is performed first to eliminate the influence of noise and slight jitter. Although the effect of noise is eliminated, the contrast of the denoised image is still not high, and it is not easy to distinguish the foreground and background accurately. Therefore, the image continues to be enhanced. The method used is adaptive histogram equalization (AHE). AHE achieves the purpose of adjusting the image contrast by calculating the local histogram of the image and redistributing the brightness. The AHE algorithm improves the local contrast of the original image, makes the dark image brighter, suppresses the overbright area, and obtains more detailed information, which enhances the quality of the image.Figure9 compares the original image and the image after median filtering and adaptive histogram equalization.Figure 9
Comparison of the three images.The dataset in this paper is mainly composed of two classes, namely, “gangue” and “iron” (including channel steel, anchor rod, drill bit, and I-beam), which are marked with label software. After an image is observed, a file with the suffix “json” will be generated in the directory, which contains the name and ID of the marked image, the category label of the significant object, and the coordinates of the object frame. The coordinates are marked as the coordinates of the upper left corner and the lower right corner of the box. A total of 5,605 images of two types were collected in the dataset of this paper. Since the foreign objects in the coal conveyor belt are mainly gangue, the majority of gangue images are 3,421, and there are a total of 2,184 iron images. The pictures are divided in the dataset, 70% of which are used as the train set, 20% are used as a validation set, and the remaining 10% are used as the test set. The distribution of the datasets is shown in Table1.Table 1
Foreign object dataset in the coal belt.
DatasetsGangue/pieceIron/pieceTrain set23881545Validation set676423Test set355223


## 3.2. Network Training

Since the collected dataset pictures are few and cannot meet the training requirements of deep learning, the dataset needs to be augmented. In this paper, the dataset is augmented by random cropping, flipping, rotation, translation, and scaling. There are five types of scaling factors in augmentation (0.5,0.8,1,1.2, and1.5). During training, Batch size is set to 8, an epoch is 140, and the initial learning rate is5×10−5. At 90 rounds and 120 rounds, respectively, it is attenuated 10 times, and SGD is used for network optimization. The weight decay rate and momentum factor are designed to be 10−4 and 0.9, respectively, and the input image is uniformly scaled to 512×512 sizes. The experiments are all completed on Ubuntu18.04, Nvidia GTX1060 graphics card, E5-2650 v2 CPU, CUDA10.1, cudnn7.6.5, Pytorch1.2.0, and the hyperparameters selection of each algorithm is completely consistent.


## 3.3. Experimental Results and Analysis

After about 100 rounds of training, the network converges. The loss function comparison between the improved algorithm and the original standard CenterNet algorithm is shown in Figures10–13. The four figures are in order of total loss function curve, center point prediction loss function curve, target box regression loss function curve, and center point bias loss function curve. The abscissa is the number of training rounds, and the ordinate is loss change value. The blue line in the comparison image is the loss curve of the standard CenterNet algorithm and the orange line is the loss curve of the improved algorithm. It can be seen that the loss of the enhanced algorithm is reduced by about 0.3 compared with the original algorithm, and the original algorithm converges in about 120 rounds, that is, the improved algorithm speeds up the convergence speed. It can be seen from the loss function comparison curve that the improved algorithm has a smaller loss value than the original algorithm.Figure 10
Total loss function curve.Figure 11
Center point prediction loss function curve.Figure 12
Target box regression loss function curve.Figure 13
Center point bias loss function curve.The quantitative comparison results of the two algorithms on the test set at 140 rounds are shown in Table2. The main test indicators are average precision (AP) and average recall (AR), AP reflects the algorithm’s accuracy and AR reflects the false detection level of the algorithm. The larger these two indicators are, the better the algorithm’s performance is. AP50 and AP75 in Table 2 are the average accuracy rates when they are IOU≥0.5 and IOU≥0.75, respectively. APS, APM, and APL are the average accuracy indicators for small targets, medium targets, and large targets, respectively, and the AR indicators are marked in the same way.Table 2
Comparison between CenterNet and Improve-CN.
Evaluation indicatorsCenterNetImprove-CNAverage precision (AP)AP500.48220.5522AP750.26690.3080APs0.10560.1834APM0.27780.3422APL0.45310.4734Average recall (AR)AR500.38880.5025AR750.25220.3138ARs0.18350.3221ARM0.43410.5551ARL0.50120.5982It can be seen from Table2 that the improved algorithm has a significant improvement in accuracy compared to the original algorithm, and the improved algorithm has improved target accuracy and recalls for various scales, which is related to feature weighted fusion. By fusing the features at multiple scales, on the one hand, the rich semantic information of the high level can be fully utilized. On the other hand, the spatial location information of the low level can be obtained, which significantly improves the accuracy of the target detection.Four test images are randomly selected from the test set and tested with the algorithm designed in this paper. The detection results are shown in Figure14. It can be seen that the proposed algorithm can accurately detect targets of various scales, and the improved algorithm can also accurately detect slender “iron objects,” especially those close to the edge of the conveyor belt and along with the movement direction distribution target.Figure 14
The foreign objects detection result with the proposed algorithm.Table3 compares the detection results of different target detection algorithms in the test set after training under the same dataset. It can be seen that nearly 130 ms reduces the average detection time of the improved algorithm compared with the original algorithm, and the overall accuracy rate is improved by 6.9% or so. Compared with the two-stage faster R-CNN algorithm [23–26], the algorithm before and after the improvement significantly shortens the detection time, but the accuracy rate decreases because the improved algorithm only needs to predict the target’s center point compared to the anchor frame. The computational complexity is significantly reduced, so the speed is improved. Still, many anchor boxes provide a greater possibility of correctly detecting the target, so the accuracy rate is higher, and the application can be used to monitor the same transmission belt through multiple cameras to offset this shortcoming. Compared with the one-stage detection algorithm YOLOv3, the detection speed and accuracy of the improved algorithm have been improved. The results show that the enhanced algorithm achieves a good balance between detection speed and accuracy.Table 3
The comparison among other objects detection algorithm.
AlgorithmAverage detection Time/sMAPFaster R-CNN4.16710.5877YOLOv30.09430.4344CenterNet0.06260.4828Improve-CN0.05080.5521


## 4. Conclusion

As fixed-point monitoring by network cameras is gradually replacing manual inspection and becoming an essential underground monitoring method for coal mining enterprises, the proposed foreign object detection method can be directly deployed on this basis. As long as the host computer that meets the hardware requirements is configured, the noncoal foreign matter can be detected at the early stage when it enters the coal conveying belt, and an alarm response can be made. In the later stage, the robot can automatically sort the detected foreign objects to realize the integration of foreign object detection and grasping, which can improve work efficiency while protecting personal safety and further reducing potential safety hazards.



---

*Source: 9740622-2022-07-05.xml*