When applying deep learning algorithms to magnetic resonance (MR) image segmentation, a large number of annotated images are required as data support. However, the specificity of MR images makes it difficult and costly to acquire large amounts of annotated image data. To reduce the dependence of MR image segmentation on a large amount of annotated data, this paper proposes a meta-learning U-shaped network (Meta-UNet) for few-shot MR image segmentation. Meta-UNet can use a small amount of annotated image data to complete the task of MR image segmentation and obtain good segmentation results. Meta-UNet improves U-Net by introducing dilated convolution, which can increase the receptive field of the model to improve the sensitivity to targets of different scales. We introduce the attention mechanism to improve the adaptability of the model to different scales. We introduce the meta-learning mechanism, and employ a composite loss function for well-supervised and effective bootstrapping of model training. We use the proposed Meta-UNet model to train on different segmentation tasks, and then use the trained model to evaluate on a new segmentation task, where the Meta-UNet model achieves high-precision segmentation of target images. Meta-UNet has a certain improvement in mean Dice similarity coefficient (DSC) compared with voxel morph network (VoxelMorph), data augmentation using learned transformations (DataAug) and label transfer network (LT-Net). Experiments show that the proposed method can effectively perform MR image segmentation using a small number of samples. It provides a reliable aid for clinical diagnosis and treatment.
Lung segmentation is the premise of the computer aided diagnosis of lung cancer. The traditional segmentation method based on local low-level features can not get the correct result when a tumor is connected with pleura due to their similar computed tomography (CT) values. Moreover, because the big size of tumor leads to the loss of a large part of lung area, the traditional segmentation methods of lung with juxta-pleural nodule whose diameter is less than 3 cm are not suitable. Acitve shape model (ASM) combined with prior shape and low level features might be appropriate. But the search steps in conventional ASM is an optimization method based on the least square, which is sensitive to outlier marker points, and it makes profile update to the transition area of normal lung tissue and tumor rather than a true lung contour. To solve the problem, we proposed an improved ASM algorithm. Firstly, we identified these outlier marker points by distance, and then gave the different searching functions to the abnormal and normal marker points. And the search processing should be limited in volume of interesting (VOI). We selected 30 lung images with juxta-pleural tumors, and got the overlap rate with the gold standard as 93.6%. The experimental results showed that the improved ASM could get good segmentation results for the lungs with juxta-pleural tumors, and the running time of the algorithm could be tolerated in clinical.
Although deep learning plays an important role in cell nucleus segmentation, it still faces problems such as difficulty in extracting subtle features and blurring of nucleus edges in pathological diagnosis. Aiming at the above problems, a nuclear segmentation network combined with attention mechanism is proposed. The network uses UNet network as the basic structure and the depth separable residual (DSRC) module as the feature encoding to avoid losing the boundary information of the cell nucleus. The feature decoding uses the coordinate attention (CA) to enhance the long-range distance in the feature space and highlights the key information of the nuclear position. Finally, the semantics information fusion (SIF) module integrates the feature of deep and shallow layers to improve the segmentation effect. The experiments were performed on the 2018 data science bowl (DSB2018) dataset and the triple negative breast cancer (TNBC) dataset. For the two datasets, the accuracy of the proposed method was 92.01% and 89.80%, the sensitivity was 90.09% and 91.10%, and the mean intersection over union was 89.01% and 89.12%, respectively. The experimental results show that the proposed method can effectively segment the subtle regions of the nucleus, improve the segmentation accuracy, and provide a reliable basis for clinical diagnosis.
The use of echocardiography ventricle segmentation can obtain ventricular volume parameters, and it is helpful to evaluate cardiac function. However, the ultrasound images have the characteristics of high noise and difficulty in segmentation, bringing huge workload to segment the object region manually. Meanwhile, the automatic segmentation technology cannot guarantee the segmentation accuracy. In order to solve this problem, a novel algorithm framework is proposed to segment the ventricle. Firstly, faster region-based convolutional neural network is used to locate the object to get the region of interest. Secondly, K-means is used to pre-segment the image; then a mean shift with adaptive bandwidth of kernel function is proposed to segment the region of interest. Finally, the region growing algorithm is used to get the object region. By this framework, ventricle is obtained automatically without manual localization. Experiments prove that this framework can segment the object accurately, and the algorithm of adaptive mean shift is more stable and accurate than the mean shift with fixed bandwidth on quantitative evaluation. These results show that the method in this paper is helpful for automatic segmentation of left ventricle in echocardiography.
In recent years, the task of object detection and segmentation in medical image is the research hotspot and difficulty in the field of image processing. Instance segmentation provides instance-level labels for different objects belonging to the same class, so it is widely used in the field of medical image processing. In this paper, medical image instance segmentation was summarized from the following aspects: First, the basic principle of instance segmentation was described, the instance segmentation models were classified into three categories, the development context of the instance segmentation algorithm was displayed in two-dimensional space, and six classic model diagrams of instance segmentation were given. Second, from the perspective of the three models of two-stage instance segmentation, single-stage instance segmentation and three-dimensional (3D) instance segmentation, we summarized the ideas of the three types of models, discussed the advantages and disadvantages, and sorted out the latest developments. Third, the application status of instance segmentation in six medical images such as colon tissue image, cervical image, bone imaging image, pathological section image of gastric cancer, computed tomography (CT) image of lung nodule and X-ray image of breast was summarized. Fourth, the main challenges in the field of medical image instance segmentation were discussed and the future development direction was prospected. In this paper, the principle, models and characteristics of instance segmentation are systematically summarized, as well as the application of instance segmentation in the field of medical image processing, which is of positive guiding significance to the study of instance segmentation.
The segmentation of dental models is a crucial step in computer-aided diagnosis and treatment systems for oral healthcare. To address the issues of poor universality and under-segmentation in tooth segmentation techniques, an intelligent tooth segmentation method combining multiple seed region growth and boundary extension is proposed. This method utilized the distribution characteristics of negative curvature meshes in teeth to obtain new seed points and effectively adapted to the structural differences between the top and sides of teeth through differential region growth. Additionally, the boundaries of the initial segmentation were extended based on geometric features, which was effectively compensated for under-segmentation issues in region growth. Ablation experiments and comparative experiments with current state-of-the-art algorithms demonstrated that the proposed method achieved better segmentation of crowded dental models and exhibited strong algorithm universality, thus possessing the capability to meet the practical segmentation needs in oral healthcare.
[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.
The existing retinal vessels segmentation algorithms have various problems that the end of main vessels are easy to break, and the central macula and the optic disc boundary are likely to be mistakenly segmented. To solve the above problems, a novel retinal vessels segmentation algorithm is proposed in this paper. The algorithm merged together vessels contour information and conditional generative adversarial nets. Firstly, non-uniform light removal and principal component analysis were used to process the fundus images. Therefore, it enhanced the contrast between the blood vessels and the background, and obtained the single-scale gray images with rich feature information. Secondly, the dense blocks integrated with the deep separable convolution with offset and squeeze-and-exception (SE) block were applied to the encoder and decoder to alleviate the gradient disappearance or explosion. Simultaneously, the network focused on the feature information of the learning target. Thirdly, the contour loss function was added to improve the identification ability of the blood vessels information and contour information of the network. Finally, experiments were carried out on the DRIVE and STARE datasets respectively. The value of area under the receiver operating characteristic reached 0.982 5 and 0.987 4, respectively, and the accuracy reached 0.967 7 and 0.975 6, respectively. Experimental results show that the algorithm can accurately distinguish contours and blood vessels, and reduce blood vessel rupture. The algorithm has certain application value in the diagnosis of clinical ophthalmic diseases.
Magnetic resonance imaging (MRI) plays a crucial role in the diagnosis of ischemic stroke. Accurate segmentation of the infarct is of great significance for selecting intervention treatment methods and evaluating the prognosis of patients. To address the issue of poor segmentation accuracy of existing methods for multiscale stroke lesions, a novel encoder-decoder architecture network based on depthwise separable convolution is proposed. Firstly, this network replaces the convolutional layer modules of the U-Net with redesigned depthwise separable convolution modules. Secondly, an modified Atrous spatial pyramid pooling (MASPP) is introduced to enlarge the receptive field and enhance the extraction of multiscale features. Thirdly, an attention gate (AG) structure is incorporated at the skip connections of the network to further enhance the segmentation accuracy of multiscale targets. Finally, Experimental evaluations are conducted using the ischemic stroke lesion segmentation 2022 challenge (ISLES2022) dataset. The proposed algorithm in this paper achieves Dice similarity coefficient (DSC), Hausdorff distance (HD), sensitivity (SEN), and precision (PRE) scores of 0.816 5, 3.668 1, 0.889 2, and 0.894 6, respectively, outperforming other mainstream segmentation algorithms. The experimental results demonstrate that the method in this paper effectively improves the segmentation of infarct lesions, and is expected to provide a reliable support for clinical diagnosis and treatment.
Oral teeth image segmentation plays an important role in teeth orthodontic surgery and implant surgery. As the tooth roots are often surrounded by the alveolar, the molar’s structure is complex and the inner pulp chamber usually exists in tooth, it is easy to over-segment or lead to inner edges in teeth segmentation process. In order to further improve the segmentation accuracy, a segmentation algorithm based on local Gaussian distribution fitting and edge detection is proposed to solve the above problems. This algorithm combines the local pixels’ variance and mean values, which improves the algorithm’s robustness by incorporating the gradient information. In the experiment, the root is segmented precisely in cone beam computed tomography (CBCT) teeth images. Segmentation results by the proposed algorithm are then compared with the classical algorithms’ results. The comparison results show that the proposed method can distinguish the root and alveolar around the root. In addition, the split molars can be segmented accurately and there are no inner contours around the pulp chamber.