Active contours driven by edge entropy fitting energy for image segmentation

SDMI-Net: Spatially Dependent Mutual Information Network for semi-supervised medical image segmentation

Semi-supervised medical image segmentation strives to polish deep models with a small amount of labeled data and a large amount of unlabeled data. The efficiency of most semi-supervised medical image segmentation methods based on voxel-level consistency learning is affected by low-confidence voxels. In addition, voxel-level consistency learning fails to consider the spatial correlation between neighboring voxels. To encourage reliable voxel-level consistent learning, we propose a dual-teacher affine consistent uncertainty estimation method to filter out some voxels with high uncertainty. Moreover, we design the spatially dependent mutual information module, which enhances the spatial dependence between neighboring voxels by maximizing the mutual information between the local voxel blocks predicted from the dual-teacher models and the student model, enabling consistent learning at the block level. On two benchmark medical image segmentation datasets, including the Left Atrial Segmentation Challenge dataset and the BraTS-2019 dataset, our method achieves state-of-the-art performance in both quantitative and qualitative aspects.

Optimizing support vector machine (SVM) by social spider optimization (SSO) for edge detection in colored images

Edge detection in images is a vital application of image processing in fields such as object detection and identification of lesion regions in medical images. This problem is more complex in the domain of color images due to the combination of color layer information and the need to achieve a unified edge boundary across these layers, which increases the complexity of the problem. In this paper, a simple and effective method for edge detection in color images is proposed using a combination of support vector machine (SVM) and the social spider optimization (SSO) algorithm. In the proposed method, the input color image is first converted to a grayscale image, and an initial estimation of the image edges is performed based on it. To this end, the proposed method utilizes an SVM with a Radial Basis Function (RBF) kernel, in which the model's hyperparameters are tuned using the SSO algorithm. After the formation of initial image edges, the resulting edges are compared with pairwise combinations of color layers, and an attempt is made to improve the edge localization using the SSO algorithm. In this step, the optimization algorithm's task is to refine the image edges in a way that maximizes the compatibility with pairwise combinations of color layers. This process leads to the formation of prominent image edges and reduces the adverse effects of noise on the final result. The performance of the proposed method in edge detection of various color images has been evaluated and compared with similar previous strategies. According to the obtained results, the proposed method can successfully identify image edges more accurately, as the edges identified by the proposed method have an average accuracy of 93.11% for the BSDS500 database, which is an increase of at least 0.74% compared to other methods.

Semi-supervised image segmentation using a residual-driven mean teacher and an exponential Dice loss

Semi-supervised segmentation plays an important role in computer vision and medical image analysis and can alleviate the burden of acquiring abundant expert-annotated images. In this paper, we developed a residual-driven semi-supervised segmentation method (termed RDMT) based on the classical mean teacher (MT) framework by introducing a novel model-level residual perturbation and an exponential Dice (eDice) loss. The introduced perturbation was integrated into the exponential moving average (EMA) scheme to enhance the performance of the MT, while the eDice loss was used to improve the detection sensitivity of a given network to object boundaries. We validated the developed method by applying it to segment 3D Left Atrium (LA) and 2D optic cup (OC) from the public LASC and REFUGE datasets based on the V-Net and U-Net, respectively. Extensive experiments demonstrated that the developed method achieved the average Dice score of 0.8776 and 0.7751, when trained on 10% and 20% labeled images, respectively for the LA and OC regions depicted on the LASC and REFUGE datasets. It significantly outperformed the MT and can compete with several existing semi-supervised segmentation methods (i.e., HCMT, UAMT, DTC and SASS).

Dual-mode adaptive-SVD ghost imaging

In this paper, we present a dual-mode adaptive singular value decomposition ghost imaging (A-SVD GI), which can be easily switched between the modes of imaging and edge detection. It can adaptively localize the foreground pixels via a threshold selection method. Then only the foreground region is illuminated by the singular value decomposition (SVD) - based patterns, consequently retrieving high-quality images with fewer sampling ratios. By changing the selecting range of foreground pixels, the A-SVD GI can be switched to the mode of edge detection to directly reveal the edge of objects, without needing the original image. We investigate the performance of these two modes through both numerical simulations and experiments. We also develop a single-round scheme to halve measurement numbers in experiments, instead of separately illuminating positive and negative patterns in traditional methods. The binarized SVD patterns, generated by the spatial dithering method, are modulated by a digital micromirror device (DMD) to speed up the data acquisition. This dual-mode A-SVD GI can be applied in various applications, such as remote sensing or target recognition, and could be further extended for multi-modality functional imaging/detection.

Image Segmentation via Multiscale Perceptual Grouping

