• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.201-203
• /
• 2007

The paper concerns the successive optimization for structure and parameters of fuzzy inference systems that is based on parallel Genetic Algorithms (PGA) and information data granulation (IG). PGA is multi, population based genetic algorithms, and it is used tu optimize structure and parameters of fuzzy model simultaneously, The granulation is realized with the aid of the C-means clustering. The concept of information granulation was applied to the fuzzy model in order to enhance the abilities of structural optimization. By doing that, we divide the input space to form the premise part of the fuzzy rules and the consequence part of each fuzzy rule is newly' organized based on center points of data group extracted by the C-Means clustering, It concerns the fuzzy model related parameters such as the number of input variables to be used in fuzzy model. a collection of specific subset of input variables, the number of membership functions according to used variables, and the polynomial type of the consequence part of fuzzy rules, The simultaneous optimization mechanism is explored. It can find optimal values related to structure and parameter of fuzzy model via PGA, the C-means clustering and standard least square method at once. A comparative analysis demonstrates that the Dnmosed algorithm is superior to the conventional methods.

• 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.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.9-11
• /
• 2005

We propose a optimal identification of information granulation(IG)-based fuzzy model to carry out the model identification of complex and nonlinear systems. To optimally identity we use genetic algorithm (GAs) sand Hard C-Means (HCM) clustering. An initial structure of fuzzy model is identified by determining the number of input, the selected input variables, the number of membership function, and the conclusion inference type by means of GAs. Granulation of information 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 polynomial 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.158-161
• /
• 2004

Fuzzy Kernel C-Means(FKCM) 알고리즘은 커널 함수를 통하여 구형의 데이터뿐만 아니라 Fuzzy C-Means(FCM)에서는 분류하기 힘든 복잡한 형태의 분포를 갖는 데이터를 분류할 수 있다. 하지만 FCM과 같이 노이즈에 대해서는 민감한 성질을 가진다 이처럼 노이즈(noise)에 민감한 성질을 보완하기 위해서 본 논문에서는 Possibllistic C-Means 알고리즘에 커널 함수를 적용하였다. 본 논문에서 제안된 Kernel Possibilistic C-Means(KPCM) 알고리즘은 일반적인 데이터에 대해 FKCM과 같은 성능의 클러스터링 수행이 가능하며 노이즈가 있는 데이터에 대해서는 FKCM보다 더욱 정확한 클러스터링을 수행할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.17 no.3
• /
• pp.312-323
• /
• 2014

Voice activity detection is very important process that find voice activity from noisy speech signal for noise cancelling and speech enhancement. Over the past few years, many studies have been made on voice activity detection, it has poor performance for speech signal of sentence form in a low SNR environment. In this paper, it proposed new voice activity detection algorithm that has beginning VAD process using entropy and main VAD process using fuzzy membership shifted c-means clustering. We conduct an experiment in various SNR environment of white noise to evaluate performance of the proposed algorithm and confirmed good performance of the proposed algorithm.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.126-132
• /
• 2000

This paper presents a facial expression recognition based on Gabor wavelets that uses a fuzzy C-means(FCM) clustering algorithm and neural network. Features of facial expressions are extracted to two steps. In the first step, Gabor wavelet representation can provide edges extraction of major face components using the average value of the image's 2-D Gabor wavelet coefficient histogram. In the next step, we extract sparse features of facial expressions from the extracted edge information using FCM clustering algorithm. The result of facial expression recognition is compared with dimensional values of internal stated derived from semantic ratings of words related to emotion. The dimensional model can recognize not only six facial expressions related to Ekman's basic emotions, but also expressions of various internal states.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.6
• /
• pp.680-687
• /
• 1988

When only global or local features of images are considered, the segmented results exhibit inevitable errors. To reduce these errors, first we divide the image into uniform and nonuniform regions by considering the local properties of the image. Next we obtain the segmented results by applying the Fuzzy C-means (FCM) algorithm to the picture and determining to which uniform reigons each pixel of the nonuniform regions belongs. To reduce the computational burden and memory required for the FCM algorithm, the equations used for FCM algorithm are modified. The performance of the proposed method is quantitatively compared to existing ones using only global or local features of the picture. Computer simualtion result shows that the segmented results obtained by applying the proposed method are superior to existing ones.

• Journal of Sensor Science and Technology
• /
• v.13 no.6
• /
• pp.446-453
• /
• 2004

A portable electronic tongue (E-Tongue) system using an array of ion-selective electrode (ISE) and personal digital assistants (PDA) for recognizing and analyzing food and drink have been designed. By the employment of PDA, the complex algorithm such as fuzzy c-means algorithm (FCMA) could be used in E-Tongue, PUMA could iteratively solve the cluster centers of pre-determined standard patterns. And the membership between the standard patterns and unknown pattern could be analyzed easily by the present E-Tongue combined with PDA.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.17-30
• /
• 2021

At present, multiple input multiple output radars offer accurate target detection and better target parameter estimation with higher resolution in high-speed wireless communication systems. This study focuses primarily on power allocation to improve the performance of radars owing to the sparsity of targets in the spatial velocity domain. First, the radars are clustered using the kernel fuzzy C-means algorithm. Next, cooperative and noncooperative clusters are extracted based on the distance measured using the kernel fuzzy C-means algorithm. The power is allocated to cooperative clusters using the Pareto optimality particle swarm optimization algorithm. In addition, the Nash equilibrium particle swarm optimization algorithm is used for allocating power in the noncooperative clusters. The process of allocating power to cooperative and noncooperative clusters reduces the overall transmission power of the radars. In the experimental section, the proposed method obtained the power consumption of 0.014 to 0.0119 at K = 2, M = 3 and K = 2, M = 3, which is better compared to the existing methodologies-generalized Nash game and cooperative and noncooperative game theory.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.609-617
• /
• 2006

A new fuzzy c-regression algorithm for switching regression analysis is presented, which combines fuzzy c-means clustering and least squares support vector machine. This algorithm can detect outliers in switching regression models while yielding the simultaneous estimates of the associated parameters together with a fuzzy c-partitions of data. It can be employed for the model-free nonlinear regression which does not assume the underlying form of the regression function. We illustrate the new approach with some numerical examples that show how it can be used to fit switching regression models to almost all types of mixed data.