• 전자공학회논문지B
• /
• 제30B권1호
• /
• pp.72-78
• /
• 1993

While the rules for an expert system are obtained through the interviewing with domain experts or by designer's own experience, these are not adequate for fuzzy controllers dealing quantitative control values. In this paper, by considering a state of the controlled system as a pattern, we propose a method to obtain the control rules by a statistical method. Namely, we propose a method to obtain the control rules by a statistical method. Namely, we propose an rule acquisition method that is objective, mechanical, and inductive inference using a cluster-seeking algorithm, or K-means clustering algorithm. To validate this study, we show an example of an IRIS control in a CAMCODER and analyse the rules acquired from 98 sample patterns consisting of 45 features.

• 한국멀티미디어학회논문지
• /
• 제19권1호
• /
• pp.68-79
• /
• 2016

Electromyographic (EMG) signals have been widely used as motion commands of prosthetic arms. Although EMG signals contain meaningful information including the movement intentions of human body, it is difficult to predict the subject's motion by analyzing EMG signals in real-time due to the difficulties in extracting motion information from the signals including a lot of noises inherently. In this paper, four Ag/AgCl electrodes are placed on the surface of the subject's major muscles which are in charge of four upper arm movements (wrist flexion, wrist extension, ulnar deviation, finger flexion) to measure EMG signals corresponding to the movements. The measured signals are sampled using DAQ module and clustered sequentially. The Fuzzy C-Means (FCMs) method calculates the center values of the clustered data group. The fuzzy system designed to detect the upper arm movement intention utilizing the center values as input signals shows about 90% success in classifying the movement intentions.

• 산업기술연구
• /
• 제29권B호
• /
• pp.17-23
• /
• 2009

In many cases, clustering algorithms have been used for extracting and discovering useful information from non-linear data. They have made a great effect on performances of the systems dealing with non-linear data. Thus, this paper presents a new approach called hierarchically structured clustering algorithm, and it is applied to the prediction system for non-linear time series data. The proposed hierarchically structured clustering algorithm (called HCKA: Hierarchical Cross-correlation and K-means clustering Algorithms) in which the cross-correlation and k-means clustering algorithm are combined can accept the correlationship of non-linear time series as well as statistical characteristics. First, the optimal differences of data are generated, which can suitably reveal the characteristics of non-linear time series. Second, the generated differences are classified into the upper clusters for their predictors by the cross-correlation clustering algorithm, and then each classified differences are classified again into the lower fuzzy sets by the k-means clustering algorithm. As a result, the proposed method can give an efficient classification and improve the performance. Finally, we demonstrates the effectiveness of the proposed HCKA via typical time series examples.

• ETRI Journal
• /
• 제36권3호
• /
• pp.333-342
• /
• 2014

Most hyper-ellipsoidal clustering (HEC) approaches use the Mahalanobis distance as a distance metric. It has been proven that HEC, under this condition, cannot be realized since the cost function of partitional clustering is a constant. We demonstrate that HEC with a modified Gaussian kernel metric can be interpreted as a problem of finding condensed ellipsoidal clusters (with respect to the volumes and densities of the clusters) and propose a practical HEC algorithm that is able to efficiently handle clusters that are ellipsoidal in shape and that are of different size and density. We then try to refine the HEC algorithm by utilizing ellipsoids defined on the kernel feature space to deal with more complex-shaped clusters. The proposed methods lead to a significant improvement in the clustering results over K-means algorithm, fuzzy C-means algorithm, GMM-EM algorithm, and HEC algorithm based on minimum-volume ellipsoids using Mahalanobis distance.

• 한국컴퓨터정보학회논문지
• /
• 제18권8호
• /
• pp.27-31
• /
• 2013

본 논문에서는 요부 초음파 영상에서 퍼지 C-Means 클러스터링을 이용한 양자화 기법을 제안한다. 제안된 방법은 초음파 영상에서 나타난 명암도를 이용하여 n개의 그룹으로 클러스터링한다. 그리고 각클러스터의 중심 값을 기준으로 정렬한 뒤, 각 그룹에 지정된 색상을 요부 초음파 영상에 나타낸다. 본 논문에서 제안하는 기법과 히스토그램 기반 양자화 기법에 대해 15장의 요부 초음파 영상에 적용한 결과, 본 논문에서 제안된 양자화 방법이 효과적인 것을 확인할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.159-162
• /
• 2000

In this paper, we propose an efficient method to detect shot changes in compressed MPEG video data by using reference features among video frames. The reference features among video frames imply the similarities among adjacent frames by prediction coded type of each frame. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. And the shot change detection algorithm is improved by using Fuzzy c-means (FCM) clustering algorithm. The FCM clustering algorithm uses the shot change probabilities evaluated in the mask matching of reference ratios and difference measure values based on frame reference ratios.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
• /
• 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에 의해서 보정된다. 본 논문에서는 모델을 설계함에 있어서 체계적인 설계 알고리즘을 포괄적으로 설명하고 있으며 더 나아가 제안된 모델의 성능을 다른 표준적인 모델들과 대조함으로써 제안된 모델의 우수성을 나타내고자 한다.

• 디지털융복합연구
• /
• 제14권1호
• /
• pp.203-209
• /
• 2016

본 논문에서는 퍼지 클러스터를 이용한 비선형 추론을 위한 퍼지 추론 시스템을 소개한다. 전형적으로, 비선형 추론을 위한 퍼지 규칙의 생성은 일반적으로 입력 벡터 차원이 증가하면 규칙의 수가 지수적으로 증가하게 된다. 이러한 문제점을 해결하기 위해, 퍼지 클러스터를 표현할 수 있는 퍼지 클러스터링 알고리즘을 이용하여 입력 벡터 공간을 분산 형태로 분할하여 퍼지 모델의 규칙을 설계한다. 이러한 방법으로 복잡하고 비선형적인 공정을 퍼지 모델링 할 수 있다. 퍼지 규칙의 전반부는 퍼지 클러스터를 갖는 FCM 클러스터링 알고리즘에 의해 결정된다. 퍼지 규칙의 후반부는 4가지 형태의 다항식 함수의 형태를 가지며, 각 규칙의 후반부 파라미터들은 표준 최소자승법을 이용함으로써 추정된다. 그리고 비선형 공정의 특성 및 성능을 평가하기 위하여 비선형 공정으로 많이 이용되고 있는 데이터를 이용한다. 실험 결과는 비선형 추론이 가능하다는 것을 보여준다.

• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.273-283
• /
• 2000

In this paper we suggest an optimal design method of Fuzzy-Neural Networks(FNN) model for complex and nonlinear systems. The FNNs use the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM(Hard C-Means) Clustering Algorithm to find initial parameters of the membership function. The parameters such as parameters of membership functions learning rates and momentum weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. According to selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity (distribution of I/O data we show that it is available and effective to design and optimal FNN model structure with a mutual balance and dependency between approximation and generalization abilities. This methodology sheds light on the role and impact of different parameters of the model on its performance (especially the mapping and predicting capabilities of the rule based computing). To evaluate the performance of the proposed model we use the time series data for gas furnace the data of sewage treatment process and traffic route choice process.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.3019-3021
• /
• 2000

In this paper. a new fuzzy modeling algorithm is proposed : it can express a given unknown system with a small number of fuzzy rules and be easily implemented. This method uses an independent array instead of a lattice form for a premise membership function. For the purpose of getting the initial value of fuzzy rules. the method uses the fuzzy c-means clustering method. To optimally tune the initial fuzzy rule. the DNA coding method is also utilized at same time. Box and Jenkins's gas furnace data is used to illustrate the validity of the proposed algorithm.