The human eyes observe an image through perceptual units surrounded by symmetrical or asymmetrical object contours at a proper scale, which enables them to quickly extract the foreground of the image. Inspired by this characteristic, a model combined with multiscale perceptual grouping and unit-based segmentation is proposed in this paper. In the multiscale perceptual grouping part, a novel total variation regularization is proposed to smooth the image into different scales, which removes the inhomogeneity and preserves the edges. To simulate perceptual units surrounded by contours, the watershed method is utilized to cluster pixels into groups. The scale of smoothness is determined by the number of perceptual units. In the segmentation part, perceptual units are regarded as the basic element instead of discrete pixels in the graph cut. The appearance models of the foreground and background are constructed by combining the perceptual units. According to the relationship between perceptual units and the appearance model, the foreground can be segmented through a minimum-cut/maximum-flow algorithm. The experiment conducted on the CMU-Cornell iCoseg database shows that the proposed model has a promising performance.

Automated delineation of corneal layers on OCT images using a boundary-guided CNN

Accurate segmentation of corneal layers depicted on optical coherence tomography (OCT) images is very helpful for quantitatively assessing and diagnosing corneal diseases (e.g., keratoconus and dry eye). In this study, we presented a novel boundary-guided convolutional neural network (CNN) architecture (BG-CNN) to simultaneously extract different corneal layers and delineate their boundaries. The developed BG-CNN architecture used three convolutional blocks to construct two network modules on the basis of the classical U-Net network. We trained and validated the network on a dataset consisting of 1,712 OCT images acquired on 121 subjects using a 10-fold cross-validation method. Our experiments showed an average dice similarity coefficient (DSC) of 0.9691, an intersection over union (IOU) of 0.9411, and a Hausdorff distance (HD) of 7.4423 pixels. Compared with several other classical networks, namely U-Net, Attention U-Net, Asymmetric U-Net, BiO-Net, CE-Net, CPFnte, M-Net, and Deeplabv3, on the same dataset, the developed network demonstrated a promising performance, suggesting its unique strength in segmenting corneal layers depicted on OCT images.

Hybrid COVID-19 segmentation and recognition framework (HMB-HCF) using deep learning and genetic algorithms

COVID-19 (Coronavirus) went through a rapid escalation until it became a pandemic disease. The normal and manual medical infection discovery may take few days and therefore computer science engineers can share in the development of the automatic diagnosis for fast detection of that disease. The study suggests a hybrid COVID-19 framework (named HMB-HCF) based on deep learning (DL), genetic algorithm (GA), weighted sum (WS), and majority voting principles in nine phases. Its segmentation phase suggests a lung segmentation algorithm using X-Ray images (named HMB-LSAXI) for extracting lungs. Its classification phase is built from a hybrid convolutional neural network (CNN) architecture using an abstractly-designed CNN (named HMB1-COVID19) and transfer learning (TL) pre-trained models (VGG16, VGG19, ResNet50, ResNet101, Xception, DenseNet121, DenseNet169, MobileNet, and MobileNetV2). The hybrid CNN architecture is used for learning, classification, and parameters optimization while GA is used to optimize the hyperparameters. This hybrid working mechanism is combined in an overall algorithm named HMB-DLGA. The study experiments implemented the WS approach to evaluate the models' performance using the loss, accuracy, F1-score, precision, recall, and area under curve (AUC) metrics with different pre-defined ratios. A collected, combined, and unified X-Ray dataset from 8 different public datasets was used alongside the regularization, dropout, and data augmentation techniques to limit the overall overfitting. The applied experiments reported state-of-the-art metrics. VGG16 reported 100% WS metric (i.e., 0.0097, 99.78%, 0.9984, 99.89%, 99.78%, and 0.9996 for the loss, accuracy, F1, precision, recall, and AUC respectively) concerning the highest WS. It also reported a 99.92% WS metric (i.e., 0.0099, 99.84%, 0.9984, 99.84%, 99.84%, and 0.9996 for the loss, accuracy, F1, precision, recall, and AUC respectively) concerning the last reported WS result. HMB-HCF was validated on 13 different public datasets to verify its generalization. The best-achieved metrics were compared with 13 related studies. These extensive experiments' target was the applicability verification and generalization.

Integrating a learned probabilistic model with energy functional for ultrasound image segmentation

