Federated Fuzzy Clustering for Decentralized Incomplete Longitudinal Behavioral Data

The use of medical data for machine learning, including unsupervised methods such as clustering, is often restricted by privacy regulations such as the Health Insurance Portability and Accountability Act (HIPAA). Medical data is sensitive and highly regulated and anonymization is often insufficient to protect a patient's identity. Traditional clustering algorithms are also unsuitable for longitudinal behavioral health trials, which often have missing data and observe individual behaviors over varying time periods. In this work, we develop a new decentralized federated multiple imputation-based fuzzy clustering algorithm for complex longitudinal behavioral trial data collected from multisite randomized controlled trials over different time periods. Federated learning (FL) preserves privacy by aggregating model parameters instead of data. Unlike previous FL methods, this proposed algorithm requires only two rounds of communication and handles clients with varying numbers of time points for incomplete longitudinal data. The model is evaluated on both empirical longitudinal dietary health data and simulated clusters with different numbers of clients, effect sizes, correlations, and sample sizes. The proposed algorithm converges rapidly and achieves desirable performance on multiple clustering metrics. This new method allows for targeted treatments for various patient groups while preserving their data privacy and enables the potential for broader applications in the Internet of Medical Things.

Fuzzy Clustering-Based Deep Learning for Short-Term Load Forecasting in Power Grid Systems Using Time-Varying and Time-Invariant Features

Accurate short-term load forecasting (STLF) is essential for power grid systems to ensure reliability, security and cost efficiency. Thanks to advanced smart sensor technologies, time-series data related to power load can be captured for STLF. Recent research shows that deep neural networks (DNNs) are capable of achieving accurate STLP since they are effective in predicting nonlinear and complicated time-series data. To perform STLP, existing DNNs use time-varying dynamics of either past load consumption or past power correlated features such as weather, meteorology or date. However, the existing DNN approaches do not use the time-invariant features of users, such as building spaces, ages, isolation material, number of building floors or building purposes, to enhance STLF. In fact, those time-invariant features are correlated to user load consumption. Integrating time-invariant features enhances STLF. In this paper, a fuzzy clustering-based DNN is proposed by using both time-varying and time-invariant features to perform STLF. The fuzzy clustering first groups users with similar time-invariant behaviours. DNN models are then developed using past time-varying features. Since the time-invariant features have already been learned by the fuzzy clustering, the DNN model does not need to learn the time-invariant features; therefore, a simpler DNN model can be generated. In addition, the DNN model only learns the time-varying features of users in the same cluster; a more effective learning can be performed by the DNN and more accurate predictions can be achieved. The performance of the proposed fuzzy clustering-based DNN is evaluated by performing STLF, where both time-varying features and time-invariant features are included. Experimental results show that the proposed fuzzy clustering-based DNN outperforms the commonly used long short-term memory networks and convolution neural networks.

Explainable fuzzy clustering framework reveals divergent default mode network connectivity dynamics in schizophrenia

Introduction

Dynamic functional network connectivity (dFNC) analysis of resting state functional magnetic resonance imaging data has yielded insights into many neurological and neuropsychiatric disorders. A common dFNC analysis approach uses hard clustering methods like k-means clustering to assign samples to states that summarize network dynamics. However, hard clustering methods obscure network dynamics by assuming (1) that all samples within a cluster are equally like their assigned centroids and (2) that samples closer to one another in the data space than to their centroids are well-represented by their centroids. In addition, it can be hard to compare subjects, as in some cases an individual may not manifest a state strongly enough to enter a hard cluster. Approaches that allow a dimensional approach to connectivity patterns (e.g., fuzzy clustering) can mitigate these issues. In this study, we present an explainable fuzzy clustering framework by combining fuzzy c-means clustering with several explainability metrics and novel summary features.

Methods

We apply our framework for schizophrenia (SZ) default mode network analysis. Namely, we extract dFNC from individuals with SZ and controls, identify 5 dFNC states, and characterize the dFNC features most crucial to those states with a new perturbation-based clustering explainability approach. We then extract several features typically used in hard clustering and further present a variety of unique features specially designed for use with fuzzy clustering to quantify state dynamics. We examine differences in those features between individuals with SZ and controls and further search for relationships between those features and SZ symptom severity.

Results

Importantly, we find that individuals with SZ spend more time in states of moderate anticorrelation between the anterior and posterior cingulate cortices and strong anticorrelation between the precuneus and anterior cingulate cortex. We further find that individuals with SZ tend to transition more rapidly than controls between low-magnitude and high-magnitude dFNC states.

Conclusion

We present a novel dFNC analysis framework and use it to identify effects of SZ upon network dynamics. Given the ease of implementing our framework and its enhanced insight into network dynamics, it has great potential for use in future dFNC studies.

scAMAC: self-supervised clustering of scRNA-seq data based on adaptive multi-scale autoencoder

Cluster assignment is vital to analyzing single-cell RNA sequencing (scRNA-seq) data to understand high-level biological processes. Deep learning-based clustering methods have recently been widely used in scRNA-seq data analysis. However, existing deep models often overlook the interconnections and interactions among network layers, leading to the loss of structural information within the network layers. Herein, we develop a new self-supervised clustering method based on an adaptive multi-scale autoencoder, called scAMAC. The self-supervised clustering network utilizes the Multi-Scale Attention mechanism to fuse the feature information from the encoder, hidden and decoder layers of the multi-scale autoencoder, which enables the exploration of cellular correlations within the same scale and captures deep features across different scales. The self-supervised clustering network calculates the membership matrix using the fused latent features and optimizes the clustering network based on the membership matrix. scAMAC employs an adaptive feedback mechanism to supervise the parameter updates of the multi-scale autoencoder, obtaining a more effective representation of cell features. scAMAC not only enables cell clustering but also performs data reconstruction through the decoding layer. Through extensive experiments, we demonstrate that scAMAC is superior to several advanced clustering and imputation methods in both data clustering and reconstruction. In addition, scAMAC is beneficial for downstream analysis, such as cell trajectory inference. Our scAMAC model codes are freely available at https://github.com/yancy2024/scAMAC.

A Novel Fuzzy-Based Remote Sensing Image Segmentation Method

Image segmentation is a well-known image processing task that consists of partitioning an image into homogeneous areas. It is applied to remotely sensed imagery for many problems such as land use classification and landscape changes. Recently, several hybrid remote sensing image segmentation techniques have been proposed that include metaheuristic approaches in order to increase the segmentation accuracy; however, the critical point of these approaches is the high computational complexity, which affects time and memory consumption. In order to overcome this criticality, we propose a fuzzy-based image segmentation framework implemented in a GIS-based platform for remotely sensed images; furthermore, the proposed model allows us to evaluate the reliability of the segmentation. The Fast Generalized Fuzzy c-means algorithm is implemented to segment images in order to detect local spatial relations between pixels and the Triple Center Relation validity index is used to find the optimal number of clusters. The framework elaborates the composite index to be analyzed starting by multiband remotely sensed images. For each cluster, a segmented image is obtained in which the pixel value represents, transformed into gray levels, the graph belonging to the cluster. A final thematic map is built in which the pixels are classified based on the assignment to the cluster to which they belong with the highest membership degree. In addition, the reliability of the classification is estimated by associating each class with the average of the membership degrees of the pixels assigned to it. The method was tested in the study area consisting of the south-western districts of the city of Naples (Italy) for the segmentation of composite indices maps determined by multiband remote sensing images. The segmentation results are consistent with the segmentations of the study area by morphological and urban characteristics, carried out by domain experts. The high computational speed of the proposed image segmentation method allows it to be applied to massive high-resolution remote sensing images.

