• Title/Summary/Keyword: C-Means clustering

Search Result 362, Processing Time 0.037 seconds

Ganglion Cyst Region Extraction from Ultrasound Images Using Possibilistic C-Means Clustering Method

  • Suryadibrata, Alethea;Kim, Kwang Baek
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.49-52
    • /
    • 2017
  • Ganglion cysts are benign soft tissues usually encountered in the wrist. In this paper, we propose a method to extract a ganglion cyst region from ultrasonography images by using image segmentation. The proposed method using the possibilistic c-means (PCM) clustering method is applicable to ganglion cyst extraction. The methods considered in this thesis are fuzzy stretching, median filter, PCM clustering, and connected component labeling. Fuzzy stretching performs well on ultrasonography images and improves the original image. Median filter reduces the speckle noise without decreasing the image sharpness. PCM clustering is used for categorizing pixels into the given cluster centers. Connected component labeling is used for labeling the objects in an image and extracting the cyst region. Further, PCM clustering is more robust in the case of noisy data, and the proposed method can extract a ganglion cyst area with an accuracy of 80% (16 out of 20 images).

Clustering of Incomplete Data Using Autoencoder and fuzzy c-Means Algorithm (AutoEncoder와 FCM을 이용한 불완전한 데이터의 군집화)

  • 박동철;장병근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.700-705
    • /
    • 2004
  • Clustering of incomplete data using the Autoencoder and the Fuzzy c-Means(PCM) is proposed in this paper. The Proposed algorithm, called Optimal Completion Autoencoder Fuzzy c-Means(OCAEFCM), utilizes the Autoencoder Neural Network (AENN) and the Gradiant-based FCM (GBFCM) for optimal completion of missing data and clustering of the reconstructed data. The proposed OCAEFCM is applied to the IRIS data and a data set from a financial institution to evaluate the performance. When compared with the existing Optimal Completion Strategy FCM (OCSFCM), the OCAEFCM shows 18%-20% improvement of performance over OCSFCM.

Colorectal Cancer Staging Using Three Clustering Methods Based on Preoperative Clinical Findings

  • Pourahmad, Saeedeh;Pourhashemi, Soudabeh;Mohammadianpanah, Mohammad
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.2
    • /
    • pp.823-827
    • /
    • 2016
  • Determination of the colorectal cancer stage is possible only after surgery based on pathology results. However, sometimes this may prove impossible. The aim of the present study was to determine colorectal cancer stage using three clustering methods based on preoperative clinical findings. All patients referred to the Colorectal Research Center of Shiraz University of Medical Sciences for colorectal cancer surgery during 2006 to 2014 were enrolled in the study. Accordingly, 117 cases participated. Three clustering algorithms were utilized including k-means, hierarchical and fuzzy c-means clustering methods. External validity measures such as sensitivity, specificity and accuracy were used for evaluation of the methods. The results revealed maximum accuracy and sensitivity values for the hierarchical and a maximum specificity value for the fuzzy c-means clustering methods. Furthermore, according to the internal validity measures for the present data set, the optimal number of clusters was two (silhouette coefficient) and the fuzzy c-means algorithm was more appropriate than the k-means clustering approach by increasing the number of clusters.

A Kernel based Possibilistic Approach for Clustering and Image Segmentation (클러스터링 및 영상 분할을 위한 커널 기반의 Possibilistic 접근 방법)

  • Choi, Kil-Soo;Choi, Byung-In;Rhee, Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.7
    • /
    • pp.889-894
    • /
    • 2004
  • The fuzzy kernel c-means (FKCM) algorithm, which uses a kernel function, can obtain more desirable clustering results than fuzzy c-means (FCM) for not only spherical data but also non-spherical data. However, it can be sensitive to noise as in the FCM algorithm. In this paper, a kernel function is applied to the possibilistic c-means (PCM) algorithm and is shown to be robust for data with additive noise. Several experimental results show that the proposed kernel possibilistic c-means (KPCM) algorithm out performs the FKCM algorithm for general data with additive noise.

