z-logo
open-access-imgOpen Access
MSPPNet: A Lightweight Network for Real-time Semantic Image Segmentation
Author(s) -
Yuting Liang,
Tangtian Hang,
Jie Chen,
Lei Liu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2010/1/012128
Subject(s) - pyramid (geometry) , segmentation , computer science , pooling , inference , artificial intelligence , feature (linguistics) , context (archaeology) , pattern recognition (psychology) , aggregate (composite) , scale space segmentation , image segmentation , computer vision , object (grammar) , mathematics , paleontology , linguistics , philosophy , materials science , geometry , composite material , biology
Real-time semantic segmentation is widely applied in many fields. However, current state-of-the-art methods ignore the inference speed, while some other models that have short run-times produce coarse segmentation results. To balance the inference speed and segmentation accuracy, we propose a Multi-scale Spatial Pyramid Pooling Network (MSPPNet), a lightweight and efficient network for real-time semantic segmentation. Here, we adopt modified Xception to obtain high-level and low-level feature maps, which fundamentally reduces computational complexity and the number of parameters. Besides, we design the Multi-scale Spatial Pyramid Pooling module (MSPP) to aggregate context information from high-level feature maps, which effectively improves segmentation accuracy. Furthermore, the spatial attention mechanism is employed to enrich the details of segmentation and recover object boundaries. Experiments on the Cityscapes dataset show that MSPPNet has less than 1M parameters, and achieves 64.55% mean IoU with a speed of 121 fps. It is demonstrated that MSPPNet achieves a balance between speed and accuracy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here