• Title/Summary/Keyword: Fuzzy C-Mean clustering

Search Result 60, Processing Time 0.037 seconds

Segmentation of Color Image by Subtractive and Gravity Fuzzy C-means Clustering (차감 및 중력 fuzzy C-means 클러스터링을 이용한 칼라 영상 분할에 관한 연구)

  • Jin, Young-Goun;Kim, Tae-Gyun
    • Journal of IKEEE
    • /
    • v.1 no.1 s.1
    • /
    • pp.93-100
    • /
    • 1997
  • In general, fuzzy C-means clustering method was used on the segmentation of true color image. However, this method requires number of clusters as an input. In this study, we suggest new method that uses subtractive and gravity fuzzy C-means clustering. We get number of clusters and initial cluster centers by applying subtractive clustering on color image. After coarse segmentation of the image, we apply gravity fuzzy C-means for optimizing segmentation of the image. We show efficiency of the proposed algorithm by qualitative evaluation.

  • PDF

An Watermarking Method based on Singular Vector Decomposition and Vector Quantization using Fuzzy C-Mean Clustering (특이치 분해와 Fuzzy C-Mean(FCM) 군집화를 이용한 벡터양자화에 기반한 워터마킹 방법)

  • Lee, Byeong-Hui;Jang, U-Seok;Gang, Hwan-Il
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.267-271
    • /
    • 2007
  • 본 논문은 원본이미지와 은닉이미지의 좋은 압축률과 만족할만한 이미지의 질, 그리고 외부공격에 강인한 이미지은닉의 한 방법으로 특이치 분해와 퍼지 군집화를 이용한 벡터양자화를 이용한 워터마킹 방법을 소개하였다. 실험에서는 은닉된 이미지의 비가시성과 외부공격에 대한 강인성을 증명하였다.

  • PDF

Color image segmentation using the possibilistic C-mean clustering and region growing (Possibilistic C-mean 클러스터링과 영역 확장을 이용한 칼라 영상 분할)

  • 엄경배;이준환
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.97-107
    • /
    • 1997
  • Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

  • PDF

An Overview of Unsupervised and Semi-Supervised Fuzzy Kernel Clustering

  • Frigui, Hichem;Bchir, Ouiem;Baili, Naouel
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.13 no.4
    • /
    • pp.254-268
    • /
    • 2013
  • For real-world clustering tasks, the input data is typically not easily separable due to the highly complex data structure or when clusters vary in size, density and shape. Kernel-based clustering has proven to be an effective approach to partition such data. In this paper, we provide an overview of several fuzzy kernel clustering algorithms. We focus on methods that optimize an fuzzy C-mean-type objective function. We highlight the advantages and disadvantages of each method. In addition to the completely unsupervised algorithms, we also provide an overview of some semi-supervised fuzzy kernel clustering algorithms. These algorithms use partial supervision information to guide the optimization process and avoid local minima. We also provide an overview of the different approaches that have been used to extend kernel clustering to handle very large data sets.

An Watermarking Method Based on Singular Vector Decomposition and Vector Quantization Using Fuzzy C-Mean Clustering (특이치 분해와 Fuzzy C-Mean(FCM) 군집화를 이용한 벡터양자화에 기반한 워터마킹 방법)

  • Lee, Byung-Hee;Jang, Woo-Seok;Kang, Hwan-Il
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.964-969
    • /
    • 2007
  • In this paper, we propose the image watermarking method for good compression ratio and satisfactory image quality of the cover image and the embedding image. This method is based on the singular value decomposition and the vector quantization using fuzzy c-mean clustering. Experimental results show that the embedding image has invisibility and robustness to various serious attacks. The advantage of this watermarking method is that we can achieve both the compression and the watermarking method for the copyright protection simultaneously.

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of Fuzzy ART Neural Networks

  • Seo, Kwang-Kyu;Park, Ji-Hyung
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.12
    • /
    • pp.2137-2147
    • /
    • 2004
  • The recycling cell formation problem means that disposal products are classified into recycling part families using group technology in their end-of-life phase. Disposal products have the uncertainties of product status by usage influences during product use phase, and recycling cells are formed design, process and usage attributes. In order to deal with the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem for disposal products. Fuzzy C-mean algorithm and a heuristic approach based on fuzzy ART neural network is suggested. Especially, the modified Fuzzy ART neural network is shown that it has a good clustering results and gives an extension for systematically generating alternative solutions in the recycling cell formation problem. Disposal refrigerators are shown as examples.

