Lung parenchyma segmentation based on double scale parallel attention network.
10.7507/1001-5515.202108005
- Author:
Kaili FENG
1
;
Lili REN
2
;
Yanlin WU
1
;
Yan LI
1
;
Hongrui WANG
1
;
Guanglei WANG
1
Author Information
1. School of Electronic Information Engineering, Hebei University, Baoding, Hebei 071002, P. R. China.
2. Affiliated Hospital of Hebei University, Baoding, Hebei 071002, P. R. China.
- Publication Type:Journal Article
- Keywords:
Collaborative attention;
Deep learning;
Lung parenchymal segmentation;
Multi-scale information
- MeSH:
Algorithms;
Image Processing, Computer-Assisted/methods*;
Lung/diagnostic imaging*;
Neural Networks, Computer;
Tomography, X-Ray Computed/methods*
- From:
Journal of Biomedical Engineering
2022;39(4):721-729
- CountryChina
- Language:Chinese
-
Abstract:
[ Abstract]Automatic and accurate segmentation of lung parenchyma is essential for assisted diagnosis of lung cancer. In recent years, researchers in the field of deep learning have proposed a number of improved lung parenchyma segmentation methods based on U-Net. However, the existing segmentation methods ignore the complementary fusion of semantic information in the feature map between different layers and fail to distinguish the importance of different spaces and channels in the feature map. To solve this problem, this paper proposes the double scale parallel attention (DSPA) network (DSPA-Net) architecture, and introduces the DSPA module and the atrous spatial pyramid pooling (ASPP) module in the "encoder-decoder" structure. Among them, the DSPA module aggregates the semantic information of feature maps of different levels while obtaining accurate space and channel information of feature map with the help of cooperative attention (CA). The ASPP module uses multiple parallel convolution kernels with different void rates to obtain feature maps containing multi-scale information under different receptive fields. The two modules address multi-scale information processing in feature maps of different levels and in feature maps of the same level, respectively. We conducted experimental verification on the Kaggle competition dataset. The experimental results prove that the network architecture has obvious advantages compared with the current mainstream segmentation network. The values of dice similarity coefficient (DSC) and intersection on union (IoU) reached 0.972 ± 0.002 and 0.945 ± 0.004, respectively. This paper achieves automatic and accurate segmentation of lung parenchyma and provides a reference for the application of attentional mechanisms and multi-scale information in the field of lung parenchyma segmentation.
