A modified fuzzy C-means algorithm for bias field estimation and segmentation of MRI data

A novel self-learning weighted fuzzy local information clustering algorithm integrating local and non-local spatial information for noise image segmentation

Fuzzy clustering algorithm (FCM) can be directly used to segment images, it takes no account of the neighborhood information of the current pixel and does not have a robust segmentation noise suppression. Fuzzy Local Information C-means Clustering (FLICM) is a widely used robust segmentation algorithm, which combines spatial information with the membership degree of adjacent pixels. In order to further improve the robustness of FLICM algorithm, non-local information is embedded into FLICM algorithm and a fuzzy C-means clustering algorithm has local and non-local information (FLICMLNLI) is obtained. When calculating distance from pixel to cluster center, FLICMLNLI algorithm considers two distances from current pixel and its neighborhood pixels to cluster center. However, the algorithm gives the same weight to two different distances, which incorrectly magnifies the importance of neighborhood information in calculating the distance, resulting in unsatisfactory image segmentation effects and loss of image details. In order to solve this problem, we raise an improved self-learning weighted fuzzy algorithm, which directly obtains different weights in distance calculation through continuous iterative self-learning, then the distance metric with the weights obtained from self-learning is embedded in the objective function of the fuzzy clustering algorithm in order to improve the segmentation performance and robustness of the algorithm. A large number of experiments on different types of images show that the algorithm can not only suppress the noise but also retain the details in the image, the effect of segmenting complex noise images is better, and it provides better image segmentation results than the existing latest fuzzy clustering algorithms.

Recent Advancements in Fuzzy C-means Based Techniques for Brain MRI Segmentation

BACKGROUND

Variations of image segmentation techniques, particularly those used for Brain MRI segmentation, vary in complexity from basic standard Fuzzy C-means (FCM) to more complex and enhanced FCM techniques.

OBJECTIVE

In this paper, a comprehensive review is presented on all thirteen variations of FCM segmentation techniques. In the review process, the concentration is on the use of FCM segmentation techniques for brain tumors. Brain tumor segmentation is a vital step in the process of automatically diagnosing brain tumors. Unlike segmentation of other types of images, brain tumor segmentation is a very challenging task due to the variations in brain anatomy. The low contrast of brain images further complicates this process. Early diagnosis of brain tumors is indeed beneficial to patients, doctors, and medical providers.

RESULTS

FCM segmentation works on images obtained from magnetic resonance imaging (MRI) scanners, requiring minor modifications to hospital operations to early diagnose tumors as most, if not all, hospitals rely on MRI machines for brain imaging.

CONCLUSION

In this paper, we critically review and summarize FCM based techniques for brain MRI segmentation.

A Novel Type-2 Fuzzy C-Means Clustering for Brain MR Image Segmentation

The fuzzy C -means (FCM) clustering procedure is an unsupervised form of grouping the homogenous pixels of an image in the feature space into clusters. A brain magnetic resonance (MR) image is affected by noise and intensity inhomogeneity (IIH) during the acquisition process. FCM has been used in MR brain tissue segmentation. However, it does not consider the neighboring pixels for computing the membership values, thereby misclassifying the noisy pixels. The inaccurate cluster centers obtained in FCM do not address the problem of IIH. A fixed value of the fuzzifier ( m ) used in FCM brings uncertainty in controlling the fuzziness of the extracted clusters. To resolve these issues, we suggest a novel type-2 adaptive weighted spatial FCM (AWSFCM) clustering algorithm for MR brain tissue segmentation. The idea of type-2 FCM applied to the problem on hand is new and is reported in this article. The application of the proposed technique to the problem of MR brain tissue segmentation replaces the fixed fuzzifier value with a fuzzy linguistic fuzzifier value ( M ). The introduction of the spatial information in the membership function reduces the misclassification of noisy pixels. Furthermore, the incorporation of adaptive weights into the cluster center update function improves the accuracy of the final cluster centers, thereby reducing the effect of IIH. The suggested algorithm is evaluated using T1-w, T2-w, and proton density (PD) brain MR image slices. The performance is justified in terms of qualitative and quantitative measures followed by statistical analysis. The outcomes demonstrate the superiority and robustness of the algorithm in comparison to the state-of-the-art methods. This article is useful for the cybernetics application.

Learning fuzzy clustering for SPECT/CT segmentation via convolutional neural networks