A combined fuzzy backtracking search optimization algorithm to localize retinal blood vessels for diabetic retinopathy

For diabetic retinopathy (DR) surgery, localization of retinal blood vessels is of paramount importance. Fundus images which are often used for DR diagnosis suffer from poor contrast (between the retinal background and the blood vessels, due to its size) limits the diagnosis. In addition to this, various pathological changes in retinal blood vessels may also be observed for different diseases such as glaucoma and diabetes. To alleviate, in this paper, an automated unsupervised retinal blood vessel segmentation technique, based on backtracking search optimization algorithm (BSA), is proposed. The BSA method is used to optimize the local search of fuzzy c-means clustering (FCM) algorithm to find micro-diameter sized vessels along with coarse vessels. The proposed technique is tested on two publicly available retinal datasets (i.e., STARE and DRIVE) and verified using the dataset collected from various hospitals in Bangalore and Mangalore, India. The results show that the performance of the proposed method is comparable to the conventional techniques in terms of sensitivity, specificity, and accuracy.

Denoising adaptive deep clustering with self-attention mechanism on single-cell sequencing data

A large number of works have presented the single-cell RNA sequencing (scRNA-seq) to study the diversity and biological functions of cells at the single-cell level. Clustering identifies unknown cell types, which is essential for downstream analysis of scRNA-seq samples. However, the high dimensionality, high noise and pervasive dropout rate of scRNA-seq samples have a significant challenge to the cluster analysis of scRNA-seq samples. Herein, we propose a new adaptive fuzzy clustering model based on the denoising autoencoder and self-attention mechanism called the scDASFK. It implements the comparative learning to integrate cell similar information into the clustering method and uses a deep denoising network module to denoise the data. scDASFK consists of a self-attention mechanism for further denoising where an adaptive clustering optimization function for iterative clustering is implemented. In order to make the denoised latent features better reflect the cell structure, we introduce a new adaptive feedback mechanism to supervise the denoising process through the clustering results. Experiments on 16 real scRNA-seq datasets show that scDASFK performs well in terms of clustering accuracy, scalability and stability. Overall, scDASFK is an effective clustering model with great potential for scRNA-seq samples analysis. Our scDASFK model codes are freely available at https://github.com/LRX2022/scDASFK.

A Robust and High-Dimensional Clustering Algorithm Based on Feature Weight and Entropy

Since the Fuzzy C-Means algorithm is incapable of considering the influence of different features and exponential constraints on high-dimensional and complex data, a fuzzy clustering algorithm based on non-Euclidean distance combining feature weights and entropy weights is proposed. The proposed algorithm is based on the Fuzzy C-Means soft clustering algorithm to deal with high-dimensional and complex data. The objective function of the new algorithm is modified with the help of two different entropy terms and a non-Euclidean way of computing the distance. The distance calculation formula enhances the efficiency of extracting the contribution of different features. The first entropy term helps to minimize the clusters' dispersion and maximize the negative entropy to control the clustering process, which also promotes the association between the samples. The second entropy term helps to control the weights of features since different features have different weights in the clustering process. Experiments on real-world datasets indicate that the proposed algorithm gives better clustering results than other algorithms. The experiments demonstrate the proposed algorithm's robustness by analyzing the parameters' sensitivity and comparing the computational distance formulas. In summary, the improved algorithm improves classification performance under noisy interference and high-dimensional datasets, increases computational efficiency, performs well in real-world high-dimensional datasets, and encourages the development of robust noise-resistant high-dimensional fuzzy clustering algorithms.

Spatiotemporal Analysis of Black Carbon Sources: Case of Santiago, Chile, under SARS-CoV-2 Lockdowns

BACKGROUND

The SARS-CoV-2 pandemic has temporarily decreased black carbon emissions worldwide. The use of multi-wavelength aethalometers provides a quantitative apportionment of black carbon (BC) from fossil fuels (BC_ff) and wood-burning sources (BC_wb). However, this apportionment is aggregated: local and non-local BC sources are lumped together in the aethalometer results.

METHODS

We propose a spatiotemporal analysis of BC results along with meteorological data, using a fuzzy clustering approach, to resolve local and non-local BC contributions. We apply this methodology to BC measurements taken at an urban site in Santiago, Chile, from March through December 2020, including lockdown periods of different intensities.

RESULTS

BC_ff accounts for 85% of total BC; there was up to an 80% reduction in total BC during the most restrictive lockdowns (April-June); the reduction was 40-50% in periods with less restrictive lockdowns. The new methodology can apportion BC_ff and BC_wb into local and non-local contributions; local traffic (wood burning) sources account for 66% (86%) of BC_ff (BC_wb).

CONCLUSIONS

The intensive lockdowns brought down ambient BC across the city. The proposed fuzzy clustering methodology can resolve local and non-local contributions to BC in urban zones.

Assessment of Seasonal Stochastic Local Models for Glucose Prediction without Meal Size Information under Free-Living Conditions

Accurate blood glucose (BG) forecasting is key in diabetes management, as it allows preventive actions to mitigate harmful hypoglycemic/hyperglycemic episodes. Considering the encouraging results obtained by seasonal stochastic models in proof-of-concept studies, this work assesses the methodology in two datasets (open-loop and closed-loop) recorded in free-living conditions. First, similar postprandial glycemic profiles are grouped together with fuzzy C-means clustering. Then, a seasonal stochastic model is identified for each cluster. Finally, real-time BG forecasting is performed by weighting each model’s prediction. The proposed methodology (named C-SARIMA) is compared to other linear and nonlinear black-box methods: autoregressive integrated moving average (ARIMA), its variant with input (ARIMAX), a feed-forward neural network (NN), and its modified version (NN-X) fed by BG, insulin, and carbohydrates (timing and dosing) information for several prediction horizons (PHs). In the open-loop dataset, C-SARIMA grants a median root-mean-squared error (RMSE) of 20.13 mg/dL (PH = 30) and 27.23 mg/dL (PH = 45), not significantly different from ARIMA and NN. Over a longer PH, C-SARIMA achieves an RMSE = 31.96 mg/dL (PH = 60) and RMSE = 33.91 mg/dL (PH = 75), significantly outperforming the ARIMA and NN, without significant differences from the ARIMAX for PH ≥ 45 and the NN-X for PH ≥ 60. Similar results hold on the closed-loop dataset: for PH = 30 and 45 min, the C-SARIMA achieves an RMSE = 21.63 mg/dL and RMSE = 29.67 mg/dL, not significantly different from the ARIMA and NN. On longer PH, the C-SARIMA outperforms the ARIMA for PH > 45 and the NN for PH > 60 without significant differences from the ARIMAX for PH ≥ 45. Although using less input information, the C-SARIMA achieves similar performance to other prediction methods such as the ARIMAX and NN-X and outperforming the CGM-only approaches on PH > 45min.

ROI-Finder: machine learning to guide region-of-interest scanning for X-ray fluorescence microscopy

The microscopy research at the Bionanoprobe (currently at beamline 9-ID and later 2-ID after APS-U) of Argonne National Laboratory focuses on applying synchrotron X-ray fluorescence (XRF) techniques to obtain trace elemental mappings of cryogenic biological samples to gain insights about their role in critical biological activities. The elemental mappings and the morphological aspects of the biological samples, in this instance, the bacterium Escherichia coli (E. Coli), also serve as label-free biological fingerprints to identify E. coli cells that have been treated differently. The key limitations of achieving good identification performance are the extraction of cells from raw XRF measurements via binary conversion, definition of features, noise floor and proportion of cells treated differently in the measurement. Automating cell extraction from raw XRF measurements across different types of chemical treatment and the implementation of machine-learning models to distinguish cells from the background and their differing treatments are described. Principal components are calculated from domain knowledge specific features and clustered to distinguish healthy and poisoned cells from the background without manual annotation. The cells are ranked via fuzzy clustering to recommend regions of interest for automated experimentation. The effects of dwell time and the amount of data required on the usability of the software are also discussed.

