FUZZY C-MEANS ALGORITHM WITH LOCAL THRESHOLDING FOR GRAY-SCALE IMAGES

2008 ◽  
Vol 17 (04) ◽  
pp. 765-775 ◽  
Author(s):  
HSIAO PIAU NG ◽  
SIM HENG ONG ◽  
KELVIN WENG CHIONG FOONG ◽  
POH SUN GOH ◽  
WIESLAW L. NOWINSKI
Keyword(s):  
Feature Space ◽  
Boundary Region ◽  
Superior Performance ◽  
Local Minima ◽  
Threshold Values ◽  
Fuzzy C Means ◽  
Otsu Thresholding ◽  
Local Thresholding ◽  
Fcm Clustering ◽  
Comparison Of The Results

An improved fuzzy C-means (FCM) clustering method is proposed. It incorporates Otsu thresholding with conventional FCM to reduce FCM's susceptibility to local minima, as well as its tendency to derive a threshold that is biased towards the component with larger probability, and derive threshold values with greater accuracy. Thresholding is performed at the cluster boundary region in feature space. A comparison of the results produced by improved and conventional algorithms confirms the superior performance of the former.

scholarly journals Three-level Local Thresholding Berbasis Metode Otsu untuk Segmentasi Leukosit pada Citra Leukemia Limfoblastik Akut

2016 ◽  
Vol 7 (1) ◽  
Author(s):  
Eka Prakarsa Mandyartha ◽  
Chastine Fatichah
Keyword(s):  
Acute Lymphoblastic Leukemia ◽  
Lymphoblastic Leukemia ◽  
Similarity Index ◽  
Input Image ◽  
Superior Performance ◽  
Threshold Values ◽  
Otsu Thresholding ◽  
Local Threshold ◽  
Local Thresholding ◽  
Global Thresholding

Abstract. Segmentation of Acute Lymphoblastic Leukemia (ALL) images can be used to identify the presence of ALL disease. In this paper, three-level local thresholdings based on Otsu method is presented for leucocytes segmentation in ALL image. Firstly, a method based on Gram-Schmidt orthogonalization theory is applied to partition the input image into several sub-images. The proposed method extends Otsu’s bi-level thresholding to three-level thresholding method  to find two local threshold values that maximize between-class variance. Using the two local threshold values and three-level local thresholding technique then segmenting each of sub-images into three regions, e.g. nucleus, cytoplasm, and background. To evaluate the performance of the proposed method, 32 peripheral blood smear images are used. The performance of the proposed method is compared with manually segmented ground truth using Zijdenbos similarity index (ZSI), precision, and recall. An experimental evaluation demonstrates superior performance over three-level global thresholding for ALL image segmentation.Keywords: three-level local thresholding, acute lymphoblastic leukemia, three-level Otsu thresholding, gram-schmidt orthogonalization Abstrak. Segmentasi citra Limfoblastik Leukemia Akut (LLA) dapat digunakan untuk mengidentifikasi kehadiran penyakit LLA. Pada penelitian ini diusulkan metode three-level local thresholding berbasis metode Otsu untuk segmentasi leukosit pada citra LLA. Pertama-tama, metode berbasis teori ortogonalisasi Gram-Schmidt diaplikasikan untuk membagi citra LLA menjadi sub-sub citra. Metode yang diusulkan memperluas metode bi-level thresholding Otsu ke dalam kasus three-level thresholding untuk pencarian dua nilai ambang lokal tiap sub-citra yang memaksimumkan varian antar kelas. Dengan nilai ambang jamak lokal tersebut, teknik three-level local thresholding selanjutnya  mensegmentasi tiap sub-citra ke dalam tiga region, yaitu nukelus, sitoplasma, dan latar belakang. Untuk mengevaluasi performa metode usulan, 32 citra uji digunakan. Performa metode yang diusulkan dibandingkan dengan citra segmentasi manual menggunakan Zijdenbos similarity index (ZSI), presisi, dan recall. Hasil uji coba menunjukkan performa three-level local thresholding lebih unggul daripada metode three-level global thresholding untuk segmentasi citra LLA. Kata Kunci: three-level local thresholding, leukemia limfoblastik akut, three-level Otsu thresholding, ortogonalisasi gram-schmidt

