Fast Semantic Segmentation Model PULNet and Lawn Boundary Detection Method

Abstract

To quickly and accurately identify the lawn area and boundary positions of different scenes, environments, and seasons, we propose a new semantic segmentation model PULNet and lawn boundary detection methods. Firstly, the ResNet50 network is improved to expand its effective receptive field, a Pooling pyramid (P) and an Upsampling dimensionality reduction structure (U) is constructed based on the Dilated_ResNet50 network. Secondly, a fast and accurate PULNet semantic segmentation network is proposed integrating the image Local detail information structure (L). Finally, an Eight-neighbor coding method is designed to accurately locate the border of the lawn. Experiments on the ADE20K dataset obtained the mean Intersection over Union (mIoU) and mean Pixel Accuracy (mPA) 32.86% and 75.65% respectively. The average speed is 82.7 frames per second on a platform with GTX 1080Ti GPU. Compared with the Fully Convolutional Network (FCN) the mIoU and mPA are increased by 3.47% and 4.33% respectively, and the speed is 11 times higher. The proposed method can be used for fast and accurate lawn semantic segmentation and boundary detection.

BiSeNet-oriented context attention model for image semantic segmentation

“…Compared with the , it is improved by 2.41%, 2.18%, 1.50% and 1.04% compared with DUpsamling algorithm, reference [40], reference [41], and reference [42] respectively.…”

“…DeepLabV3+ [38], SANet [39], DUpsamling and reference [40][41][42]). The experimental results are shown in Table 2.…”

“…As can be seen from the figure, compared with reference[40] algorithm and reference[41] algorithm, the proposed algorithm has clearer target segmentation boundary. Reference[42] algorithm obviously has the problem of unbalanced bicycle segmentation. Compared with the Reference[42] algorithm, the segmentation results of the proposed algorithm are significantly more balanced.…”

“…Reference[42] algorithm obviously has the problem of unbalanced bicycle segmentation. Compared with the Reference[42] algorithm, the segmentation results of the proposed algorithm are significantly more balanced.…”