PURPOSE

Quantitative bone single-photon emission computed tomography (QBSPECT) has the potential to provide a better quantitative assessment of bone metastasis than planar bone scintigraphy due to its ability to better quantify activity in overlapping structures. An important element of assessing the response of bone metastasis is accurate image segmentation. However, limited by the properties of QBSPECT images, the segmentation of anatomical regions-of-interests (ROIs) still relies heavily on the manual delineation by experts. This work proposes a fast and robust automated segmentation method for partitioning a QBSPECT image into lesion, bone, and background.

METHODS

We present a new unsupervised segmentation loss function and its semi- and supervised variants for training a convolutional neural network (ConvNet). The loss functions were developed based on the objective function of the classical Fuzzy C-means (FCM) algorithm. The first proposed loss function can be computed within the input image itself without any ground truth labels, and is thus unsupervised; the proposed supervised loss function follows the traditional paradigm of the deep learning-based segmentation methods and leverages ground truth labels during training. The last loss function is a combination of the first and the second and includes a weighting parameter, which enables semi-supervised segmentation using deep learning neural network.

EXPERIMENTS AND RESULTS

We conducted a comprehensive study to compare our proposed methods with ConvNets trained using supervised, cross-entropy and Dice loss functions, and conventional clustering methods. The Dice similarity coefficient (DSC) and several other metrics were used as figures of merit as applied to the task of delineating lesion and bone in both simulated and clinical SPECT/CT images. We experimentally demonstrated that the proposed methods yielded good segmentation results on a clinical dataset even though the training was done using realistic simulated images. On simulated SPECT/CT, the proposed unsupervised model's accuracy was greater than the conventional clustering methods while reducing computation time by 200-fold. For the clinical QBSPECT/CT, the proposed semi-supervised ConvNet model, trained using simulated images, produced DSCs of 0.75 and 0.74 for lesion and bone segmentation in SPECT, and a DSC of 0.79 bone segmentation of CT images. These DSCs were larger than that for standard segmentation loss functions by > 0.4 for SPECT segmentation, and > 0.07 for CT segmentation with P-values < 0.001 from a paired t-test.

CONCLUSIONS

A ConvNet-based image segmentation method that uses novel loss functions was developed and evaluated. The method can operate in unsupervised, semi-supervised, or fully-supervised modes depending on the availability of annotated training data. The results demonstrated that the proposed method provides fast and robust lesion and bone segmentation for QBSPECT/CT. The method can potentially be applied to other medical image segmentation applications.

Adaptive scale weighted fuzzy C-Means clustering for the segmentation of purple soil color image

The segmentation and extraction of the purple soil region from purple soil color image can effectively avoid the influence of background on recognition of soil types. A scale weighted fuzzy c-means clustering algorithm(SWFCM) is proposed for effective segmentation of purple soil color image. The main work is to establish the maximum difference optimization model with the mean of Gaussian distance between each pixel and each peak of the image histogram, and optimize the clustering number and the initial clustering centers. Then, the compactness of each class is defined to weight the Euclidean distance between the pixel and the clustering center and improve the optimization model of FCM for raising its clustering performance. Aiming at the problem of removing scattered small soil blocks in the background and filling holes in the purple soil region, the algorithm of extracting the boundary of the purple soil region and the algorithm of filling the purple soil region are proposed. Finally, the normal and robust experiments are carried out on the normal sample set and robust sample set. And the performances of relative algorithms are compared, which involves the previously released FCM algorithms and some methods for the segmentation of purple soil color image and our proposed algorithm. Experimental results show that performance of SWFCM is better and it can provide a high reference for adaptive segmentation of purple soil color images. Especially for robust experiment images, its average segmentation accuracy is improved by 6 . 64% ∼ 8 . 25 % compared with other purple soil segmentation algorithms.

Sleep Quality Detection Based on EEG Signals Using Transfer Support Vector Machine Algorithm

BACKGROUND

In recent years, with the acceleration of life rhythm and increased pressure, the problem of sleep disorders has become more and more serious. It affects people's quality of life and reduces work efficiency, so the monitoring and evaluation of sleep quality is of great significance. Sleep staging has an important reference value in sleep quality assessment. This article starts with the study of sleep staging to detect and analyze sleep quality. For the purpose of sleep quality detection, this article proposes a sleep quality detection method based on electroencephalography (EEG) signals.