Improved Classification Algorithm using Extended Fuzzy Clustering and Maximum Likelihood Method

  • Jeon Young-Joon;Kim Jin-Il
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.447-450
    • /
    • 2004
  • This paper proposes remotely sensed image classification method by fuzzy c-means clustering algorithm using average intra-cluster distance. The average intra-cluster distance acquires an average of the vector set belong to each cluster and proportionates to its size and density. We perform classification according to pixel's membership grade by cluster center of fuzzy c-means clustering using the mean-values of training data about each class. Fuzzy c-means algorithm considered membership degree for inter-cluster of each class. And then, we validate degree of overlap between clusters. A pixel which has a high degree of overlap applies to the maximum likelihood classification method. Finally, we decide category by comparing with fuzzy membership degree and likelihood rate. The proposed method is applied to IKONOS remote sensing satellite image for the verifying test.

  • PDF

Evaluation of Subtractive Clustering based Adaptive Neuro-Fuzzy Inference System with Fuzzy C-Means based ANFIS System in Diagnosis of Alzheimer

  • Kour, Haneet;Manhas, Jatinder;Sharma, Vinod
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.87-90
    • /
    • 2019
  • Machine learning techniques have been applied in almost all the domains of human life to aid and enhance the problem solving capabilities of the system. The field of medical science has improved to a greater extent with the advent and application of these techniques. Efficient expert systems using various soft computing techniques like artificial neural network, Fuzzy Logic, Genetic algorithm, Hybrid system, etc. are being developed to equip medical practitioner with better and effective diagnosing capabilities. In this paper, a comparative study to evaluate the predictive performance of subtractive clustering based ANFIS hybrid system (SCANFIS) with Fuzzy C-Means (FCM) based ANFIS system (FCMANFIS) for Alzheimer disease (AD) has been taken. To evaluate the performance of these two systems, three parameters i.e. root mean square error (RMSE), prediction accuracy and precision are implemented. Experimental results demonstrated that the FCMANFIS model produce better results when compared to SCANFIS model in predictive analysis of Alzheimer disease (AD).

An Watermarking Method based on Singular Vector Decomposition and Vector Quantization using Fuzzy C-Mean Clustering (특이치 분해와 Fuzzy C-Mean(FCM) 클러스터링을 이용한 벡터양자화에 기반한 워터마킹 방법)

  • Lee, Byung-Hee;Kang, Hwan-Il;Jang, Woo-Seok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.7-11
    • /
    • 2007
  • In this paper the one of image hide method for good compression ratio and satisfactory image quality of the cover image and the embedding image based on the singular value decomposition and the vector quantization using fuzzy c-mean clustering is introduced. Experimental result shows that the embedding image has invisibility and robustness to various serious attacks.

  • PDF

A Study on Data Clustering Method Using Local Probability (국부 확률을 이용한 데이터 분류에 관한 연구)

  • Son, Chang-Ho;Choi, Won-Ho;Lee, Jae-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.1
    • /
    • pp.46-51
    • /
    • 2007
  • In this paper, we propose a new data clustering method using local probability and hypothesis theory. To cluster the test data set we analyze the local area of the test data set using local probability distribution and decide the candidate class of the data set using mean standard deviation and variance etc. To decide each class of the test data, statistical hypothesis theory is applied to the decided candidate class of the test data set. For evaluating, the proposed classification method is compared to the conventional fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm. The simulation results show more accuracy than results of fuzzy c-mean method, k-means algorithm and Discriminator analysis algorithm.