An adaptive spatial fuzzy clustering algorithm for 3-D MR image segmentation

A Fuzzy Consensus Clustering Algorithm for MRI Brain Tissue Segmentation

Brain tissue segmentation is an important component of the clinical diagnosis of brain diseases using multi-modal magnetic resonance imaging (MR). Brain tissue segmentation has been developed by many unsupervised methods in the literature. The most commonly used unsupervised methods are K-Means, Expectation-Maximization, and Fuzzy Clustering. Fuzzy clustering methods offer considerable benefits compared with the aforementioned methods as they are capable of handling brain images that are complex, largely uncertain, and imprecise. However, this approach suffers from the intrinsic noise and intensity inhomogeneity (IIH) in the data resulting from the acquisition process. To resolve these issues, we propose a fuzzy consensus clustering algorithm that defines a membership function resulting from a voting schema to cluster the pixels. In particular, we first pre-process the MRI data and employ several segmentation techniques based on traditional fuzzy sets and intuitionistic sets. Then, we adopted a voting schema to fuse the results of the applied clustering methods. Finally, to evaluate the proposed method, we used the well-known performance measures (boundary measure, overlap measure, and volume measure) on two publicly available datasets (OASIS and IBSR18). The experimental results show the superior performance of the proposed method in comparison with the recent state of the art. The performance of the proposed method is also presented using a real-world Autism Spectrum Disorder Detection problem with better accuracy compared to other existing methods.

Research and Application of Clustering Algorithm for Text Big Data

In the era of big data, text as an information reserve database is very important, in all walks of life. From humanities research to government decision-making, from precision medicine to quantitative finance, from customer management to marketing, massive text, as one of the most important information carriers, plays an important role everywhere. The text data generated in these practical problems of humanities research, financial industry, marketing, and other fields often has obvious domain characteristics, often containing the professional vocabulary and unique language patterns in these fields and often accompanied by a variety of "noise." Dealing with such texts is a great challenge for the current technical conditions, especially for Chinese texts. A clustering algorithm provides a better solution for text big data information processing. Clustering algorithm is the main body of cluster analysis, K-means algorithm with its implementation principle is simple, low time complexity is widely used in the field of cluster analysis, but its K value needs to be preset, initial clustering center random selection into local optimal solution, other clustering algorithm, such as mean drift clustering, K-means clustering in mining text big data. In view of the problems of the above algorithm, this paper first extracts and analyzes the text big data and then does experiments with the clustering algorithm. Experimental conclusion: by analyzing large-scale text data limited to large-scale and simple data set, the traditional K-means algorithm has low efficiency and reduced accuracy, and the K-means algorithm is susceptible to the influence of initial center and abnormal data. According to the above problems, the K-means cluster analysis algorithm for data sets with large data volumes is analyzed and improved to improve its execution efficiency and accuracy on data sets with large data volume set. Mean shift clustering can be regarded as making many random centers move towards the direction of maximum density gradually, that is, moving their mean centroid continuously according to the probability density of data and finally obtaining multiple maximum density centers. It can also be said that mean shift clustering is a kernel density estimation algorithm.

A Review on the Rule-Based Filtering Structure with Applications on Computational Biomedical Images

In this paper, we present rule-based fuzzy inference systems that consist of a series of mathematical representations based on fuzzy concepts in the filtering structure. It is crucial for understanding and discussing different principles associated with fuzzy filter design procedures. A number of typical fuzzy multichannel filtering approaches are provided in order to clarify the different fuzzy filter designs and compare different algorithms. In particular, in most practical applications (i.e., biomedical image analysis), the emphasis is placed primarily on fuzzy filtering algorithms, with the main advantages of restoration of corrupted medical images and the interpretation capability, along with the capability of edge preservation and relevant image information for accurate diagnosis of diseases.

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.

Brain tissue segmentation using improved kernelized rough-fuzzy C-means with spatio-contextual information from MRI