The segmentation of ultrasound (US) images is steadily growing in popularity, owing to the necessity of computer-aided diagnosis (CAD) systems and the advantages that this technique shows, such as safety and efficiency. The objective of this work is to separate the lesion from its background in US images. However, most US images contain poor quality, which is affected by the noise, ambiguous boundary, and heterogeneity. Moreover, the lesion region may be not salient amid the other normal tissues, which makes its segmentation a challenging problem. In this paper, an US image segmentation algorithm that combines the learned probabilistic model with energy functionals is proposed. Firstly, a learned probabilistic model based on the generalized linear model (GLM) reduces the false positives and increases the likelihood energy term of the lesion region. It yields a new probability projection that attracts the energy functional toward the desired region of interest. Then, boundary indicator and probability statistical-based energy functional are used to provide a reliable boundary for the lesion. Integrating probabilistic information into the energy functional framework can effectively overcome the impact of poor quality and further improve the accuracy of segmentation. To verify the performance of the proposed algorithm, 40 images are randomly selected in three databases for evaluation. The values of DICE coefficient, the Jaccard distance, root-mean-square error, and mean absolute error are 0.96, 0.91, 0.059, and 0.042, respectively. Besides, the initialization of the segmentation algorithm and the influence of noise are also analyzed. The experiment shows a significant improvement in performance. A. Description of the proposed paper. B. The main steps involved in the proposed method.

Automated segmentation of the optic disc from fundus images using an asymmetric deep learning network

Accurate segmentation of the optic disc (OD) regions from color fundus images is a critical procedure for computer-aided diagnosis of glaucoma. We present a novel deep learning network to automatically identify the OD regions. On the basis of the classical U-Net framework, we define a unique sub-network and a decoding convolutional block. The sub-network is used to preserve important textures and facilitate their detections, while the decoding block is used to improve the contrast of the regions-of-interest with their background. We integrate these two components into the classical U-Net framework to improve the accuracy and reliability of segmenting the OD regions depicted on color fundus images. We train and evaluate the developed network using three publicly available datasets (i.e., MESSIDOR, ORIGA, and REFUGE). The results on an independent testing set (n=1,970 images) show a segmentation performance with an average Dice similarity coefficient (DSC), intersection over union (IOU), and Matthew's correlation coefficient (MCC) of 0.9377, 0.8854, and 0.9383 when trained on the global field-of-view images, respectively, and 0.9735, 0.9494, and 0.9594 when trained on the local disc region images. When compared with the other three classical networks (i.e., the U-Net, M-Net, and Deeplabv3) on the same testing datasets, the developed network demonstrates a relatively higher performance.

Intuitionistic Fuzzy C-Means Algorithm Based on Membership Information Transfer-Ring and Similarity Measurement

The fuzzy C-means clustering (FCM) algorithm is used widely in medical image segmentation and suitable for segmenting brain tumors. Therefore, an intuitionistic fuzzy C-means algorithm based on membership information transferring and similarity measurements (IFCM-MS) is proposed to segment brain tumor magnetic resonance images (MRI) in this paper. The original FCM lacks spatial information, which leads to a high noise sensitivity. To address this issue, the membership information transfer model is adopted to the IFCM-MS. Specifically, neighborhood information and the similarity of adjacent iterations are incorporated into the clustering process. Besides, FCM uses simple distance measurements to calculate the membership degree, which causes an unsatisfactory result. So, a similarity measurement method is designed in the IFCM-MS to improve the membership calculation, in which gray information and distance information are fused adaptively. In addition, the complex structure of the brain results in MRIs with uncertainty boundary tissues. To overcome this problem, an intuitive fuzzy attribute is embedded into the IFCM-MS. Experiments performed on real brain tumor images demonstrate that our IFCM-MS has low noise sensitivity and high segmentation accuracy.

A Novel Active Contour Model for Noisy Image Segmentation based on Adaptive Fractional Order Differentiation

The images used in various practices are often disturbed by noise, such as Gaussian noise, speckled noise, and salt and pepper noise. Images with noise are one of the challenges for segmentation, since the noise may cause inaccurate segmented results. To cope with the effect of noise on images during segmentation, a novel active contour model is proposed in this paper. The newly proposed model consists of fitting term, regularization term and penalty term. The fitting term is designed using a Gaussian kernel function and fractional order differentiation with an adaptively defined fractional order, which applies different orders to different pixels. The regularization term is applied to maintain the smoothness of curves. In order to ensure stable evolution of curves, a penalty term is added into the proposed model. Comparison experiments are conducted to show the effectiveness and efficiency of the proposed model.

BRAIN TUMOR SEGMENTATION BASED ON SUPERPIXELS AND HYBRID CLUSTERING WITH FAST GUIDED FILTER

Brain tumor segmentation from magnetic resonance (MR) image is vital for both the diagnosis and treatment of brain cancers. To alleviate noise sensitivity and improve stability of segmentation, an effective hybrid clustering algorithm combined with fast guided filter is proposed for brain tumor segmentation in this paper. Preprocessing is performed using adaptive Wiener filtering combined with a fast guided filter. Then simple linear iterative clustering (SLIC) is utilized for pre-segmentation to effectively remove scatter. During the clustering, K-means[Formula: see text] and Gaussian kernel-based fuzzy C-means (K[Formula: see text]GKFCM) clustering algorithm are combined to segment, and the fast-guided filter is introduced into the clustering. The proposed algorithm not only improves the robustness of the algorithm to noise, but also improves the stability of the segmentation. In addition, the proposed algorithm is compared with other current segmentation algorithms. The results show that the proposed algorithm performs better in terms of accuracy, sensitivity, specificity and recall.