MATERIALS AND METHODS

This method first preprocesses the EEG signals and then uses the discrete wavelet transform (DWT) for feature extraction. Finally, the transfer support vector machine (TSVM) algorithm is used to classify the feature data.

RESULTS

The proposed algorithm was tested using 60 pieces of data from the National Sleep Research Resource Library of the United States, and sleep quality was evaluated using three indicators: sensitivity, specificity, and accuracy. Experimental results show that the classification performance of the TSVM classifier is significantly higher than those of other comparison algorithms. This further validated the effectiveness of the proposed sleep quality detection method.

Automatic Segmentation and Measurement on Knee Computerized Tomography Images for Patellar Dislocation Diagnosis

Traditionally, for diagnosing patellar dislocation, clinicians make manual geometric measurements on computerized tomography (CT) images taken in the knee area, which is often complex and error-prone. Therefore, we develop a prototype CAD system for automatic measurement and diagnosis. We firstly segment the patella and the femur regions on the CT images and then measure two geometric quantities, patellar tilt angle (PTA), and patellar lateral shift (PLS) automatically on the segmentation results, which are finally used to assist in diagnoses. The proposed quantities are proved valid and the proposed algorithms are proved effective by experiments.

A Novel Brain MRI Image Segmentation Method Using an Improved Multi-View Fuzzy c-Means Clustering Algorithm

Background: The brain magnetic resonance imaging (MRI) image segmentation method mainly refers to the division of brain tissue, which can be divided into tissue parts such as white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF). The segmentation results can provide a basis for medical image registration, 3D reconstruction, and visualization. Generally, MRI images have defects such as partial volume effects, uneven grayscale, and noise. Therefore, in practical applications, the segmentation of brain MRI images has difficulty obtaining high accuracy.

Materials and Methods: The fuzzy clustering algorithm establishes the expression of the uncertainty of the sample category and can describe the ambiguity brought by the partial volume effect to the brain MRI image, so it is very suitable for brain MRI image segmentation (B-MRI-IS). The classic fuzzy c-means (FCM) algorithm is extremely sensitive to noise and offset fields. If the algorithm is used directly to segment the brain MRI image, the ideal segmentation result cannot be obtained. Accordingly, considering the defects of MRI medical images, this study uses an improved multiview FCM clustering algorithm (IMV-FCM) to improve the algorithm’s segmentation accuracy of brain images. IMV-FCM uses a view weight adaptive learning mechanism so that each view obtains the optimal weight according to its cluster contribution. The final division result is obtained through the view ensemble method. Under the view weight adaptive learning mechanism, the coordination between various views is more flexible, and each view can be adaptively learned to achieve better clustering effects.

Results: The segmentation results of a large number of brain MRI images show that IMV-FCM has better segmentation performance and can accurately segment brain tissue. Compared with several related clustering algorithms, the IMV-FCM algorithm has better adaptability and better clustering performance.

Brain MRI Intelligent Diagnostic Using an Improved Deep Convolutional Neural Network

The diagnosis of brain diseases based on magnetic resonance imaging (MRI) is a mainstream practice. In the course of practical treatment, medical personnel observe and analyze the changes in the size, position, and shape of various brain tissues in the brain MRI image, thereby judging whether the brain tissue has been diseased, and formulating the corresponding medical plan. The conclusion drawn after observing the image will be influenced by the subjective experience of the experts and is not objective. Therefore, it has become necessary to try to avoid subjective factors interfering with the diagnosis. This paper proposes an intelligent diagnosis model based on improved deep convolutional neural network (IDCNN). This model introduces integrated support vector machine (SVM) into IDCNN. During image segmentation, if IDCNN has problems such as irrational layer settings, too many parameters, etc., it will make its segmentation accuracy low. This study made a slight adjustment to the structure of IDCNN. First, adjust the number of convolution layers and down-sampling layers in the DCNN network structure, adjust the network’s activation function, and optimize the parameters to improve IDCNN’s non-linear expression ability. Then, use the integrated SVM classifier to replace the original Softmax classifier in IDCNN to improve its classification ability. The simulation experiment results tell that compared with the model before improvement and other classic classifiers, IDCNN improves segmentation results and promote the intelligent diagnosis of brain tissue.

Sparse Coding for Brain Tumor Segmentation Based on the Non-Linear Features