Segmentation of brain tissues from MRI often becomes crucial to properly investigate any region of the brain in order to detect abnormalities. However, the accurate segmentation of the brain tissues is a challenging task as the different tissue regions are usually imprecise, indiscernible, ambiguous, and overlapping. Additionally, different tissue regions are non-linearly separable. Noises and other artifacts may also present in the brain MRI. Therefore, conventional segmentation techniques may not often achieve desired accuracy. To deal those challenges, a robust kernelized rough fuzzy C-means clustering with spatial constraints (KRFCMSC) is proposed in this article for brain tissue segmentation. Here, the brain tissue segmentation from MRI is considered as a clustering of pixels problem. The basic idea behind the proposed technique is the judicious integration of the fuzzy set, rough set, and kernel trick along with spatial constraints (in the form of contextual information) to increase the clustering (segmentation) performance. The use of rough and fuzzy set theory in the clustering process handles the ambiguity, indiscernibility, vagueness and overlappingness of different brain tissue regions. While, the kernel trick increases the chance of linear separability of the complex regions which are otherwise not linearly separable in its original feature space. In order to deal the noisy pixels, here in the clustering process, the spatio-contextual information is introduced from the neighbouring pixels. Experiments are carried out on different real and synthetic benchmark brain MRI datasets (publicly available from Brainweb, and IBSR) without and with added noise. The performance of the proposed method is compared with five other counterpart clustering based segmentation techniques and evaluated using various supervised as well as unsupervised validity indices such as, overall accuracy, precision, recall, kappa, Jaccard, dice, and kernelized Xie-Beni index. Experimental results justify the superiority and robustness of the proposed method over other state-of-the-art methods on both benchmark real life and synthetic brain MRI datasets with and without added noise. Statistical significance of the better segmentation accuracy can be confirmed from the paired t-test results in favour of the proposed method compared to other counterpart methods.

Brain Tissue Segmentation and Bias Field Correction of MR Image Based on Spatially Coherent FCM with Nonlocal Constraints

Influenced by poor radio frequency field uniformity and gradient-driven eddy currents, intensity inhomogeneity (or bias field) and noise appear in brain magnetic resonance (MR) image. However, some traditional fuzzy c-means clustering algorithms with local spatial constraints often cannot obtain satisfactory segmentation performance. Therefore, an objective function based on spatial coherence for brain MR image segmentation and intensity inhomogeneity correction simultaneously is constructed in this paper. First, a novel similarity measure including local neighboring information is designed to improve the separability of MR data in Gaussian kernel mapping space without image smoothing, and the similarity measure incorporates the spatial distance and grayscale difference between cluster centroid and its neighborhood pixels. Second, the objective function with an adaptive nonlocal spatial regularization term is drawn upon to compensate the drawback of the local spatial information. Meanwhile, bias field information is also embedded into the similarity measure of clustering algorithm. From the comparison between the proposed algorithm and the state-of-the-art methods, our model is more robust to noise in the brain magnetic resonance image, and the bias field is also effectively estimated.

Is Intensity Inhomogeneity Correction Useful for Classification of Breast Cancer in Sonograms Using Deep Neural Network?

The sonogram is currently an effective cancer screening and diagnosis way due to the convenience and harmlessness in humans. Traditionally, lesion boundary segmentation is first adopted and then classification is conducted, to reach the judgment of benign or malignant tumor. In addition, sonograms often contain much speckle noise and intensity inhomogeneity. This study proposes a novel benign or malignant tumor classification system, which comprises intensity inhomogeneity correction and stacked denoising autoencoder (SDAE), and it is suitable for small-size dataset. A classifier is established by extracting features in the multilayer training of SDAE; automatic analysis of imaging features by the deep learning algorithm is applied on image classification, thus allowing the system to have high efficiency and robust distinguishing. In this study, two kinds of dataset (private data and public data) are used for deep learning models training. For each dataset, two groups of test images are compared: the original images and the images after intensity inhomogeneity correction, respectively. The results show that when deep learning algorithm is applied on the sonograms after intensity inhomogeneity correction, there is a significant increase of the tumor distinguishing accuracy. This study demonstrated that it is important to use preprocessing to highlight the image features and further give these features for deep learning models. In this way, the classification accuracy will be better to just use the original images for deep learning.

Automatic quantification of choroidal neovascularization lesion area on OCT angiography based on density cell-like P systems with active membranes

Detecting and quantifying the size of choroidal neovascularization (CNV) is important for the diagnosis and assessment of neovascular age-related macular degeneration. Depth-resolved imaging of the retinal and choroidal vasculature by optical coherence tomography angiography (OCTA) has enabled the visualization of CNV. However, due to the prevalence of artifacts, it is difficult to segment and quantify the CNV lesion area automatically. We have previously described a saliency algorithm for CNV detection that could identify a CNV lesion area with 83% accuracy. However, this method works under the assumption that the CNV region is the most salient area for visual attention in the whole image and consequently, errors occur when this requirement is not met (e.g. when the lesion occupies a large portion of the image). Moreover, saliency image processing methods cannot extract the edges of the salient object very accurately. In this paper, we propose a novel and automatic CNV segmentation method based on an unsupervised and parallel machine learning technique named density cell-like P systems (DEC P systems). DEC P systems integrate the idea of a modified clustering algorithm into cell-like P systems. This method improved the accuracy of detection to 87.2% on 22 subjects and obtained clear boundaries of the CNV lesions.