A Design of Clustering Classification Systems using Satellite Remote Sensing Images Based on Design Patterns (디자인 패턴을 적용한 위성영상처리를 위한 군집화 분류시스템의 설계)

  • Kim, Dong-Yeon;Kim, Jin-Il
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.319-326
    • /
    • 2002
  • In this paper, we have designed and implemented cluttering classification systems- unsupervised classifiers-for the processing of satellite remote sensing images. Implemented systems adopt various design patterns which include a factory pattern and a strategy pattern to support various satellite images'formats and to design compatible systems. The clustering systems consist of sequential clustering, K-Means clustering, ISODATA clustering and Fuzzy C-Means clustering classifiers. The systems are tested by using a Landsat TM satellite image for the classification input. As results, these clustering systems are well designed to extract sample data for the classification of satellite images of which there is no previous knowledge. The systems can be provided with real-time base clustering tools, compatibilities and components' reusabilities as well.

Program Development of Integrated Expression Profile Analysis System for DNA Chip Data Analysis (DNA칩 데이터 분석을 위한 유전자발연 통합분석 프로그램의 개발)

  • 양영렬;허철구
    • KSBB Journal
    • /
    • v.16 no.4
    • /
    • pp.381-388
    • /
    • 2001
  • A program for integrated gene expression profile analysis such as hierarchical clustering, K-means, fuzzy c-means, self-organizing map(SOM), principal component analysis(PCA), and singular value decomposition(SVD) was made for DNA chip data anlysis by using Matlab. It also contained the normalization method of gene expression input data. The integrated data anlysis program could be effectively used in DNA chip data analysis and help researchers to get more comprehensive analysis view on gene expression data of their own.

  • PDF

A Novel Image Segmentation Method Based on Improved Intuitionistic Fuzzy C-Means Clustering Algorithm

  • Kong, Jun;Hou, Jian;Jiang, Min;Sun, Jinhua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3121-3143
    • /
    • 2019
  • Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

Fuzzy c-Means Clustering Algorithm with Pseudo Mahalanobis Distances

  • ICHIHASHI, Hidetomo;OHUE, Masayuki;MIYOSHI, Tetsuya
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.148-152
    • /
    • 1998
  • Gustafson and Kessel proposed a modified fuzzy c-Means algorithm based of the Mahalanobis distance. Though the algorithm appears more natural through the use of a fuzzy covariance matrix, it needs to calculate determinants and inverses of the c-fuzzy scatter matrices. This paper proposes a fuzzy clustering algorithm using pseudo mahalanobis distance, which is more easy to use and flexible than the Gustafson and Kessel's fuzzy c-Means.

  • PDF

A Study on Performance Evaluation of Clustering Algorithms using Neural and Statistical Method (클러스터링 성능평가: 신경망 및 통계적 방법)

  • 윤석환;신용백
    • Journal of the Korean Professional Engineers Association
    • /
    • v.29 no.2
    • /
    • pp.71-79
    • /
    • 1996
  • This paper evaluates the clustering performance of a neural network and a statistical method. Algorithms which are used in this paper are the GLVQ(Generalized Loaming vector Quantization) for a neural method and the k -means algorithm for a statistical clustering method. For comparison of two methods, we calculate the Rand's c statistics. As a result, the mean of c value obtained with the GLVQ is higher than that obtained with the k -means algorithm, while standard deviation of c value is lower. Experimental data sets were the Fisher's IRIS data and patterns extracted from handwritten numerals.

  • PDF

Automatic Extraction of Blood Flow Area in Brachial Artery for Suspicious Hypertension Patients from Color Doppler Sonography with Fuzzy C-Means Clustering

  • Kim, Kwang Baek;Song, Doo Heon;Yun, Sang-Seok
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.4
    • /
    • pp.258-263
    • /
    • 2018
  • Color Doppler sonography is a useful tool for examining blood flow and related indices. However, it should be done by well-trained operator, that is, operator subjectivity exists. In this paper, we propose an automatic blood flow area extraction method from brachial artery that would be an essential building block of computer aided color Doppler analyzer. Specifically, our concern is to examine hypertension suspicious (prehypertension) patients who might develop their symptoms to established hypertension in the future. The proposed method uses fuzzy C-means clustering as quantization engine with careful seeding of the number of clusters from histogram analysis. The experiment verifies that the proposed method is feasible in that the successful extraction rates are 96% (successful in 48 out of 50 test cases) and demonstrated better performance than K-means based method in specificity and sensitivity analysis but the proposed method should be further refined as the retrospective analysis pointed out.