The main aim of brain Magnetic Resonance Image (MRI) segmentation is to extractthe significant objects like tumors for better diagnosis and proper treatment. As the brain tumors are distinct in the sense of shapes, location, and intensity it is hard to define a general algorithm for the tumor segmentation. Accurate extraction of tumors from the brain MRIs is a challenging task due to the complex anatomical structure of brain tissues in addition to the existence of intensity inhomogeneity, partial volume effects, and noise. In this paper, a method of Sparse coding based on non-linear features is proposed for the tumor segmentation from MR images of the brain. Initially, first and second-order statistical eigenvectors of 3 × 3 size are extracted from the MRIs then the process of Sparse coding is applied to them. The kernel dictionary learning algorithm is employed to obtain the non-linear features from these processed vectors to build two individual adaptive dictionaries for healthy and pathological tissues. This work proposes dictionary learning based kernel clustering algorithm to code the pixels, and then the target pixelsare classified by utilizing the method of linear discrimination. The proposed technique is applied to several tumor MRIs, taken from the BRATS database. This technique overcomes the problem of linear inseparability produced by the high level intensity similarity between the normal and abnormal tissues of the given brain image. All the performance parameters are high for the proposed technique. Comparison of the results with some other existing methods such as Fuzzy – C- Means (FCM), Hybrid k-Mean Graph Cut (HKMGC) and Neutrosophic Set – Expert Maximum Fuzzy Sure Entropy (NS-EMFSE) demonstrates that the proposed sparse coding method is effective in segmenting the brain tumor regions.

A new segmentation method for non-ideal iris images using morphological reconstruction FCM based on improved DSA

In any accurate iris recognition system segmentation of iris plays a vital role. The noise, specular reflections, eyelid/eyelash obstruction, and intensity inhomogeneities in an image make the segmentation more difficult. In this paper, a novel technique is proposed to segment the iris from images that are taken under uncooperative image conditions. The proposed method segments the image in two stages. Firstly, Morphological reconstruction fuzzy c-means clustering (MRFCM) based on an improved differential search algorithm is implemented before the segmentation step. The MRFCM can preserve image contours even in the presence of noise. Secondly, the iris is isolated from the undesired regions of an eye image by implementing geodesic active contours driven by a modified stopping criterion on the resultant images of the pre-segmentation step. The accuracy of the method presented has been tested on the databases such as CASIAv3-Interval, UBIRISv1, MMU1, IITDv1, and MICHE-I. The segmentation accuracy has been demonstrated and compared with other existing methods present in the literature. The obtained results are promising and the proposed model is outperformed the existing methods.

Adaptive Distance-Weighted Voronoi Tessellation for Remote Sensing Image Segmentation

The spatial fragmentation of high-resolution remote sensing images makes the segmentation algorithm put forward a strong demand for noise immunity. However, the stronger the noise immunity, the more serious the loss of detailed information, which easily leads to the neglect of effective characteristics. In view of the difficulty of balancing the noise immunity and effective characteristic retention, an adaptive distance-weighted Voronoi tessellation technology is proposed for remote sensing image segmentation. The distance between pixels and seed points in Voronoi tessellation is established by the adaptive weighting of spatial distance and spectral distance. The weight coefficient used to control the influence intensity of spatial distance is defined by a monotone decreasing function. Following the fuzzy clustering framework, a fuzzy segmentation model with Kullback–Leibler (KL) entropy regularization is established by using multivariate Gaussian distribution to describe the spectral characteristics and Markov Random Field (MRF) to consider the neighborhood effect of sub-regions. Finally, a series of parameter optimization schemes are designed according to parameter characteristics to obtain the optimal segmentation results. The proposed algorithm is validated on many multispectral remote sensing images with five comparing algorithms by qualitative and quantitative analysis. A large number of experiments show that the proposed algorithm can overcome the complex noise as well as better ensure effective characteristics.

Intensity non-uniformity correction in MR imaging using residual cycle generative adversarial network