Discrimination of Acoustic Stimuli and Maintenance of Graded Alarm Call Structure in Captive Meerkats

Simple Summary

Preserving natural behaviors has many advantages for both research and animal welfare. Natural behaviors include producing vocalizations and responding to them. If it can be shown that the natural vocal repertoire is preserved in zoos, studies in zoos may help to expand the knowledge of acoustic behaviors and transfer it to animals in the wild. Once the meaning of diverse vocalizations is known, inferences can be made about an animal’s internal state in order to adapt and improve conditions for animals in zoos. In this paper, a natural and selective response of meerkats to potentially threatening acoustic signals such as the call of a predator is demonstrated. It can be shown that both the graded structure of meerkat alarm calls, which serves to convey the urgency of a dangerous situation, and the natural response to alarm calls are preserved. The obtained findings allow a continuation of the bioacoustic studies known for wild meerkats in zoos. The meerkat’s ability to already recognize acoustic signals as a potential threat may be crucial information for certain husbandry conditions. Vocalizing predators kept or naturally occurring near the meerkat enclosure form one example. The level of stress induced by potential threats and the associated alertness could be determined by using the graded alarm calls as a tool.

Abstract

Animals living in human care for several generations face the risk of losing natural behaviors, which can lead to reduced animal welfare. The goal of this study is to demonstrate that meerkats (Suricata suricatta) living in zoos can assess potential danger and respond naturally based on acoustic signals only. This includes that the graded information of urgency in alarm calls as well as a response to those alarm calls is retained in captivity. To test the response to acoustic signals with different threat potential, meerkats were played calls of various animals differing in size and threat (e.g., robin, raven, buzzard, jackal) while their behavior was observed. The emitted alarm calls were recorded and examined for their graded structure on the one hand and played back to them on the other hand by means of a playback experiment to see whether the animals react to their own alarm calls even in the absence of danger. A fuzzy clustering algorithm was used to analyze and classify the alarm calls. Subsequently, the features that best described the graded structure were isolated using the LASSO algorithm and compared to features already known from wild meerkats. The results show that the graded structure is maintained in captivity and can be described by features such as noise and duration. The animals respond to new threats and can distinguish animal calls that are dangerous to them from those that are not, indicating the preservation of natural cooperative behavior. In addition, the playback experiments show that the meerkats respond to their own alarm calls with vigilance and escape behavior. The findings can be used to draw conclusions about the intensity of alertness in captive meerkats and to adapt husbandry conditions to appropriate welfare.

Sensor Selection Framework for Designing Fault Diagnostics System

In a world of rapidly changing technologies, reliance on complex engineered systems has become substantial. Interactions associated with such systems as well as associated manufacturing processes also continue to evolve and grow in complexity. Consider how the complexity of manufacturing processes makes engineered systems vulnerable to cascading and escalating failures; truly a highly complex and evolving system of systems. Maintaining quality and reliability requires considerations during product development, manufacturing processes, and more. Monitoring the health of the complex system while in operation/use is imperative. These considerations have compelled designers to explore fault-mechanism models and to develop corresponding countermeasures. Increasingly, there has been a reliance on embedded sensors to aid in prognosticating failures, to reduce downtime, during manufacture and system operation. However, the accuracy of estimating the remaining useful life of the system is highly dependent on the quality of the data obtained. This can be enhanced by increasing the number of sensors used, according to information theory. However, adding sensors increases total costs with the cost of the sensors and the costs associated with information-gathering procedures. Determining the optimal number of sensors, associated operating and data acquisition costs, and sensor-configuration are nontrivial. It is also imperative to avoid redundant information due to the presence of additional sensors and the efficient display of information to the decision-maker. Therefore, it is necessary to select a subset of sensors that not only reduce the cost but are also informative. While progress has been made in the sensor selection process, it is limited to either the type of the sensor, number of sensors or both. Such approaches do not address specifications of the required sensors which are integral to the sensor selection process. This paper addresses these shortcomings through a new method, OFCCaTS, to avoid the increased cost associated with health monitoring and to improve its accuracy. The proposed method utilizes a scalable multi-objective framework for sensor selection to maximize fault detection rate while minimizing the total cost of sensors. A wind turbine gearbox is considered to demonstrate the efficacy of the proposed framework.

Fuzzy System Based Medical Image Processing for Brain Disease Prediction

The present work aims to explore the performance of fuzzy system-based medical image processing for predicting the brain disease. The imaging mechanism of NMR (Nuclear Magnetic Resonance) and the complexity of human brain tissues cause the brain MRI (Magnetic Resonance Imaging) images to present varying degrees of noise, weak boundaries, and artifacts. Hence, improvements are made over the fuzzy clustering algorithm. A brain image processing and brain disease diagnosis prediction model is designed based on improved fuzzy clustering and HPU-Net (Hybrid Pyramid U-Net Model for Brain Tumor Segmentation) to ensure the model safety performance. Brain MRI images collected from a Hospital, are employed in simulation experiments to validate the performance of the proposed algorithm. Moreover, CNN (Convolutional Neural Network), RNN (Recurrent Neural Network), FCM (Fuzzy C-Means), LDCFCM (Local Density Clustering Fuzzy C-Means), and AFCM (Adaptive Fuzzy C-Means) are included in simulation experiments for performance comparison. Results demonstrate that the proposed algorithm has more nodes, lower energy consumption, and more stable changes than other models under the same conditions. Regarding the overall network performance, the proposed algorithm can complete the data transmission tasks the fastest, basically maintaining at about 4.5 s on average, which performs remarkably better than other models. A further prediction performance analysis reveals that the proposed algorithm provides the highest prediction accuracy for the Whole Tumor under DSC (Dice Similarity Coefficient), reaching 0.936. Besides, its Jaccard coefficient is 0.845, proving its superior segmentation accuracy over other models. In a word, the proposed algorithm can provide higher accuracy, a more apparent denoising effect, and the best segmentation and recognition effect than other models while ensuring energy consumption. The results can provide an experimental basis for the feature recognition and predictive diagnosis of brain images.

A Pupil Segmentation Algorithm Based on Fuzzy Clustering of Distributed Information

Pupil segmentation is critical for line-of-sight estimation based on the pupil center method. Due to noise and individual differences in human eyes, the quality of eye images often varies, making pupil segmentation difficult. In this paper, we propose a pupil segmentation method based on fuzzy clustering of distributed information, which first preprocesses the original eye image to remove features such as eyebrows and shadows and highlight the pupil area; then the Gaussian model is introduced into global distribution information to enhance the classification fuzzy affiliation for the local neighborhood, and an adaptive local window filter that fuses local spatial and intensity information is proposed to suppress the noise in the image and preserve the edge information of the pupil details. Finally, the intensity histogram of the filtered image is used for fast clustering to obtain the clustering center of the pupil, and this binarization process is used to segment the pupil for the next pupil localization. Experimental results show that the method has high segmentation accuracy, sensitivity, and specificity. It can accurately segment the pupil when there are interference factors such as light spots, light reflection, and contrast difference at the edge of the pupil, which is an important contribution to improving the stability and accuracy of the line-of-sight tracking.

Noise-insensitive discriminative subspace fuzzy clustering