Context-Driven Proactive Decision Support for Hybrid Teams

AI Magazine ◽  
2019 ◽  
Vol 40 (3) ◽  
pp. 41-57
Author(s):  
Manisha Mishra ◽  
Pujitha Mannaru ◽  
David Sidoti ◽  
Adam Bienkowski ◽  
Lingyi Zhang ◽  
...  
Keyword(s):  
Decision Support ◽  
Situational Awareness ◽  
Feature Space ◽  
Human Interaction ◽  
Superior Performance ◽  
Uncertain Environments ◽  
Cognitive States ◽  
Contextual Elements ◽  
Human Operators ◽  
Smart Machine

A synergy between AI and the Internet of Things (IoT) will significantly improve sense-making, situational awareness, proactivity, and collaboration. However, the key challenge is to identify the underlying context within which humans interact with smart machines. Knowledge of the context facilitates proactive allocation among members of a human–smart machine (agent) collective that balances auto­nomy with human interaction, without displacing humans from their supervisory role of ensuring that the system goals are achievable. In this article, we address four research questions as a means of advancing toward proactive autonomy: how to represent the interdependencies among the key elements of a hybrid team; how to rapidly identify and characterize critical contextual elements that require adaptation over time; how to allocate system tasks among machines and agents for superior performance; and how to enhance the performance of machine counterparts to provide intelligent and proactive courses of action while considering the cognitive states of human operators. The answers to these four questions help us to illustrate the integration of AI and IoT applied to the maritime domain, where we define context as an evolving multidimensional feature space for heterogeneous search, routing, and resource allocation in uncertain environments via proactive decision support systems.

scholarly journals Improved Fuzzy C-Means Clustering for Transformer Fault Diagnosis Using Dissolved Gas Analysis Data

Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2344 ◽  
Author(s):  
Enwen Li ◽  
Linong Wang ◽  
Bin Song ◽  
Siliang Jian
Keyword(s):  
Fault Diagnosis ◽  
Membership Function ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Gas Analysis ◽  
Dissolved Gas ◽  
Fuzzy C Means ◽  
Dissolved Gas Analysis ◽  
Fcm Clustering ◽  
Transformer Fault

Dissolved gas analysis (DGA) of the oil allows transformer fault diagnosis and status monitoring. Fuzzy c-means (FCM) clustering is an effective pattern recognition method, but exhibits poor clustering accuracy for dissolved gas data and usually fails to subsequently correctly classify transformer faults. The existing feasible approach involves combination of the FCM clustering algorithm with other intelligent algorithms, such as neural networks and support vector machines. This method enables good classification; however, the algorithm complexity is greatly increased. In this paper, the FCM clustering algorithm itself is improved and clustering analysis of DGA data is realized. First, the non-monotonicity of the traditional clustering membership function with respect to the sample distance and its several local extrema are discussed, which mainly explain the poor classification accuracy of DGA data clustering. Then, an exponential form of the membership function is proposed to obtain monotony with respect to distance, thereby improving the dissolved gas data clustering. Likewise, a similarity function to determine the degree of membership is derived. Test results for large datasets show that the improved clustering algorithm can be successfully applied for DGA-data-based transformer fault detection.

Improved Fuzzy FCM-LI Algorithm

2013 ◽  
Vol 765-767 ◽  
pp. 670-673
Author(s):  
Li Bo Hou
Keyword(s):  
Real Time ◽  
Clustering Algorithm ◽  
Feature Analysis ◽  
Cluster Center ◽  
High Dimensional ◽  
Fuzzy C Means ◽  
Sample Data ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering ◽  
Np Hard Problem