Correcting or reducing the effects of voxel intensity non-uniformity (INU) within a given tissue type is a crucial issue for quantitative magnetic resonance (MR) image analysis in daily clinical practice. Although having no severe impact on visual diagnosis, the INU can highly degrade the performance of automatic quantitative analysis such as segmentation, registration, feature extraction and radiomics. In this study, we present an advanced deep learning based INU correction algorithm called residual cycle generative adversarial network (res-cycle GAN), which integrates the residual block concept into a cycle-consistent GAN (cycle-GAN). In cycle-GAN, an inverse transformation was implemented between the INU uncorrected and corrected magnetic resonance imaging (MRI) images to constrain the model through forcing the calculation of both an INU corrected MRI and a synthetic corrected MRI. A fully convolution neural network integrating residual blocks was applied in the generator of cycle-GAN to enhance end-to-end raw MRI to INU corrected MRI transformation. A cohort of 55 abdominal patients with T1-weighted MR INU images and their corrections with a clinically established and commonly used method, namely, N4ITK were used as a pair to evaluate the proposed res-cycle GAN based INU correction algorithm. Quantitatively comparisons of normalized mean absolute error (NMAE), peak signal-to-noise ratio (PSNR), normalized cross-correlation (NCC) indices, and spatial non-uniformity (SNU) were made among the proposed method and other approaches. Our res-cycle GAN based method achieved an NMAE of 0.011 ± 0.002, a PSNR of 28.0 ± 1.9 dB, an NCC of 0.970 ± 0.017, and a SNU of 0.298 ± 0.085. Our proposed method has significant improvements (p < 0.05) in NMAE, PSNR, NCC and SNU over other algorithms including conventional GAN and U-net. Once the model is well trained, our approach can automatically generate the corrected MR images in a few minutes, eliminating the need for manual setting of parameters.

Noise robust hybrid algorithm for segmenting image with unequal cluster sizes based on chaotic crow search and improved fuzzy c-means

Adding spatial penalty to fuzzy C-means (FCM) model is an important way to reduce the influence of noise in image segmentation. However, these improved algorithms easily cause segmentation failures when the image has the characteristics of unequal cluster sizes. Besides, they often fall into local optimal solutions if the initial cluster centers are improper. This paper presents a noise robust hybrid algorithm for segmenting image with unequal cluster sizes based on chaotic crow search algorithm and improved fuzzy c-means to overcome the above defects. Firstly, each size of clusters is integrated into the objective function of noise detecting fuzzy c-means algorithm (NDFCM), which can reduces the contribution of larger clusters to objective function and then the new membership degree and cluster centers are deduced. Secondly, a new expression called compactness, representing the pixel distribution of each cluster, is introduced into the iteration process of clustering. Thirdly, we use two- paths to seek the optimal solutions in each step of iteration: one path is produced by the chaotic crow search algorithm and the other is originated by gradient method. Furthermore, the better solutions of the two-paths go to next generation until the end of the iteration. Finally, the experiments on the synthetic and non–destructive testing (NDT) images show that the proposed algorithm behaves well in noise robustness and segmentation performance.

Hesitant fuzzy C-means algorithm and its application in image segmentation†

Image segmentation plays an important role in many fields such as computer vision, pattern recognition, machine learning and so on. In recent years, many variants of standard fuzzy C-means (FCM) algorithm have been proposed to explore how to remove noise and reduce uncertainty. In fact, there are uncertainty on the boundary between different patches in images. Considering that hesitant fuzzy set is a useful tool to deal with uncertainty, in this paper, we merge hesitant fuzzy set with fuzzy C-means algorithm, introduce a new kind of method of fuzzification and defuzzification of image and the distance measure between hesitant fuzzy elements of pixels, present a method to establish hesitant membership degree of hesitant fuzzy element, and propose hesitant fuzzy C-means (HFCM) algorithm. Finally, we compare our proposed HFCM algorithm with some existing fuzzy C-means (FCM) algorithms, and apply HFCM algorithm in natural image, BSDS dataset image, different size images and multi-attribute decision making. These numerical examples illustrate the validity and applicability of our proposed algorithm including its comprehensive performance, reducing running time and almost without loss of accuracy.

Review on 2D and 3D MRI Image Segmentation Techniques

BACKGROUND

Magnetic Resonance Imaging is most widely used for early diagnosis of abnormalities in human organs. Due to the technical advancement in digital image processing, automatic computer aided medical image segmentation has been widely used in medical diagnostics.

DISCUSSION

Image segmentation is an image processing technique which is used for extracting image features, searching and mining the medical image records for better and accurate medical diagnostics. Commonly used segmentation techniques are threshold based image segmentation, clustering based image segmentation, edge based image segmentation, region based image segmentation, atlas based image segmentation, and artificial neural network based image segmentation.