Discriminative subspace clustering (DSC) can make full use of linear discriminant analysis (LDA) to reduce the dimension of data and achieve effective clustering high-dimension data by clustering low-dimension data in discriminant subspace. However, most existing DSC algorithms do not consider the noise and outliers that may be contained in data sets, and when they are applied to the data sets with noise or outliers, and they often obtain poor performance due to the influence of noise and outliers. In this paper, we address the problem of the sensitivity of DSC to noise and outlier. Replacing the Euclidean distance in the objective function of LDA by an exponential non-Euclidean distance, we first develop a noise-insensitive LDA (NILDA) algorithm. Then, combining the proposed NILDA and a noise-insensitive fuzzy clustering algorithm: AFKM, we propose a noise-insensitive discriminative subspace fuzzy clustering (NIDSFC) algorithm. Experiments on some benchmark data sets show the effectiveness of the proposed NIDSFC algorithm.

Fuzzy Entropy-Based Spatial Hotspot Reliability

Cluster techniques are used in hotspot spatial analysis to detect hotspots as areas on the map; an extension of the Fuzzy C-means that the clustering algorithm has been applied to locate hotspots on the map as circular areas; it represents a good trade-off between the accuracy in the detection of the hotspot shape and the computational complexity. However, this method does not measure the reliability of the detected hotspots and therefore does not allow us to evaluate how reliable the identification of a hotspot of a circular area corresponding to the detected cluster is; a measure of the reliability of hotspots is crucial for the decision maker to assess the need for action on the area circumscribed by the hotspots. We propose a method based on the use of De Luca and Termini’s Fuzzy Entropy that uses this extension of the Fuzzy C-means algorithm and measures the reliability of detected hotspots. We test our method in a disease analysis problem in which hotspots corresponding to areas where most oto-laryngo-pharyngeal patients reside, within a geographical area constituted by the province of Naples, Italy, are detected as circular areas. The results show a dependency between the reliability and fluctuation of the values of the degrees of belonging to the hotspots.

A Novel Approach to Image Recoloring for Color Vision Deficiency

In this paper, a novel method to modify color images for the protanopia and deuteranopia color vision deficiencies is proposed. The method admits certain criteria, such as preserving image naturalness and color contrast enhancement. Four modules are employed in the process. First, fuzzy clustering-based color segmentation extracts key colors (which are the cluster centers) of the input image. Second, the key colors are mapped onto the CIE 1931 chromaticity diagram. Then, using the concept of confusion line (i.e., loci of colors confused by the color-blind), a sophisticated mechanism translates (i.e., removes) key colors lying on the same confusion line to different confusion lines so that they can be discriminated by the color-blind. In the third module, the key colors are further adapted by optimizing a regularized objective function that combines the aforementioned criteria. Fourth, the recolored image is obtained by color transfer that involves the adapted key colors and the associated fuzzy clusters. Three related methods are compared with the proposed one, using two performance indices, and evaluated by several experiments over 195 natural images and six digitized art paintings. The main outcomes of the comparative analysis are as follows. (a) Quantitative evaluation based on nonparametric statistical analysis is conducted by comparing the proposed method to each one of the other three methods for protanopia and deuteranopia, and for each index. In most of the comparisons, the Bonferroni adjusted p-values are <0.015, favoring the superiority of the proposed method. (b) Qualitative evaluation verifies the aesthetic appearance of the recolored images.

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.

Somatic cell count in buffalo milk using fuzzy clustering and image processing techniques

This research communication presents an automatic method for the counting of somatic cells in buffalo milk, which includes the application of a fuzzy clustering method and image processing techniques (somatic cell count with fuzzy clustering and image processing|, SCCFCI). Somatic cell count (SCC) in milk is the main biomarker for assessing milk quality and it is traditionally performed by exhaustive methods consisting of the visual observation of cells in milk smears through a microscope, which generates uncertainties associated with human interpretation. Unlike other similar works, the proposed method applies the Fuzzy C-Means (FCM) method as a preprocessing step in order to separate the images (objects) of the cells into clusters according to the color intensity. This contributes signficantly to the performance of the subsequent processing steps (thresholding, segmentation and recognition/identification). Two methods of thresholding were evaluated and the Watershed Transform was used for the identification and separation of nearby cells. A detailed statistical analysis of the results showed that the SCCFCI method is able to provide results which are consistent with those obtained by conventional counting. This method therefore represents a viable alternative for quality control in buffalo milk production.

Segmentation of corpus callosum based on tensor fuzzy clustering algorithm

BACKGROUND

The corpus callosum in the midsagittal plane plays a crucial role in the early diagnosis of diseases. When the anisotropy of the diffusion tensor in the midsagittal plane is calculated, the anisotropy of corpus callosum is close to that of the fornix, which leads to blurred boundary of the segmentation region.

OBJECTIVE

To apply a fuzzy clustering algorithm combined with new spatial information to achieve accurate segmentation of the corpus callosum in the midsagittal plane in diffusion tensor images.

METHODS

In this algorithm, a fixed region of interest is selected from the midsagittal plane, and the anisotropic filtering algorithm based on tensor is implemented by replacing the gradient direction of the structural tensor with an eigenvector, thus filtering the diffusion tensor of region of interest. Then, the iterative clustering center based on K-means clustering is used as the initial clustering center of tensor fuzzy clustering algorithm. Taking filtered diffusion tensor as input data and different metrics as similarity measures, the neighborhood diffusion tensor voxel calculation method of Log Euclidean framework is introduced in the membership function calculation, and tensor fuzzy clustering algorithm is proposed. In this study, MGH35 data from the Human Connectome Project (HCP) are tested and the variance, accuracy and specificity of the experimental results are discussed.

RESULTS

Segmentation results of three groups of subjects in MGH35 data are reported. The average segmentation accuracy is 97.34%, and the average specificity is 98.43%.

CONCLUSIONS

When segmenting the corpus callosum of diffusion tensor imaging, our method cannot only effective denoise images, but also achieve high accuracy and specificity.

A Fast Segmentation Method for Fire Forest Images Based on Multiscale Transform and PCA

Forests provide various important things to human life. Fire is one of the main disasters in the world. Nowadays, the forest fire incidences endanger the ecosystem and destroy the native flora and fauna. This affects individual life, community and wildlife. Thus, it is essential to monitor and protect the forests and their assets. Nowadays, image processing outputs a lot of required information and measures for the implementation of advanced forest fire-fighting strategies. This work addresses a new color image segmentation method based on principal component analysis (PCA) and Gabor filter responses. Our method introduces a new superpixels extraction strategy that takes full account of two objectives: regional consistency and robustness to added noises. The novel approach is tested on various color images. Extensive experiments show that our method obviously outperforms existing segmentation variants on real and synthetic images of fire forest scenes, and also achieves outstanding performance on other popular benchmarked images (e.g., BSDS, MRSC). The merits of our proposed approach are that it is not sensitive to added noises and that the segmentation performance is higher with images of nonhomogeneous regions.

An Adaptive Ellipse Distance Density Peak Fuzzy Clustering Algorithm Based on the Multi-target Traffic Radar