KL Divergence-Based Fuzzy Cluster Ensemble for Image Segmentation

Ensemble clustering combines different basic partitions of a dataset into a more stable and robust one. Thus, cluster ensemble plays a significant role in applications like image segmentation. However, existing ensemble methods have a few demerits, including the lack of diversity of basic partitions and the low accuracy caused by data noise. In this paper, to get over these difficulties, we propose an efficient fuzzy cluster ensemble method based on Kullback-Leibler divergence or simply, the KL divergence. The data are first classified with distinct fuzzy clustering methods. Then, the soft clustering results are aggregated by a fuzzy KL divergence-based objective function. Moreover, for image segmentation problems, we utilize the local spatial information in the cluster ensemble algorithm to suppress the effect of noise. Experiment results reveal that the proposed methods outperform many other methods in synthetic and real image-segmentation problems.

Imaging and machine learning techniques for diagnosis of Alzheimer's disease

Alzheimer's disease (AD) is a common health problem in elderly people. There has been considerable research toward the diagnosis and early detection of this disease in the past decade. The sensitivity of biomarkers and the accuracy of the detection techniques have been defined to be the key to an accurate diagnosis. This paper presents a state-of-the-art review of the research performed on the diagnosis of AD based on imaging and machine learning techniques. Different segmentation and machine learning techniques used for the diagnosis of AD are reviewed including thresholding, supervised and unsupervised learning, probabilistic techniques, Atlas-based approaches, and fusion of different image modalities. More recent and powerful classification techniques such as the enhanced probabilistic neural network of Ahmadlou and Adeli should be investigated with the goal of improving the diagnosis accuracy. A combination of different image modalities can help improve the diagnosis accuracy rate. Research is needed on the combination of modalities to discover multi-modal biomarkers.

A Cooperative Learning-Based Clustering Approach to Lip Segmentation Without Knowing Segment Number

It is usually hard to predetermine the true number of segments in lip segmentation. This paper, therefore, presents a clustering-based approach to lip segmentation without knowing the true segment number. The objective function in the proposed approach is a variant of the partition entropy (PE) and features that the coincident cluster centroids in pattern space can be equivalently substituted by one centroid with the function value unchanged. It is shown that the minimum of the proposed objective function can be reached provided that: 1) the number of positions occupied by cluster centroids in pattern space is equal to the true number of clusters and 2) these positions are coincident with the optimal cluster centroids obtained under PE criterion. In implementation, we first randomly initialize the clusters provided that the number of clusters is greater than or equal to the ground truth. Then, an iterative algorithm is utilized to minimize the proposed objective function. For each iterative step, not only is the winner, i.e., the centroid with the maximum membership degree, updated to adapt to the corresponding input data, but also the other centroids are adjusted with a specific cooperation strength, so that they are each close to the winner. Subsequently, the initial overpartition will be gradually faded out with the redundant centroids superposed over the convergence of the algorithm. Based upon the proposed algorithm, we present a lip segmentation scheme. Empirical studies have shown its efficacy in comparison with the existing methods.

MR image segmentation and bias field estimation based on coherent local intensity clustering with total variation regularization

Though numerous segmentation algorithms have been proposed to segment brain tissue from magnetic resonance (MR) images, few of them consider combining the tissue segmentation and bias field correction into a unified framework while simultaneously removing the noise. In this paper, we present a new unified MR image segmentation algorithm whereby tissue segmentation, bias correction and noise reduction are integrated within the same energy model. Our method is presented by a total variation term introduced to the coherent local intensity clustering criterion function. To solve the nonconvex problem with respect to membership functions, we add auxiliary variables in the energy function such as Chambolle's fast dual projection method can be used and the optimal segmentation and bias field estimation can be achieved simultaneously throughout the reciprocal iteration. Experimental results show that the proposed method has a salient advantage over the other three baseline methods on either tissue segmentation or bias correction, and the noise is significantly reduced via its applications on highly noise-corrupted images. Moreover, benefiting from the fast convergence of the proposed solution, our method is less time-consuming and robust to parameter setting.

3D multimodal spatial fuzzy segmentation of intramuscular connective and adipose tissue from ultrashort TE MR images of calf muscle

PURPOSE

To develop and evaluate an automated algorithm to segment intramuscular adipose (IMAT) and connective (IMCT) tissue from musculoskeletal MRI images acquired with a dual echo Ultrashort TE (UTE) sequence.