CONCLUSION

This survey aims at providing an insight about different 2-Dimensional and 3- Dimensional MRI image segmentation techniques and to facilitate better understanding to the people who are new in this field. This comparative study summarizes the benefits and limitations of various segmentation techniques.

3D Deep Learning on Medical Images: A Review

The rapid advancements in machine learning, graphics processing technologies and the availability of medical imaging data have led to a rapid increase in the use of deep learning models in the medical domain. This was exacerbated by the rapid advancements in convolutional neural network (CNN) based architectures, which were adopted by the medical imaging community to assist clinicians in disease diagnosis. Since the grand success of AlexNet in 2012, CNNs have been increasingly used in medical image analysis to improve the efficiency of human clinicians. In recent years, three-dimensional (3D) CNNs have been employed for the analysis of medical images. In this paper, we trace the history of how the 3D CNN was developed from its machine learning roots, we provide a brief mathematical description of 3D CNN and provide the preprocessing steps required for medical images before feeding them to 3D CNNs. We review the significant research in the field of 3D medical imaging analysis using 3D CNNs (and its variants) in different medical areas such as classification, segmentation, detection and localization. We conclude by discussing the challenges associated with the use of 3D CNNs in the medical imaging domain (and the use of deep learning models in general) and possible future trends in the field.

Wavelet Frame-Based Fuzzy C-Means Clustering for Segmenting Images on Graphs

In recent years, image processing in a Euclidean domain has been well studied. Practical problems in computer vision and geometric modeling involve image data defined in irregular domains, which can be modeled by huge graphs. In this paper, a wavelet frame-based fuzzy C -means (FCM) algorithm for segmenting images on graphs is presented. To enhance its robustness, images on graphs are first filtered by using spatial information. Since a real image usually exhibits sparse approximation under a tight wavelet frame system, feature spaces of images on graphs can be obtained. Combining the original and filtered feature sets, this paper uses the FCM algorithm for segmentation of images on graphs contaminated by noise of different intensities. Finally, some supporting numerical experiments and comparison with other FCM-related algorithms are provided. Experimental results reported for synthetic and real images on graphs demonstrate that the proposed algorithm is effective and efficient, and has a better ability for segmentation of images on graphs than other improved FCM algorithms existing in the literature. The approach can effectively remove noise and retain feature details of images on graphs. It offers a new avenue for segmenting images in irregular domains.

Cellular cholesterol prediction of mammalian ATP-binding cassette (ABC) proteins based on fuzzy c-means with support vector machine algorithms

Over the years protein interaction and prediction of membrane protein have been a pivotal research area for all researchers. For both prokaryotes and eukaryotes Adenosine Triphosphate-(ATP) binding cassette (ABC) genes plays a significant role. In our analysis, we concentrate on human part of ABC genes. In case of living organisms transport of precise molecules across lipid membranes has been treated as vital part and for that reason a bigger transporter is required to carry out the molecules. Here ABC transporter families are evolved to transport the specific molecules such as sugars, amino acid, peptides, proteins, ions etc. within the plasma membrane. As we know another important component of human being is cholesterol, which is a major component in cell membrane and its main functions are to maintain integrity and mechanical stability. Each and every time, membrane cholesterolsareinteracted with membrane protein in both N-C terminuses and target valid sequence(s) which has relevance in human diseases. In this manuscript we have applied Fuzzy C-Means (FCM) with Support Vector Machine (SVM) algorithm for prediction of cellular cholesterol with ABC genes. Our experiments have been performed well using ABCdata set.

Mass segmentation of mammograms using Markov models associated with constrained clustering

In this paper, we propose four variants of the Markov random field model by using constrained clustering for breast mass segmentation. These variants were tested with a set of images extracted from a public database. The obtained results have shown that the proposed variants, which allow to include additional information in the form of constraints to the clustering process, present better visual segmentation results than the original model, as well as a lower final energy which implies a better quality in the final segmentation. Specifically, the centroid initialization method used by our variants allows us to locate about 90% of the regions of interest that contain a mass, which subsequently with the pairwise constraints helped us recover a maximum of 93% of the masses. The segmentation results are also quantitatively evaluated using three supervised segmentation measures. These measures show that the mass segmentation quality of the proposed variants, considering the breast density level, is consistent with the corresponding segmentation annotated by specialized radiologists.