Fuzzy C-means (FCM) clustering algorithm is one of the widely applied algorithms in non-supervision of pattern recognition. However, FCM algorithm in the iterative process requires a lot of calculations, especially when feature vectors has high-dimensional, Use clustering algorithm to sub-heap, not only inefficient, but also may lead to "the curse of dimensionality." For the problem, This paper analyzes the fuzzy C-means clustering algorithm in high dimensional feature of the process, the problem of cluster center is an np-hard problem, In order to improve the effectiveness and Real-time of fuzzy C-means clustering algorithm in high dimensional feature analysis, Combination of landmark isometric (L-ISOMAP) algorithm, Proposed improved algorithm FCM-LI. Preliminary analysis of the samples, Use clustering results and the correlation of sample data, using landmark isometric (L-ISOMAP) algorithm to reduce the dimension, further analysis on the basis, obtained the final results. Finally, experimental results show that the effectiveness and Real-time of FCM-LI algorithm in high dimensional feature analysis.

scholarly journals A Bi-directional Fuzzy C-Means Clustering Ensemble Algorithm Considering Local Information

2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Chunhua Ren ◽  
Linfu Sun
Keyword(s):  
Clustering Algorithms ◽  
Real Data ◽  
Local Information ◽  
Data Sets ◽  
Clustering Ensemble ◽  
K Nearest Neighbors ◽  
Fuzzy C Means ◽  
Clustering Quality ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering

AbstractThe classic Fuzzy C-means (FCM) algorithm has limited clustering performance and is prone to misclassification of border points. This study offers a bi-directional FCM clustering ensemble approach that takes local information into account (LI_BIFCM) to overcome these challenges and increase clustering quality. First, various membership matrices are created after running FCM multiple times, based on the randomization of the initial cluster centers, and a vertical ensemble is performed using the maximum membership principle. Second, after each execution of FCM, multiple local membership matrices of the sample points are created using multiple K-nearest neighbors, and a horizontal ensemble is performed. Multiple horizontal ensembles can be created using multiple FCM clustering. Finally, the final clustering results are obtained by combining the vertical and horizontal clustering ensembles. Twelve data sets were chosen for testing from both synthetic and real data sources. The LI_BIFCM clustering performance outperformed four traditional clustering algorithms and three clustering ensemble algorithms in the experiments. Furthermore, the final clustering results has a weak correlation with the bi-directional cluster ensemble parameters, indicating that the suggested technique is robust.

scholarly journals Unsupervised classification of snowflake images using a generative adversarial network and <i>K</i>-medoids classification

2020 ◽  
Vol 13 (6) ◽  
pp. 2949-2964
Author(s):  
Jussi Leinonen ◽  
Alexis Berne
Keyword(s):  
Classification Scheme ◽  
Feature Space ◽  
Unsupervised Classification ◽  
Automated Classification ◽  
Generative Adversarial Network ◽  
Microphysical Properties ◽  
Adversarial Network ◽  
Computationally Intensive ◽  
Comparison Of The Results ◽  
Supervised Classification Methods

Abstract. The increasing availability of sensors imaging cloud and precipitation particles, like the Multi-Angle Snowflake Camera (MASC), has resulted in datasets comprising millions of images of falling snowflakes. Automated classification is required for effective analysis of such large datasets. While supervised classification methods have been developed for this purpose in recent years, their ability to generalize is limited by the representativeness of their labeled training datasets, which are affected by the subjective judgment of the expert and require significant manual effort to derive. An alternative is unsupervised classification, which seeks to divide a dataset into distinct classes without expert-provided labels. In this paper, we introduce an unsupervised classification scheme based on a generative adversarial network (GAN) that learns to extract the key features from the snowflake images. Each image is then associated with a distribution of points in the feature space, and these distributions are used as the basis of K-medoids classification and hierarchical clustering. We found that the classification scheme is able to separate the dataset into distinct classes, each characterized by a particular size, shape and texture of the snowflake image, providing signatures of the microphysical properties of the snowflakes. This finding is supported by a comparison of the results to an existing supervised scheme. Although training the GAN is computationally intensive, the classification process proceeds directly from images to classes with minimal human intervention and therefore can be repeated for other MASC datasets with minor manual effort. As the algorithm is not specific to snowflakes, we also expect this approach to be relevant to other applications.