THEORY AND METHODS

The dual echo images and calculated structure tensor images are the inputs to the multichannel fuzzy cluster mean (MCFCM) algorithm. Modifications to the basic multichannel fuzzy cluster mean include an adaptive spatial term and bias shading correction. The algorithm was tested on digital phantoms simulating IMAT/IMCT tissue under varying conditions of image noise and bias and on ten subjects with varying amounts of IMAT/IMCT.

RESULTS

The MCFCM including the adaptive spatial term and bias shading correction performed better than the original MCFCM and adaptive spatial MCFCM algorithms. IMAT/IMCT was segmented from the unsmoothed simulated phantom data with a mean Dice coefficient of 0.933 ±0.001 when contrast-to-noise (CNR) was 140 and bias was varied between 30% and 65%. The algorithm yielded accurate in vivo segmentations of IMAT/IMCT with a mean Dice coefficient of 0.977 ±0.066.

CONCLUSION

The proposed algorithm is completely automated and yielded accurate segmentation of intramuscular adipose and connective tissue in the digital phantom and in human calf data. Magn Reson Med 77:870-883, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Improved R2* liver iron concentration assessment using a novel fuzzy c-mean clustering scheme

BACKGROUND

In thalassemia patients, R2* liver iron concentration (LIC) measurement is a common clinical tool for assessing iron overload and for determining necessary chelator dose and evaluating its efficacy. Despite the importance of accurate LIC measurement, existing methods suffer from LIC variability, especially at the severe iron overload range due to inclusion of vessel parts in LIC calculation. In this study, we build upon previous Fuzzy C-Mean (FCM) clustering work to formulate a scheme with superior performance in segmenting vessel pixels from the parenchyma. Our method (MIX-FCM) combines our novel 2D-FCM with the existing 1D-FCM algorithm. This study further assessed possible optimal clustering parameters (OP scheme) and proposed a semi-automatic (SA) scheme for routine clinical application.

METHODS

Segmentation of liver parenchyma and vessels was performed on T2* images and their LIC maps in 196 studies from 147 thalassemia major patients. We used manual segmentation as the reference. 1D-FCM clustering was performed on the acquired image alone and 2D-FCM used both the acquired image and its LIC data. To execute the MIX-FCM method, the best outcome (OP-MIX-FCM) was selected from the aforementioned methods and was compared to the SA-MIX-FCM scheme. We used the percent value of the normalized interquartile range (nIQR) to its median to evaluate the variability of all methods.

RESULTS

2D-FCM clustering is more effective than 1D-FCM clustering at the severe overload range only, but inferior for other ranges (where 1D-FCM provides suitable results). This complementary performance between the two methods allows MIX-FCM to improve results for all ranges. OP-MIX-FCM clustering error was 2.1 ± 2.3%, compared with 10.3 ± 9.9% and 7.0 ± 11.9% from 1D- and 2D-FCM clustering, respectively. SA-MIX-FCM result was comparable to OP-MIX-FCM result, with both schemes showing ability to decrease overall nIQR by approximately 30%.

CONCLUSION

Our proposed 2D-FCM algorithm is not as superior to 1D-FCM as hypothesized. In contrast, our MIX-FCM method benefits from the best of both methods to obtain the highest segmentation accuracy at all ranges. Moreover, segmentation accuracy of the practical scheme (SA-MIX-FCM) is comparable to segmentation accuracy of the reference scheme (OP-MIX-FCM). Finally, we confirmed that segmentation is crucial to improving LIC assessments, especially at the severe iron overload range.

Lip segmentation under MAP-MRF framework with automatic selection of local observation scale and number of segments

This paper addresses the problem of segmenting lip region from frontal human face image. Supposing each pixel of the target image has an optimal local scale from the segmentation viewpoint, we treat the lip segmentation problem as a combination of observation scale selection and observed data classification. Accordingly, we propose a hierarchical multiscale Markov random field (MRF) model to represent the membership map of each input pixel to a specific segment and local-scale map simultaneously. Subsequently, lip segmentation can be formulated as an optimal problem in the maximum a posteriori (MAP)-MRF framework. Then, we present a rival-penalized iterative algorithm to implement the segmentation, which is independent of the number of predefined segments. The proposed method mainly features two aspects: 1) its performance is independent of the predefined number of segments, and 2) it takes into account the local optimal observation scale for each pixel. Finally, we conduct the experiments on four benchmark databases, i.e. AR, CVL, GTAV, and VidTIMIT. Experimental results show that the proposed method is robust to the segment number that changes with a speaker's appearance, and can enhance the segmentation accuracy by taking advantage of the local optimal observation scale information.