Suspicious Lesion Segmentation on Brain, Mammograms and Breast MR Images Using New Optimized Spatial Feature Based Super-Pixel Fuzzy C-Means Clustering

Suspicious lesion or organ segmentation is a challenging task to be solved in most of the medical image analyses, medical diagnoses and computer diagnosis systems. Nevertheless, various image segmentation methods were proposed in the previous studies with varying success levels. But, the image segmentation problems such as lack of versatility, low robustness, high complexity and low accuracy in up-to-date image segmentation practices still remain unsolved. Fuzzy c-means clustering (FCM) methods are very well suited for segmenting the regions. The noise-free images are effectively segmented using the traditional FCM method. However, the segmentation result generated is highly sensitive to noise due to the negligence of spatial information. To solve this issue, super-pixel-based FCM (SPOFCM) is implemented in this paper, in which the influence of spatially neighbouring and similar super-pixels is incorporated. Also, a crow search algorithm is adopted for optimizing the influential degree; thereby, the segmentation performance is improved. In clinical applications, the SPOFCM feasibility is verified using the multi-spectral MRIs, mammograms and actual single spectrum on performing tumour segmentation tests for SPOFCM. Ultimately, the competitive, renowned segmentation techniques such as k-means, entropy thresholding (ET), FCM, FCM with spatial constraints (FCM_S) and kernel FCM (KFCM) are used to compare the results of proposed SPOFCM. Experimental results on multi-spectral MRIs and actual single-spectrum mammograms indicate that the proposed algorithm can provide a better performance for suspicious lesion or organ segmentation in computer-assisted clinical applications.

Automated image analysis system for studying cardiotoxicity in human pluripotent stem cell-Derived cardiomyocytes

BACKGROUND

Cardiotoxicity, characterized by severe cardiac dysfunction, is a major problem in patients treated with different classes of anticancer drugs. Development of predictable human-based models and assays for drug screening are crucial for preventing potential drug-induced adverse effects. Current animal in vivo models and cell lines are not always adequate to represent human biology. Alternatively, human induced pluripotent stem cell-derived cardiomyocytes (hiPSC-CMs) show great potential for disease modelling and drug-induced toxicity screenings. Fully automated high-throughput screening of drug toxicity on hiPSC-CMs by fluorescence image analysis is, however, very challenging, due to clustered cell growth patterns and strong intracellular and intercellular variation in the expression of fluorescent markers.

RESULTS

In this paper, we report on the development of a fully automated image analysis system for quantification of cardiotoxic phenotypes from hiPSC-CMs that are treated with various concentrations of anticancer drugs doxorubicin or crizotinib. This high-throughput system relies on single-cell segmentation by nuclear signal extraction, fuzzy C-mean clustering of cardiac α-actinin signal, and finally nuclear signal propagation. When compared to manual segmentation, it generates precision and recall scores of 0.81 and 0.93, respectively.

CONCLUSIONS

Our results show that our fully automated image analysis system can reliably segment cardiomyocytes even with heterogeneous α-actinin signals.

Segmentation of MR Brain Images Through Hidden Markov Random Field and Hybrid Metaheuristic Algorithm

Image segmentation is one of the most critical tasks in Magnetic Resonance (MR) images analysis. Since the performance of most current image segmentation methods is suffered by noise and intensity non-uniformity artifact (INU), a precise and artifact resistant method is desired. In this work, we propose a new segmentation method combining a new Hidden Markov Random Field (HMRF) model and a novel hybrid metaheuristic method based on Cuckoo search (CS) and Particle swarm optimization algorithms (PSO). The new model uses adaptive parameters to allow balancing between the segmented components of the model. In addition, to improve the quality of searching solutions in the Maximum a posteriori (MAP) estimation of the HMRF model, the hybrid metaheuristic algorithm is introduced. This algorithm takes into account both the advantages of CS and PSO algorithms in searching ability by cooperating them with the same population in a parallel way and with a solution selection mechanism. Since CS and PSO are performing exploration and exploitation in the search space, respectively, hybridizing them in an intelligent way can provide better solutions in terms of quality. Furthermore, initialization of the population is carefully taken into account to improve the performance of the proposed method. The whole algorithm is evaluated on benchmark images including both the simulated and real MR brain images. Experimental results show that the proposed method can achieve satisfactory performance for images with noise and intensity inhomogeneity, and provides better results than its considered competitors.