Weighting exponent m in fuzzy C-means (FCM) clustering algorithm

2001 ◽  
Author(s):  
Jihong Pei ◽  
Xuan Yang ◽  
Xinbo Gao ◽  
Weixing Xie
Keyword(s):  
Clustering Algorithm ◽  
Fuzzy C Means ◽  
Fcm Clustering

scholarly journals Bayesian generalized biclustering analysis via adaptive structured shrinkage

Biostatistics ◽  
2018 ◽  
Vol 21 (3) ◽  
pp. 610-624
Author(s):  
Ziyi Li ◽  
Changgee Chang ◽  
Suprateek Kundu ◽  
Qi Long
Keyword(s):  
Negative Binomial ◽  
Feature Space ◽  
Biological Information ◽  
Superior Performance ◽  
Data Matrix ◽  
Data Types ◽  
Binomial Data ◽  
Multiple Data ◽  
Local Patterns ◽  
Shrinkage Prior

Summary Biclustering techniques can identify local patterns of a data matrix by clustering feature space and sample space at the same time. Various biclustering methods have been proposed and successfully applied to analysis of gene expression data. While existing biclustering methods have many desirable features, most of them are developed for continuous data and few of them can efficiently handle -omics data of various types, for example, binomial data as in single nucleotide polymorphism data or negative binomial data as in RNA-seq data. In addition, none of existing methods can utilize biological information such as those from functional genomics or proteomics. Recent work has shown that incorporating biological information can improve variable selection and prediction performance in analyses such as linear regression and multivariate analysis. In this article, we propose a novel Bayesian biclustering method that can handle multiple data types including Gaussian, Binomial, and Negative Binomial. In addition, our method uses a Bayesian adaptive structured shrinkage prior that enables feature selection guided by existing biological information. Our simulation studies and application to multi-omics datasets demonstrate robust and superior performance of the proposed method, compared to other existing biclustering methods.

scholarly journals Inter-Class Angular Loss for Convolutional Neural Networks

2019 ◽  
Vol 33 ◽  
pp. 3894-3901 ◽  
Author(s):  
Le Hui ◽  
Xiang Li ◽  
Chen Gong ◽  
Meng Fang ◽  
Joey Tianyi Zhou ◽  
...  
Keyword(s):  
Neural Networks ◽  
Convolutional Neural Networks ◽  
Deep Neural Networks ◽  
Learning Difficulties ◽  
Feature Space ◽  
Superior Performance ◽  
Strongly Correlated ◽  
Discriminative Ability ◽  
Practical Applications ◽  
Classification Tasks

Convolutional Neural Networks (CNNs) have shown great power in various classification tasks and have achieved remarkable results in practical applications. However, the distinct learning difficulties in discriminating different pairs of classes are largely ignored by the existing networks. For instance, in CIFAR-10 dataset, distinguishing cats from dogs is usually harder than distinguishing horses from ships. By carefully studying the behavior of CNN models in the training process, we observe that the confusion level of two classes is strongly correlated with their angular separability in the feature space. That is, the larger the inter-class angle is, the lower the confusion will be. Based on this observation, we propose a novel loss function dubbed “Inter-Class Angular Loss” (ICAL), which explicitly models the class correlation and can be directly applied to many existing deep networks. By minimizing the proposed ICAL, the networks can effectively discriminate the examples in similar classes by enlarging the angle between their corresponding class vectors. Thorough experimental results on a series of vision and nonvision datasets confirm that ICAL critically improves the discriminative ability of various representative deep neural networks and generates superior performance to the original networks with conventional softmax loss.

Sign in / Sign up

Export Citation Format

Share Document