Localized FCM Clustering with Spatial Information for Medical Image Segmentation and Bias Field Estimation

This paper presents a novel fuzzy energy minimization method for simultaneous segmentation and bias field estimation of medical images. We first define an objective function based on a localized fuzzy c-means (FCM) clustering for the image intensities in a neighborhood around each point. Then, this objective function is integrated with respect to the neighborhood center over the entire image domain to formulate a global fuzzy energy, which depends on membership functions, a bias field that accounts for the intensity inhomogeneity, and the constants that approximate the true intensities of the corresponding tissues. Therefore, segmentation and bias field estimation are simultaneously achieved by minimizing the global fuzzy energy. Besides, to reduce the impact of noise, the proposed algorithm incorporates spatial information into the membership function using the spatial function which is the summation of the membership functions in the neighborhood of each pixel under consideration. Experimental results on synthetic and real images are given to demonstrate the desirable performance of the proposed algorithm.

Measurements of total and regional body composition in preschool children: A comparison of MRI, DXA, and anthropometric data

OBJECTIVE

There are clear sex differences in the distribution of visceral adipose tissue (VAT) and subcutaneous adipose tissue (SAT) in adults, with males having more VAT and less SAT than females. This study assessed whether these differences between the sexes were already present in preschool children. It also evaluated which measures of body composition were most appropriate for assessing abdominal obesity in this age group.

DESIGN AND METHODS

One-hundred and five children (57 boys and 48 girls) participated in the study. Body composition was measured using dual-energy X-ray absorptiometry (DXA). Weight, height, and waist circumference (WC) were also recorded. Magnetic resonance imaging (MRI) of the entire abdomen using sixteen 10-mm-thick T1 -weighted slices was performed in a subgroup of 48 children (30 boys and 18 girls); SAT and VAT volumes were measured using semiautomated segmentation.

RESULTS

Boys had significantly more VAT than girls (0.17 versus 0.10 l, P < 0.001). Results showed that VAT correlated significantly with all measurements of anthropometry (P < 0.01) after adjusting for SAT and for total fat mass measured with DXA. The mean limits of agreement between DXA and MRI regarding truncal FM were calculated to be -11.4 (range -17.8 to -3.6), using a Bland-Altman plot.

CONCLUSION

Sex differences in adipose tissue distribution are apparent at an early age. MRI is the best method with which to study abdominal fat distribution in young children.

Generalized rough fuzzy c-means algorithm for brain MR image segmentation

Fuzzy sets and rough sets have been widely used in many clustering algorithms for medical image segmentation, and have recently been combined together to better deal with the uncertainty implied in observed image data. Despite of their wide spread applications, traditional hybrid approaches are sensitive to the empirical weighting parameters and random initialization, and hence may produce less accurate results. In this paper, a novel hybrid clustering approach, namely the generalized rough fuzzy c-means (GRFCM) algorithm is proposed for brain MR image segmentation. In this algorithm, each cluster is characterized by three automatically determined rough-fuzzy regions, and accordingly the membership of each pixel is estimated with respect to the region it locates. The importance of each region is balanced by a weighting parameter, and the bias field in MR images is modeled by a linear combination of orthogonal polynomials. The weighting parameter estimation and bias field correction have been incorporated into the iterative clustering process. Our algorithm has been compared to the existing rough c-means and hybrid clustering algorithms in both synthetic and clinical brain MR images. Experimental results demonstrate that the proposed algorithm is more robust to the initialization, noise, and bias field, and can produce more accurate and reliable segmentations.

Efficient inhomogeneity compensation using fuzzy c-means clustering models

Intensity inhomogeneity or intensity non-uniformity (INU) is an undesired phenomenon that represents the main obstacle for magnetic resonance (MR) image segmentation and registration methods. Various techniques have been proposed to eliminate or compensate the INU, most of which are embedded into classification or clustering algorithms, they generally have difficulties when INU reaches high amplitudes and usually suffer from high computational load. This study reformulates the design of c-means clustering based INU compensation techniques by identifying and separating those globally working computationally costly operations that can be applied to gray intensity levels instead of individual pixels. The theoretical assumptions are demonstrated using the fuzzy c-means algorithm, but the proposed modification is compatible with a various range of c-means clustering based INU compensation and MR image segmentation algorithms. Experiments carried out using synthetic phantoms and real MR images indicate that the proposed approach produces practically the same segmentation accuracy as the conventional formulation, but 20-30 times faster.