Nucleus segmentation of cervical cytology images based on multi-scale fuzzy clustering algorithm

In the screening of cervical cancer cells, accurate identification and segmentation of nucleus in cell images is a key part in the early diagnosis of cervical cancer. Overlapping, uneven staining, poor contrast, and other reasons present challenges to cervical nucleus segmentation. We propose a segmentation method for cervical nuclei based on a multi-scale fuzzy clustering algorithm, which segments cervical cell clump images at different scales. We adopt a novel interesting degree based on area prior to measure the interesting degree of the node. The application of these two methods not only solves the problem of selecting the categories number of the clustering algorithm but also greatly improves the nucleus recognition performance. The method is evaluated by the IBSI2014 and IBSI2015 public datasets. Experiments show that the proposed algorithm has greater advantages than the state-of-the-art cervical nucleus segmentation algorithms and accomplishes high accuracy nucleus segmentation results.

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.

A Spatially Constrained Probabilistic Model for Robust Image Segmentation

In general, the hidden Markov random field (HMRF) represents the class label distribution of an image in probabilistic model based segmentation. The class label distributions provided by existing HMRF models consider either the number of neighboring pixels with similar class labels or the spatial distance of neighboring pixels with dissimilar class labels. Also, this spatial information is only considered for estimation of class labels of the image pixels, while its contribution in parameter estimation is completely ignored. This, in turn, deteriorates the parameter estimation, resulting in sub-optimal segmentation performance. Moreover, the existing models assign equal weightage to the spatial information for class label estimation of all pixels throughout the image, which, create significant misclassification for the pixels in boundary region of image classes. In this regard, the paper develops a new clique potential function and a new class label distribution, incorporating the information of image class parameters. Unlike existing HMRF model based segmentation techniques, the proposed framework introduces a new scaling parameter that adaptively measures the contribution of spatial information for class label estimation of image pixels. The importance of the proposed framework is depicted by modifying the HMRF based segmentation methods. The advantage of proposed class label distribution is also demonstrated irrespective of the underlying intensity distributions. The comparative performance of the proposed and existing class label distributions in HMRF model is demonstrated both qualitatively and quantitatively for brain MR image segmentation, HEp-2 cell delineation, natural image and object segmentation.

SAR Image Segmentation Using Region Smoothing and Label Correction

The traditional unsupervised image segmentation methods are widely used in synthetic aperture radar (SAR) image segmentation due to the simple and convenient application process. In order to solve the time-consuming problem of the common methods, an SAR image segmentation method using region smoothing and label correction (RSLC) is proposed. In this algorithm, the image smoothing results are used to approximate the results of the spatial information polynomials of the image. Thus, the segmentation process can be realized quickly and effectively. Firstly, direction templates are used to detect the directions at different coordinates of the image, and smoothing templates are used to smooth the edge regions according to the directions. It achieves the smoothing of the edge regions and the retention of the edge information. Then the homogeneous regions are presented indirectly according to the difference of directions. The homogeneous regions are smoothed by using isotropic operators. Finally, the two regions are fused for K-means clustering. The majority voting algorithm is used to modify the clustering results, and the final segmentation results are obtained. Experimental results on simulated SAR images and real SAR images show that the proposed algorithm outperforms the other five state-of-the-art algorithms in segmentation speed and accuracy.

Infrared image segmentation based on multi-information fused fuzzy clustering method for electrical equipment

Serious noise pollution and background interference bring great difficulties to infrared image segmentation of electronic equipment. A novel infrared image segmentation method based on multi-information fused fuzzy clustering method is proposed in this article. Firstly, saliency detection is performed on the infrared image to obtain the saliency map, which determines the initial clustering center and enhances the contrast of the original infrared image. Secondly, the weighting exponent in the objective function is adjusted adaptively. Then local and global spatial constraints are added to the objective function of the fuzzy clustering method, which can reduce the noise and background interference. Finally, the Markov constrained field is calculated according to the initial segmentation result. After that the joint field of fuzzy clustering field and the Markov random field is constructed to obtain the optimized segmentation result. The algorithm is evaluated on the infrared images of electrical equipment, and the experimental results show that the proposed method is robust to noise and complicated background. Compared with other methods, the proposed method improves the average segmentation accuracy and T measure by about 10% and 13%.