Advance computer analysis of magnetic resonance imaging (MRI) for early brain tumor detection

PURPOSE

The brain tumor grows inside the skull and interposes with regular brain functioning. The tumor growth may possibly result in cancer at a later stage. The early detection of brain tumor is crucial for successful treatment of fatal disease. The tumor presence is normally detected by Computed Tomography (CT) or Magnetic Resonance Imaging (MRI) images. The MRI/CT images are highly complex and involve huge data. This requires highly tedious and time-consuming process for detection of small tumors for the neurologists. Thus, there is a need to develop an effective and less time-consuming imaging technique for early detection of brain tumors.

MATERIALS AND METHODS

This paper mainly focuses on early detecting and localizing the brain tumor region using segmentation of patient's MRI images. The Matlab software experiments are performed on a set of fifteen tumorous MRI images. In the proposed work, four image segmentation modalities namely watershed transform, k-means clustering, thresholding and Fuzzy C Means Clustering techniques with median filtering have been implemented.

RESULTS

The results are verified by quantitative comparison of results in terms of image quality evaluation parameters-Entropy, standard deviation and Naturalness Image Quality Evaluator. A remarkable rise in the entropy and standard deviation values has been noticed.

CONCLUSIONS

The watershed transform segmentation with median filtering yields the best quality brain tumor images. The noteworthy improvement in visibility of the MRI images may highly increase the possibilities of early detection and successful treatment of brain tumor disease and thereby assists the clinicians to decide the precise therapies.

Brain Tumor Segmentation Based on Hybrid Clustering and Morphological Operations

Inference of tumor and edema areas from brain magnetic resonance imaging (MRI) data remains challenging owing to the complex structure of brain tumors, blurred boundaries, and external factors such as noise. To alleviate noise sensitivity and improve the stability of segmentation, an effective hybrid clustering algorithm combined with morphological operations is proposed for segmenting brain tumors in this paper. The main contributions of the paper are as follows: firstly, adaptive Wiener filtering is utilized for denoising, and morphological operations are used for removing nonbrain tissue, effectively reducing the method's sensitivity to noise. Secondly, K-means++ clustering is combined with the Gaussian kernel-based fuzzy C-means algorithm to segment images. This clustering not only improves the algorithm's stability, but also reduces the sensitivity of clustering parameters. Finally, the extracted tumor images are postprocessed using morphological operations and median filtering to obtain accurate representations of brain tumors. In addition, the proposed algorithm was compared with other current segmentation algorithms. The results show that the proposed algorithm performs better in terms of accuracy, sensitivity, specificity, and recall.

A coarse-to-fine deep learning framework for optic disc segmentation in fundus images

Accurate segmentation of the optic disc (OD) depicted on color fundus images may aid in the early detection and quantitative diagnosis of retinal diseases, such as glaucoma and optic atrophy. In this study, we proposed a coarse-to-fine deep learning framework on the basis of a classical convolutional neural network (CNN), known as the U-net model, to accurately identify the optic disc. This network was trained separately on color fundus images and their grayscale vessel density maps, leading to two different segmentation results from the entire image. We combined the results using an overlap strategy to identify a local image patch (disc candidate region), which was then fed into the U-net model for further segmentation. Our experiments demonstrated that the developed framework achieved an average intersection over union (IoU) and a dice similarity coefficient (DSC) of 89.1% and 93.9%, respectively, based on 2,978 test images from our collected dataset and six public datasets, as compared to 87.4% and 92.5% obtained by only using the sole U-net model. The comparison with available approaches demonstrated a reliable and relatively high performance of the proposed deep learning framework in automated OD segmentation.

Inshore Ship Detection Based on Level Set Method and Visual Saliency for SAR Images

Inshore ship detection is an important research direction of synthetic aperture radar (SAR) images. Due to the effects of speckle noise, land clutters and low signal-to-noise ratio, it is still challenging to achieve effective detection of inshore ships. To solve these issues, an inshore ship detection method based on the level set method and visual saliency is proposed in this paper. First, the image is fast initialized through down-sampling. Second, saliency map is calculated by improved local contrast measure (ILCM). Third, an improved level set method based on saliency map is proposed. The saliency map has a higher signal-to-noise ratio and the local level set method can effectively segment images with intensity inhomogeneity. In this way, the improved level set method has a better segmentation result. Then, candidate targets are obtained after the adaptive threshold. Finally, discrimination is employed to get the final result of ship targets. The experiments on a number of SAR images demonstrate that the proposed method can detect ship targets with reasonable accuracy and integrity.