In the multi-target traffic radar scene, the clustering accuracy between vehicles with close driving distance is relatively low. In response to this problem, this paper proposes a new clustering algorithm, namely an adaptive ellipse distance density peak fuzzy (AEDDPF) clustering algorithm. Firstly, the Euclidean distance is replaced by adaptive ellipse distance, which can more accurately describe the structure of data obtained by radar measurement vehicles. Secondly, the adaptive exponential function curve is introduced in the decision graph of the fast density peak search algorithm to accurately select the density peak point, and the initialization of the AEDDPF algorithm is completed. Finally, the membership matrix and the clustering center are calculated through successive iterations to obtain the clustering result.The time complexity of the AEDDPF algorithm is analyzed. Compared with the density-based spatial clustering of applications with noise (DBSCAN), k-means, fuzzy c-means (FCM), Gustafson-Kessel (GK), and adaptive Euclidean distance density peak fuzzy (Euclid-ADDPF) algorithms, the AEDDPF algorithm has higher clustering accuracy for real measurement data sets in certain scenarios. The experimental results also prove that the proposed algorithm has a better clustering effect in some close-range vehicle scene applications. The generalization ability of the proposed AEDDPF algorithm applied to other types of data is also analyzed.

Research on Evaluating the Sustainable Operation of Rail Transit System Based on QFD and Fuzzy Clustering

The purpose of this study is to evaluate the sustainable operation of rail transit system. In rail transit system, as the most important aspect of negative entropy flow, the effective strategy can offset the increasing entropy of the system and make it have the characteristics of dissipative structure, so as to realize the sustainable operation. At first, this study constructs the Pressure-State-Response (PSR) model to evaluate the sustainable operation of rail transit system. In this PSR model, "pressure" is viewed as customer requirements, which answers the reasons for such changes in rail transit system; "state" refers to the state and environment of system activities, which can be described as the challenges of coping with system pressure; "response" describes the system's actions to address the challenges posed by customer needs, namely operational strategies. Moreover, then, 13 pressure indices, five state indices and 11 response indices are summarized. In addition, based on quality function deployment (QFD), with 13 pressure indices as input variables, five state indices as customer requirements (CRs) of QFD and 11 response indices as technical attributes (TAs) of QFD, this study proposed the three-phase evaluation method of the sustainable operation of rail transit system to obtain the operational strategy (that is, negative entropy flow): The first phase is to verify that 13 pressure indices can be clustered into five state indices by fuzzy clustering analysis; The second phase is to get the weights of five state indices by evidential reasoning; The third phase is to rate the importance of 11 response indices by integrating fuzzy weighted average and expected value operator. Finally, the proposed model and method of evaluation are applied to the empirical analysis of Shanghai rail transit system. Finally, we come to the conclusion that Shanghai rail transit system should take priority from the following five aspects: "advancement of design standards", "reliability of subway facilities", "completeness of operational rules", "standardization of management operation" and "rationality of passenger flow control".

An Adaptive Feature Selection Algorithm for Fuzzy Clustering Image Segmentation Based on Embedded Neighbourhood Information Constraints

This paper addresses the lack of robustness of feature selection algorithms for fuzzy clustering segmentation with the Gaussian mixture model. Assuming that the neighbourhood pixels and the centre pixels obey the same distribution, a Markov method is introduced to construct the prior probability distribution and achieve the membership degree regularisation constraint for clustering sample points. Then, a noise smoothing factor is introduced to optimise the prior probability constraint. Second, a power index is constructed by combining the classification membership degree and prior probability since the Kullback–Leibler (KL) divergence of the noise smoothing factor is used to supervise the prior probability; this probability is embedded into Fuzzy Superpixels Fuzzy C-means (FSFCM) as a regular factor. This paper proposes a fuzzy clustering image segmentation algorithm based on an adaptive feature selection Gaussian mixture model with neighbourhood information constraints. To verify the segmentation performance and anti-noise robustness of the improved algorithm, the fuzzy C-means clustering algorithm Fuzzy C-means (FCM), FSFCM, Spatially Variant Finite Mixture Model (SVFMM), EGFMM, extended Gaussian mixture model (EGMM), adaptive feature selection robust fuzzy clustering segmentation algorithm (AFSFCM), fast and robust spatially constrained Gaussian mixture model (GMM) for image segmentation (FRSCGMM), and improve method are used to segment grey images containing Gaussian noise, salt-and-pepper noise, multiplicative noise and mixed noise. The peak signal-to-noise ratio (PSNR) and the error rate (MCR) are used as the theoretical basis for assessing the segmentation results. The improved algorithm indicators proposed in this paper are optimised. The improved algorithm yields increases of 0.1272–12.9803 dB, 1.5501–13.4396 dB, 1.9113–11.2613 dB and 1.0233–10.2804 dB over the other methods, and the Misclassification rate (MSR) decreases by 0.32–37.32%, 5.02–41.05%, 0.3–21.79% and 0.9–30.95% compared to that with the other algorithms. It is verified that the segmentation results of the improved algorithm have good regional consistency and strong anti-noise robustness, and they meet the needs of noisy image segmentation.

A Local Neighborhood Robust Fuzzy Clustering Image Segmentation Algorithm Based on an Adaptive Feature Selection Gaussian Mixture Model

Since the fuzzy local information C-means (FLICM) segmentation algorithm cannot take into account the impact of different features on clustering segmentation results, a local fuzzy clustering segmentation algorithm based on a feature selection Gaussian mixture model was proposed. First, the constraints of the membership degree on the spatial distance were added to the local information function. Second, the feature saliency was introduced into the objective function. By using the Lagrange multiplier method, the optimal expression of the objective function was solved. Neighborhood weighting information was added to the iteration expression of the classification membership degree to obtain a local feature selection based on feature selection. Each of the improved FLICM algorithm, the fuzzy C-means with spatial constraints (FCM_S) algorithm, and the original FLICM algorithm were then used to cluster and segment the interference images of Gaussian noise, salt-and-pepper noise, multiplicative noise, and mixed noise. The performances of the peak signal-to-noise ratio and error rate of the segmentation results were compared with each other. At the same time, the iteration time and number of iterations used to converge the objective function of the algorithm were compared. In summary, the improved algorithm significantly improved the ability of image noise suppression under strong noise interference, improved the efficiency of operation, facilitated remote sensing image capture under strong noise interference, and promoted the development of a robust anti-noise fuzzy clustering algorithm.

A Crop Canopy Localization Method Based on Ultrasonic Ranging and Iterative Self-Organizing Data Analysis Technique Algorithm

To protect crops from diseases and increase yields, chemical agents are applied by boom sprayers. To achieve the optimal effect, the boom and the crop canopy should be kept at an appropriate distance. So, it is crucial to be able to distinguish the crop canopy from other plant leaves. Based on ultrasonic ranging, this paper adopts the fuzzy iterative self-organizing data analysis technique algorithm to identify the canopy location. According to the structural characteristics of the crop canopy, based on fuzzy clustering, the algorithm can dynamically adjust the number and center of clusters so as to get the optimal results. Therefore, the distances from the sensor to the canopy or the ground can be accurately acquired, and the influence of lower leaves on the measurement results can be alleviated. Potted corn plants from the 3-leaf stage to the 6-leaf stage were tested on an experiment bench. The results showed that the calculated distances from the sensor to the canopy using this method had good correlation with the manually measured distances. The maximum error of calculated values appeared at the 3-leaf stage. With the growth of plants, the error of calculated values decreased. The increased sensor moving speeds led to increased error due to the reduced data points. From the 3-leaf stage to the 5-leaf stage, the distances from the sensor to the ground can also be obtained at the same time. The method proposed in this paper provides a practical resolution to localize the canopy for adjusting the height of sprayer boom.

Multi-Attribute Fusion Algorithm Based on Improved Evidence Theory and Clustering

