DSCP-UNet: A tunnel crack segmentation algorithm based on lightweight diminutive size and colossal perception
Author(s) -
Weihua Shi
Publication year - 2025
Publication title -
ieee access
Language(s) - English
Resource type - Magazines
SCImago Journal Rank - 0.587
H-Index - 127
eISSN - 2169-3536
DOI - 10.1109/access.2025.3617337
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
To effectively enhance the ability to detect surface crack defects in tunnels under tunnel conditions, this paper proposes a new tunnel crack segmentation algorithm using light-weight diminutive size and colossal perception UNet (DSCP-UNet). This method integrates a diminutive group convolution (DGConv) module and a self-adaptive pooling (SAPool) module into the UNet architecture, resulting in a segmentation network that balances lightweight design with strong perceptual capability. In the constructed DSCP-UNet model, the conventional convolutional backbone is replaced by DGConv, significantly reducing the number of model parameters. Aconvolutional block attention module (CBAM) is introduced to enhance the model’s focus on crack features, forming an efficient crack recognition network. The pyramid attention with sampling group (PASG) module is also investigated to improve the model’s ability to discriminate multi-scale crack features. Using collected tunnel crack images, the proposed DSCP-UNet achieves a model size of only 3.85 MB and demonstrates superior performance in tunnel crack segmentation tasks. Based on the collected images of surface cracks in the tunnel, we verified the rationality of the proposed algorithm. Meanwhile, by comparing with other models, it was found that the algorithm proposed in this paper has high robustness.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom