• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.241-242
• /
• 2008

본 논문에서는 fuzzy granular computing 방법 중의 하나인 context-based FCM을 이용하여 granular-based radial basis function neural network에 대한 기본적인 개면과 그들의 포괄적인 설계 구조에 대해서 자세히 기술한다. 제안된 모델에 기본이 되는 설계 도구는 context-based fuzzy c-means (C-FCM)로 알려진 fuzzy clustering에 초점이 맞춰져 있으며, 이는 주어진 데이터의 특징에 맞게 공간을 분할함으로써 효율적으로 모델을 구축할 수가 있다. 제안된 모델의 설계 공정은 1) Context fuzzy set에 대한 정의와 설계, 2) Context-based fuzzy clustering에 대한 모델의 적용과 이에 따른 모델 구축의 효율성, 3) 입력과 출력공간에서의 연결된 information granule에 대한 parameter(다항식의 계수들)에 대한 최적화와 같은 단계로 구성되어 있다. Information granule에 대한 parameter들은 성능지수를 최소화하기 위해 Least square method에 의해서 보정된다. 본 논문에서는 모델을 설계함에 있어서 체계적인 설계 알고리즘을 포괄적으로 설명하고 있으며 더 나아가 제안된 모델의 성능을 다른 표준적인 모델들과 대조함으로써 제안된 모델의 우수성을 나타내고자 한다.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.343-345
• /
• 2004

We propose a new category of fuzzy set-based fuzzy inference systems based on data granulation related to fuzzy space division for each variables. Data granules are viewed as linked collections of objects(data, in particular) drawn together by the criteria of proximity, similarity, or functionality. Granulation of data with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polyminial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method. Numerical example is included to evaluate the performance of the proposed model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.1-8
• /
• 2006

This paper proposes an improved FCM(Fuzzy C-means) algorithm using intercluster and entropy-based weight in gray image. The fuzzy clustering methods have been extensively used in the image segmentation since it extracts feature information of the region. Most of fuzzy clustering methods have used the FCM algorithm. But, FCM algorithm is still sensitive to noise, as it does not include spatial information. In addition, it can't correctly classify pixels according to the feature-based distributions of clusters. To solve these problems, we applied a weight and intercluster to the traditional FCM algorithm. A weight is obtained from the entropy information based on the cluster's number of neighboring pixels. And a membership for one pixel is given based on the information considering the feature-based intercluster. Experiments has confirmed that the proposed method was more tolerant to noise and superior to existing methods.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.27-31
• /
• 2013

In this paper, we propose a new quantization method using fuzzy C-means clustering(FCM) for lumbar ultrasound image recognition. Unlike usual histogram based quantization, our method first classifies regions into 10 clusters and sorts them by the central value of each cluster. Those clusters are represented with different colors. This method is efficient to handle lumbar ultrasound image since in this part of human body, the brightness values are distributed to doubly skewed histogram in general thus the usual histogram based quantization is not strong to extract different areas. Experiment conducted with 15 real lumbar images verified the efficacy of proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1181-1186
• /
• 1993

In the paper, a new design method of rule-based fuzzy modeling is proposed for model identification of nonlinear systems. The structure indentification is carried out, utilizing fuzzy c-means clustering. Fuzzy-neural networks composed back-propagation algorithm and linear fuzzy inference method, are used to identify parameters of the premise and consequence parts. To obtain optimal linguistic fuzzy implication rules, the learning rates and momentum coefficients are tuned automatically using a modified complex method.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.118-121
• /
• 1996

This paper describes ECG signal labeling based on Fuzzy clustering, which is necessary at automated ECG diagnosis. The NPPA(Non parametric partitioning algorithm) compares the correlations of wave forms, which tends to recognize the same wave forms as different when the wave forms have a little morphological variation. We propose to apply Fuzzy clustering to ECG QRS Complex labeling, which prevents the errors to mistake by using If-then comparision. The process is divided into two parts. The first part is a parameters extraction process from ECG signal, which is composed of filtering, QRS detection by mapping to a phase space by time delay coordinates and generation of characteristic vectors. The second is fuzzy clustering by FCM(Fuzzy c-means), which is composed of a clustering, an assessment of cluster validity and labeling.

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.965-980
• /
• 2011

In this paper, the use of conditional Fuzzy C-Means (CFCM) aimed at estimation of desired states of an unknown digital communication channel is investigated for blind channel equalization. In the proposed CFCM, a collection of clustered centers is treated as a set of pre-defined desired channel states, and used to extract channel output states. By considering the combinations of the extracted channel output states, all possible sets of desired channel states are constructed. The set of desired states characterized by the maximal value of the Bayesian fitness function is subsequently selected for the next fuzzy clustering epoch. This modification of CFCM makes it possible to search for the optimal desired channel states of an unknown channel. Finally, given the desired channel states, the Bayesian equalizer is implemented to reconstruct transmitted symbols. In a series of simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The experimental studies demonstrate that the performance (being expressed in terms of accuracy and speed) of the proposed CFCM is superior to the performance of the existing method exploiting the "conventional" Fuzzy C-Means (FCM).

• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.3
• /
• pp.138-142
• /
• 2005

In this paper, we compared recognition rates between NN(neural networks) and clustering method as a scheme of off-line PD(partial discharge) diagnosis which occurs at the stator coil of traction motor. To acquire PD data, three defective models are made. PD data for classification were acquired from PD detector. And then statistical distributions are calculated to classify model discharge sources. These statistical distributions were applied as input data of two classification tools, BP(Back propagation algorithm) and ANFIS(adaptive network based fuzzy inference system) pre-processed FCM(fuzzy c-means) clustering method. So, classification rate of BP were somewhat higher than ANFIS. But other items of ANFIS were better than BP; learning time, parameter number, simplicity of algorithm.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.340-342
• /
• 2004

In this paper, we introduce a new category of fuzzy inference systems baled on information granulation to carry out the model identification of complex and nonlinear systems. Informal speaking, information granules are viewed as linked collections of objects(data, in particular) drawn together by the criteria of proximity, similarity, or functionality. Granulation of information with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polyminial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method. The proposed model is contrasted with the performance of the conventional fuzzy models in the literature.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.109-112
• /
• 1999

Image segmentation is the critical first step in image information extraction for computer vision systems. Clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are divided from the fuzzy c-means(FCM) algorithm. The FCM algorithm uses fie probabilistic 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 belonging or compatibility. Moreover, the FCM algorithm has considerable trouble under noisy environments in the feature space. Recently, a possibilistic approach to clustering(PCM) for solving above problems was proposed. In this paper, we used the PCM for color image segmentation. This approach differs from existing fuzzy clustering methods for color image segmentation in that the resulting partition of the data can be interpreted as a possibilistic partition. So, the problems in the FCM can be solved by the PCM. But, the clustering results by the PCM are not smoothly bounded, and they often have holes. The region growing was used as a postprocessing after smoothing the noise points in the pixel seeds. In our experiments, we illustrate that the PCM us reasonable than the FCM in noisy environments.