In most of the application scenarios of industrial control systems, the switching threshold of a device, such as a street light system, is typically set to a fixed value. To meet the requirements for a smart city, it is necessary to set a threshold that is adaptive to different conditions by fusing the multi-attribute observations of the sensors. This paper proposes a multi-attribute fusion algorithm based on fuzzy clustering and improved evidence theory. All of the observations are clustered by fuzzy clustering, where a proper clustering method is chosen, and the improved evidence theory is used to fuse the observations. In the experiments, two-dimensional observations for the street light illumination and for the ambient illumination are used in a campus-intelligent lighting system based on a narrowband Internet of things, and the results demonstrate the effectiveness of the proposed fusion algorithm. The proposed algorithm can be applied to a variety of multi-attribute fusion scenarios.

Multi-Objective Optimized Fuzzy Clustering for Detecting Cell Clusters from Single-Cell Expression Profiles

Rapid advance in single-cell RNA sequencing (scRNA-seq) allows measurement of the expression of genes at single-cell resolution in complex disease or tissue. While many methods have been developed to detect cell clusters from the scRNA-seq data, this task currently remains a main challenge. We proposed a multi-objective optimization-based fuzzy clustering approach for detecting cell clusters from scRNA-seq data. First, we conducted initial filtering and SCnorm normalization. We considered various case studies by selecting different cluster numbers ( c l = 2 to a user-defined number), and applied fuzzy c-means clustering algorithm individually. From each case, we evaluated the scores of four cluster validity index measures, Partition Entropy ( P E ), Partition Coefficient ( P C ), Modified Partition Coefficient ( M P C ), and Fuzzy Silhouette Index ( F S I ). Next, we set the first measure as minimization objective (↓) and the remaining three as maximization objectives (↑), and then applied a multi-objective decision-making technique, TOPSIS, to identify the best optimal solution. The best optimal solution (case study) that had the highest TOPSIS score was selected as the final optimal clustering. Finally, we obtained differentially expressed genes (DEGs) using Limma through the comparison of expression of the samples between each resultant cluster and the remaining clusters. We applied our approach to a scRNA-seq dataset for the rare intestinal cell type in mice [GEO ID: GSE62270, 23,630 features (genes) and 288 cells]. The optimal cluster result (TOPSIS optimal score= 0.858) comprised two clusters, one with 115 cells and the other 91 cells. The evaluated scores of the four cluster validity indices, F S I , P E , P C , and M P C for the optimized fuzzy clustering were 0.482, 0.578, 0.607, and 0.215, respectively. The Limma analysis identified 1240 DEGs (cluster 1 vs. cluster 2). The top ten gene markers were Rps21, Slc5a1, Crip1, Rpl15, Rpl3, Rpl27a, Khk, Rps3a1, Aldob and Rps17. In this list, Khk (encoding ketohexokinase) is a novel marker for the rare intestinal cell type. In summary, this method is useful to detect cell clusters from scRNA-seq data.

Fuzzy Clustering Algorithm with Non-Neighborhood Spatial Information for Surface Roughness Measurement Based on the Reflected Aliasing Images

Due to the limitation of the fixed structures of neighborhood windows, the quality of spatial information obtained from the neighborhood pixels may be affected by noise. In order to compensate this drawback, a robust fuzzy c-means clustering with non-neighborhood spatial information (FCM_NNS) is presented. Through incorporating non-neighborhood spatial information, the robustness performance of the proposed FCM_NNS with respect to the noise can be significantly improved. The results indicate that FCM_NNS is very effective and robust to noisy aliasing images. Moreover, the comparison of other seven roughness indexes indicates that the proposed FCM_NNS-based F index can characterize the aliasing degree in the surface images and is highly correlated with surface roughness (R² = 0.9327 for thirty grinding samples).

Context Dependent Fuzzy Associated Statistical Model for Intensity Inhomogeneity Correction From Magnetic Resonance Images

In this paper, a novel context-dependent fuzzy set associated statistical model-based intensity inhomogeneity correction technique for magnetic resonance image (MRI) is proposed. The observed MRI is considered to be affected by intensity inhomogeneity and it is assumed to be a multiplicative quantity. In the proposed scheme the intensity inhomogeneity correction and MRI segmentation is considered as a combined task. The maximum a posteriori probability (MAP) estimation principle is explored to solve this problem. A fuzzy set associated Gibbs’ Markov random field (MRF) is considered to model the spatio-contextual information of an MRI. It is observed that the MAP estimate of the MRF model does not yield good results with any local searching strategy, as it gets trapped to local optimum. Hence, we have exploited the advantage of variable neighborhood searching (VNS)-based iterative global convergence criterion for MRF-MAP estimation. The effectiveness of the proposed scheme is established by testing it on different MRIs. Three performance evaluation measures are considered to evaluate the performance of the proposed scheme against existing state-of-the-art techniques. The simulation results establish the effectiveness of the proposed technique.

Network Distance-Based Simulated Annealing and Fuzzy Clustering for Sensor Placement Ensuring Observability and Minimal Relative Degree

Network science-based analysis of the observability of dynamical systems has been a focus of attention over the past five years. The maximum matching-based approach provides a simple tool to determine the minimum number of sensors and their positions. However, the resulting proportion of sensors is particularly small when compared to the size of the system, and, although structural observability is ensured, the system demands additional sensors to provide the small relative order needed for fast and robust process monitoring and control. In this paper, two clustering and simulated annealing-based methodologies are proposed to assign additional sensors to the dynamical systems. The proposed methodologies simplify the observation of the system and decrease its relative order. The usefulness of the proposed method is justified in a sensor-placement problem of a heat exchanger network. The results show that the relative order of the observability is decreased significantly by an increase in the number of additional sensors.

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.

Fuzzy Modelling for Human Dynamics Based on Online Social Networks

Human mobility mining has attracted a lot of attention in the research community due to its multiple implications in the provisioning of innovative services for large metropolises. In this scope, Online Social Networks (OSN) have arisen as a promising source of location data to come up with new mobility models. However, the human nature of this data makes it rather noisy and inaccurate. In order to deal with such limitations, the present work introduces a framework for human mobility mining based on fuzzy logic. Firstly, a fuzzy clustering algorithm extracts the most active OSN areas at different time periods. Next, such clusters are the building blocks to compose mobility patterns. Furthermore, a location prediction service based on a fuzzy rule classifier has been developed on top of the framework. Finally, both the framework and the predictor has been tested with a Twitter and Flickr dataset in two large cities.

Detecting state changes for ecosystem conservation with long-term monitoring of species composition

Effective conservation requires an understanding not only of contemporary vegetation distributions in the landscape, but also cognizance of vegetation transitions over time with the goal of maintaining persistence of all states within the landscape. Using a state and transition model framework, we investigated temporal transitions over 31 years in species composition among five upland swamp vegetation communities in southeastern Australia. We applied fuzzy clustering to document transitions across communities; evaluated the resilience and resistance of communities to change; and explored the relationship between ecosystem states and major environmental factors posited to structure the system. We also evaluated the predictive ability of an established vegetation dynamics model. We found that community composition remained stable or underwent reversible or directional transitions depending on the vegetation type. Wetter communities (Ti-tree thicket and Cyperoid heath) were more stable (i.e., resistant) while drier communities showed a greater propensity to transition (i.e., had lower resistance) under the observed disturbance regime (low variance fire intervals). The resilience of drier communities differed under this regime, with Banksia thicket showing reversible compositional change, while Restioid heath and Sedgeland showed directional change. In accord with an established conceptual model, we found that communities were distributed along a hydrological gradient. In addition, vegetation structure, along with light penetration to ground level, differentiated communities. However, internal dynamics of drier communities were complex: differences in fire regime (penultimate fire interval in 2014 and number of fires since 1965) were unable to predict differences in community membership among sites. Aspects of the fire regime are expected to be more important predictors if fire intervals vary more strongly among sites in the future. Fuzzy clustering of compositional data allows managers to track community transitions over time and facilitates planned interventions for conservation purposes.

Biclustering Models for Two-Mode Ordinal Data

The work in this paper introduces finite mixture models that can be used to simultaneously cluster the rows and columns of two-mode ordinal categorical response data, such as those resulting from Likert scale responses. We use the popular proportional odds parameterisation and propose models which provide insights into major patterns in the data. Model-fitting is performed using the EM algorithm, and a fuzzy allocation of rows and columns to corresponding clusters is obtained. The clustering ability of the models is evaluated in a simulation study and demonstrated using two real data sets.

Brain tissue segmentation using fuzzy clustering techniques

BACKGROUND

Medical image segmentation is an essential step for most consequent image analysis tasks. Medical images can be segmented manually, but the accuracy of image segmentation using the automated segmentation algorithms is more when compared with the manual calculations. In this paper, an automated segmentation and classification of tissues are proposed for MR brain images.

OBJECTIVE

To classify MR brain image into three segments such as Grey Matter (GM), White Matter (WM) and Cerebro-Spinal Fluid (CSF). Classification of brain into tissues helps to diagnose several diseases such as tumors, Alzheimer's disease, stroke, multiple sclerosis.

METHODS

An unsupervised clustering technique such as Fuzzy C-Means (FCM) algorithm has been widely used in segmenting the images. The spatial information is not fully utilized by the conventional clustering algorithm and hence it is not applicable for clustering a noisy image. We incorporate a method for image clustering called out as Reformulated Fuzzy Local information C-Means Clustering algorithm [RFLICM] which is a variant of traditional Clustering algorithm by considering both spatial and gray level information. In RFLICM, spatial distance is replaced by local coefficient of variation in a fuzzy manner.

RESULTS

Experiments are conducted on brain images to validate the performance of the proposed technique in segmenting the medical images and the efficiency achieved in the presence of salt and pepper noise is 99.86%.

CONCLUSION

Standard FCM, Fuzzy Local information C-means clustering algorithm [FLICM], Reformulated Fuzzy Local information C-means clustering algorithm [RFLICM] are compared to explore the accuracy of our proposed approach. Clustering results show that RFLICM segmentation method is appropriate for classifying tissues in brain MR image.

An effective fuzzy kernel clustering analysis approach for gene expression data

Fuzzy clustering is an important tool for analyzing microarray data. A major problem in applying fuzzy clustering method to microarray gene expression data is the choice of parameters with cluster number and centers. This paper proposes a new approach to fuzzy kernel clustering analysis (FKCA) that identifies desired cluster number and obtains more steady results for gene expression data. First of all, to optimize characteristic differences and estimate optimal cluster number, Gaussian kernel function is introduced to improve spectrum analysis method (SAM). By combining subtractive clustering with max-min distance mean, maximum distance method (MDM) is proposed to determine cluster centers. Then, the corresponding steps of improved SAM (ISAM) and MDM are given respectively, whose superiority and stability are illustrated through performing experimental comparisons on gene expression data. Finally, by introducing ISAM and MDM into FKCA, an effective improved FKCA algorithm is proposed. Experimental results from public gene expression data and UCI database show that the proposed algorithms are feasible for cluster analysis, and the clustering accuracy is higher than the other related clustering algorithms.

An automatic method for atom identification in scanning tunnelling microscopy images of Fe-chalcogenide superconductors

We describe a computational approach for the automatic recognition and classification of atomic species in scanning tunnelling microscopy images. The approach is based on a pipeline of image processing methods in which the classification step is performed by means of a Fuzzy Clustering algorithm. As a representative example, we use the computational tool to characterize the nanoscale phase separation in thin films of the Fe-chalcogenide superconductor FeSex Te1-x , starting from synthetic data sets and experimental topographies. We quantify the stoichiometry fluctuations on length scales from tens to a few nanometres.

Fully Automated Complementary DNA Microarray Segmentation using a Novel Fuzzy-based Algorithm

DNA microarray is a powerful approach to study simultaneously, the expression of 1000 of genes in a single experiment. The average value of the fluorescent intensity could be calculated in a microarray experiment. The calculated intensity values are very close in amount to the levels of expression of a particular gene. However, determining the appropriate position of every spot in microarray images is a main challenge, which leads to the accurate classification of normal and abnormal (cancer) cells. In this paper, first a preprocessing approach is performed to eliminate the noise and artifacts available in microarray cells using the nonlinear anisotropic diffusion filtering method. Then, the coordinate center of each spot is positioned utilizing the mathematical morphology operations. Finally, the position of each spot is exactly determined through applying a novel hybrid model based on the principle component analysis and the spatial fuzzy c-means clustering (SFCM) algorithm. Using a Gaussian kernel in SFCM algorithm will lead to improving the quality in complementary DNA microarray segmentation. The performance of the proposed algorithm has been evaluated on the real microarray images, which is available in Stanford Microarray Databases. Results illustrate that the accuracy of microarray cells segmentation in the proposed algorithm reaches to 100% and 98% for noiseless/noisy cells, respectively.

Accelerating Fuzzy-C Means Using an Estimated Subsample Size

Many algorithms designed to accelerate the Fuzzy c-Means (FCM) clustering algorithm randomly sample the data. Typically, no statistical method is used to estimate the subsample size, despite the impact subsample sizes have on speed and quality. This paper introduces two new accelerated algorithms, GOFCM and MSERFCM, that use a statistical method to estimate the subsample size. GOFCM, a variant of SPFCM, also leverages progressive sampling. MSERFCM, a variant of rseFCM, gains a speedup from improved initialization. A general, novel stopping criterion for accelerated clustering is introduced. The new algorithms are compared to FCM and four accelerated variants of FCM. GOFCM's speedup was 4-47 times that of FCM and faster than SPFCM on each of the six datasets used in experiments. For five of the datasets, partitions were within 1% of those of FCM. MSERFCM's speedup was 5-26 times that of FCM and produced partitions within 3% of those of FCM on all datasets. A unique dataset, consisting of plankton images, exposed the strengths and weaknesses of many of the algorithms tested. It is shown that the new stopping criterion is effective in speeding up algorithms such as SPFCM and the final partitions are very close to those of FCM.

Fuzzy speed function based active contour model for segmentation of pulmonary nodules

Pulmonary nodules are potential manifestation of lung cancer. Accurate segmentation of juxta-vascular nodules and ground glass opacity (GGO) nodules is an important and active area of research in medical image processing. At present, the classical active contour models (ACM) for segmentation of pulmonary nodules may cause the problem of boundary leakage. In order to solve the problem, a new fuzzy speed function-based active model for segmentation of pulmonary nodules is proposed in this paper. The fuzzy speed function incorporated into the ACM is calculated by the degree of membership based on intensity feature and local shape index. At the boundary of pulmonary nodules, the fuzzy speed function approaches zero and the evolution of the contour curve will stop, so the accurate segmentation of pulmonary nodules can be obtained. Experimental results on juxta-vascular nodules and GGO nodules show that the proposed ACM can achieve accurate segmentation.

Applications of cluster analysis to the creation of perfectionism profiles: a comparison of two clustering approaches

Although traditional clustering methods (e.g., K-means) have been shown to be useful in the social sciences it is often difficult for such methods to handle situations where clusters in the population overlap or are ambiguous. Fuzzy clustering, a method already recognized in many disciplines, provides a more flexible alternative to these traditional clustering methods. Fuzzy clustering differs from other traditional clustering methods in that it allows for a case to belong to multiple clusters simultaneously. Unfortunately, fuzzy clustering techniques remain relatively unused in the social and behavioral sciences. The purpose of this paper is to introduce fuzzy clustering to these audiences who are currently relatively unfamiliar with the technique. In order to demonstrate the advantages associated with this method, cluster solutions of a common perfectionism measure were created using both fuzzy clustering and K-means clustering, and the results compared. Results of these analyses reveal that different cluster solutions are found by the two methods, and the similarity between the different clustering solutions depends on the amount of cluster overlap allowed for in fuzzy clustering.

Automated identification of brain tumors from single MR images based on segmentation with refined patient-specific priors

Brain tumors can have different shapes or locations, making their identification very challenging. In functional MRI, it is not unusual that patients have only one anatomical image due to time and financial constraints. Here, we provide a modified automatic lesion identification (ALI) procedure which enables brain tumor identification from single MR images. Our method rests on (A) a modified segmentation-normalization procedure with an explicit “extra prior” for the tumor and (B) an outlier detection procedure for abnormal voxel (i.e., tumor) classification. To minimize tissue misclassification, the segmentation-normalization procedure requires prior information of the tumor location and extent. We therefore propose that ALI is run iteratively so that the output of Step B is used as a patient-specific prior in Step A. We test this procedure on real T1-weighted images from 18 patients, and the results were validated in comparison to two independent observers' manual tracings. The automated procedure identified the tumors successfully with an excellent agreement with the manual segmentation (area under the ROC curve = 0.97 ± 0.03). The proposed procedure increases the flexibility and robustness of the ALI tool and will be particularly useful for lesion-behavior mapping studies, or when lesion identification and/or spatial normalization are problematic.

MSClust: a tool for unsupervised mass spectra extraction of chromatography-mass spectrometry ion-wise aligned data

Mass peak alignment (ion-wise alignment) has recently become a popular method for unsupervised data analysis in untargeted metabolic profiling. Here we present MSClust-a software tool for analysis GC-MS and LC-MS datasets derived from untargeted profiling. MSClust performs data reduction using unsupervised clustering and extraction of putative metabolite mass spectra from ion-wise chromatographic alignment data. The algorithm is based on the subtractive fuzzy clustering method that allows unsupervised determination of a number of metabolites in a data set and can deal with uncertain memberships of mass peaks in overlapping mass spectra. This approach is based purely on the actual information present in the data and does not require any prior metabolite knowledge. MSClust can be applied for both GC-MS and LC-MS alignment data sets. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1007/s11306-011-0368-2) contains supplementary material, which is available to authorized users.

Autosomal linkage scan for loci predisposing to comorbid dependence on multiple substances

Multiple substance dependence (MSD) trait comorbidity is common, and MSD patients are often severely affected clinically. While shared genetic risks have been documented, so far there has been no published report using the linkage scan approach to survey risk loci for MSD as a phenotype. A total of 1,758 individuals in 739 families [384 African American (AA) and 355 European American (EA) families] ascertained via affected sib-pairs with cocaine or opioid or alcohol dependence were genotyped using an array-based linkage panel of single-nucleotide polymorphism markers. Fuzzy clustering analysis was conducted on individuals with alcohol, cannabis, cocaine, opioid, and nicotine dependence for AAs and EAs separately, and linkage scans were conducted for the output membership coefficients using Merlin-regression. In EAs, we observed an autosome-wide significant linkage signal on chromosome 4 (peak lod = 3.31 at 68.3 cM; empirical autosome-wide P = 0.038), and a suggestive linkage signal on chromosome 21 (peak lod = 2.37 at 19.4 cM). In AAs, four suggestive linkage peaks were observed: two peaks on chromosome 10 (lod = 2.66 at 96.7 cM and lod = 3.02 at 147.6 cM] and the other two on chromosomes 3 (lod = 2.81 at 145.5 cM) and 9 (lod = 1.93 at 146.8 cM). Three particularly promising candidate genes, GABRA4, GABRB1, and CLOCK, are located within or very close to the autosome-wide significant linkage region for EAs on chromosome 4. This is the first linkage evidence supporting existence of genetic loci influencing risk for several comorbid disorders simultaneously in two major US populations.

Breast cancer recognition using a novel hybrid intelligent method

Breast cancer is the second largest cause of cancer deaths among women. At the same time, it is also among the most curable cancer types if it can be diagnosed early. This paper presents a novel hybrid intelligent method for recognition of breast cancer tumors. The proposed method includes three main modules: the feature extraction module, the classifier module, and the optimization module. In the feature extraction module, fuzzy features are proposed as the efficient characteristic of the patterns. In the classifier module, because of the promising generalization capability of support vector machines (SVM), a SVM-based classifier is proposed. In support vector machine training, the hyperparameters have very important roles for its recognition accuracy. Therefore, in the optimization module, the bees algorithm (BA) is proposed for selecting appropriate parameters of the classifier. The proposed system is tested on Wisconsin Breast Cancer database and simulation results show that the recommended system has a high accuracy.

A stereovision matching strategy for images captured with fish-eye lenses in forest environments

We present a novel strategy for computing disparity maps from hemispherical stereo images obtained with fish-eye lenses in forest environments. At a first segmentation stage, the method identifies textures of interest to be either matched or discarded. This is achieved by applying a pattern recognition strategy based on the combination of two classifiers: Fuzzy Clustering and Bayesian. At a second stage, a stereovision matching process is performed based on the application of four stereovision matching constraints: epipolar, similarity, uniqueness and smoothness. The epipolar constraint guides the process. The similarity and uniqueness are mapped through a decision making strategy based on a weighted fuzzy similarity approach, obtaining a disparity map. This map is later filtered through the Hopfield Neural Network framework by considering the smoothness constraint. The combination of the segmentation and stereovision matching approaches makes the main contribution. The method is compared against the usage of simple features and combined similarity matching strategies.

Efficient fuzzy C-means architecture for image segmentation

This paper presents a novel VLSI architecture for image segmentation. The architecture is based on the fuzzy c-means algorithm with spatial constraint for reducing the misclassification rate. In the architecture, the usual iterative operations for updating the membership matrix and cluster centroid are merged into one single updating process to evade the large storage requirement. In addition, an efficient pipelined circuit is used for the updating process for accelerating the computational speed. Experimental results show that the the proposed circuit is an effective alternative for real-time image segmentation with low area cost and low misclassification rate.

Application of clustering analyses to the diagnosis of Huntington disease in mice and other diseases with well-defined group boundaries

Nuclear magnetic resonance (NMR) spectroscopy has emerged as a technology that can provide metabolite information within organ systems in vivo. In this study, we introduced a new method of employing a clustering algorithm to develop a diagnostic model that can differentially diagnose a single unknown subject in a disease with well-defined group boundaries. We used three tests to assess the suitability and the accuracy required for diagnostic purposes of the four clustering algorithms we investigated (K-means, Fuzzy, Hierarchical, and Medoid Partitioning). To accomplish this goal, we studied the striatal metabolomic profile of R6/2 Huntington disease (HD) transgenic mice and that of wild type (WT) mice using high field in vivo proton NMR spectroscopy (9.4T). We tested all four clustering algorithms (1) with the original R6/2 HD mice and WT mice, (2) with unknown mice, whose status had been determined via genotyping, and (3) with the ability to separate the original R6/2 mice into the two age subgroups (8 and 12 weeks old). Only our diagnostic models that employed ROC-supervised Fuzzy, unsupervised Fuzzy, and ROC-supervised K-means Clustering passed all three stringent tests with 100% accuracy, indicating that they may be used for diagnostic purposes.