• Title/Summary/Keyword: FCM Clustering

Search Result 222, Processing Time 0.037 seconds

Facial Expression Recognition with Fuzzy C-Means Clusstering Algorithm and Neural Network Based on Gabor Wavelets

  • Youngsuk Shin;Chansup Chung;Lee, Yillbyung
    • 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.

  • PDF

Design of Genetically Optimized Context-based RBFNN (진화론적으로 최적화된 Context-based RBF 뉴럴 네트워크 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun;Kim, Hyun-Ki
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.258-260
    • /
    • 2009
  • 본 논문에서는 최적화 알고리즘인 유전자 알고리즘과 context-based FCM 클러스터링 방법을 이용하여 새로운 형태의 RBF 뉴럴 네트워크의 포괄적인 설계 방법론을 소개한다. 제안된 구조는 클러스터링 기법을 기반하여 사용된 데이터의 특성에 효과적인 모델을 구축하고자 한다. 또한 유전자 알고리즘을 이용하여 모델의 최적화에 주요한 영향을 미치는 파리미터들(-은닉층에서의 contex의 수, contex에 포괄되는 노드의 수, 그리고 contex에 입력되는 입력변수)을 동조한다. 제안된 모델의 설계 공정은 1) K-means 클러스터링을 통한 context fuzzy set에 대한 정의와 설계, 2) context-based fuzzy clustering에 대한 모델의 적용과 이에 따른 모델 구축의 효율성, 3) 유전자 알고리즘을 통한 모델 최적화를 위한 파라미터들의 최적화와 같은 단계로 구성되어 있다. 구축된 RBF 뉴럴 네트워크의 후반부 다항식에 대한 parameter들은 성능지수를 최소화하기 위해 Least Square Method에 의해서 보정된다. 본 논문에서는 모델을 설계함에 있어서 체계적인 설계 알고리즘을 포괄적으로 설명하고 있으며, 더 나아가 제안된 모델의 성능을 다른 표준적인 모델들과 대조함으로써 제안된 모델의 우수성을 나타내고자 한다.

  • PDF

Nonlinear damage detection using higher statistical moments of structural responses

  • Yu, Ling;Zhu, Jun-Hua
    • Structural Engineering and Mechanics
    • /
    • v.54 no.2
    • /
    • pp.221-237
    • /
    • 2015
  • An integrated method is proposed for structural nonlinear damage detection based on time series analysis and the higher statistical moments of structural responses in this study. It combines the time series analysis, the higher statistical moments of AR model residual errors and the fuzzy c-means (FCM) clustering techniques. A few comprehensive damage indexes are developed in the arithmetic and geometric mean of the higher statistical moments, and are classified by using the FCM clustering method to achieve nonlinear damage detection. A series of the measured response data, downloaded from the web site of the Los Alamos National Laboratory (LANL) USA, from a three-storey building structure considering the environmental variety as well as different nonlinear damage cases, are analyzed and used to assess the performance of the new nonlinear damage detection method. The effectiveness and robustness of the new proposed method are finally analyzed and concluded.

Tire Tread Pattern Classification Using Fuzzy Clustering Algorithm (퍼지 클러스터링 알고리즘을 이용한 타이어 접지면 패턴의 분류)

  • Kang, Yoon-Kwan;Jung, Soon-Won;Bae, Sang-Wook;Park, Tae-Hong;Kim, Min-Gi;Park, Gwi-Tae
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.439-441
    • /
    • 1993
  • A tire tread pattern recognition scheme of which the pattern recognition algorithm is designed based on the fuzzy hierarchical clustering method is proposed and compared with the scheme based on the conventional FCM. The features are extracted from the binary images of the tire tread patterns. In the proposed scheme, the protoypes are obtained more easily and schematically than obtained prototypes using FCM. The experimental results of classification for the practical situations are given and shows the usefulness of the proposed scheme.

  • PDF

A Kernel based Possibilistic C-Means Clustering Algorithm (커널 기반의 Possibilistic C-Means 클러스터링 알고리즘)

  • 최길수;최병인;이정훈
    • 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보다 더욱 정확한 클러스터링을 수행할 수 있다.

  • PDF

An Approximate Query Answering Method using a Knowledge Representation Approach (지식 표현 방식을 이용한 근사 질의응답 기법)

  • Lee, Sun-Young;Lee, Jong-Yun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3689-3696
    • /
    • 2011
  • In decision support system, knowledge workers require aggregation operations of the large data and are more interested in the trend analysis rather than in the punctual analysis. Therefore, it is necessary to provide fast approximate answers rather than exact answers, and to research approximate query answering techniques. In this paper, we propose a new approximation query answering method which is based on Fuzzy C-means clustering (FCM) method and Adaptive Neuro-Fuzzy Inference System (ANFIS). The proposed method using FCM-ANFIS can compute aggregate queries without accessing massive multidimensional data cube by producing the KR model of multidimensional data cube. In our experiments, we show that our method using the KR model outperforms the NMF method.

Modeling and Classification of MPEG VBR Video Data using Gradient-based Fuzzy c_means with Divergence Measure (분산 기반의 Gradient Based Fuzzy c-means 에 의한 MPEG VBR 비디오 데이터의 모델링과 분류)

  • 박동철;김봉주
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.931-936
    • /
    • 2004
  • GBFCM(DM), Gradient-based Fuzzy c-means with Divergence Measure, for efficient clustering of GPDF(Gaussian Probability Density Function) in MPEG VBR video data modeling is proposed in this paper. The proposed GBFCM(DM) is based on GBFCM( Gradient-based Fuzzy c-means) with the Divergence for its distance measure. In this paper, sets of real-time MPEG VBR Video traffic data are considered. Each of 12 frames MPEG VBR Video data are first transformed to 12-dimensional data for modeling and the transformed 12-dimensional data are Pass through the proposed GBFCM(DM) for classification. The GBFCM(DM) is compared with conventional FCM and GBFCM algorithms. The results show that the GBFCM(DM) gives 5∼15% improvement in False Alarm Rate over conventional algorithms such as FCM and GBFCM.

Regional Grouping of the interconnected network system through Sequential Clustering (순차적 클러스터링을 이용한 지역별 그룹핑)

  • Kim, Hyun-Hong;Song, Hyoung-Yong;Kim, Jin-Ho;Park, Jong-Bae;Shin, Jung-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2007.11b
    • /
    • pp.252-254
    • /
    • 2007
  • This paper introduces the method of sequential clustering as a tool for the effective clustering of mass unit electrical systems. The interconnected network system retains information about the location of each line. With this information, this paper aims to carry out initial clustering through the transmission usage rate, compare the results of similarity measures for regional information with similarity measures for regional price, and introduce the technicalities of the clustering method. This transmission usage rate used power flow based on congestion costs and modified similarity measurements using the FCM algorithm. This paper also aims to prove the propriety of the proposed clustering method by comparing it with existing clustering methods that use the similarity measurement system. The proposed algorithm is demonstrated through the IEEE 39-bus RTS.

  • PDF

Character Extraction Using Wavelet Transform and Fuzzy Clustering (웨이브렛 변환과 퍼지 군집화를 활용한 문자추출)

  • Hwang, Jung-Won;Hwang, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.93-100
    • /
    • 2007
  • In this paper, a novel approach based on wavelet transform is proposed to process the scraped character which is represented on digital image. The basis idea is that the scraped character is described by its textured neighborhood, and it is decomposed into multiresolution features at different levels with its background region. The image is first decomposed into sub bands by applying Daubechies wavelets. Character features are extracted from the low frequency sub-bands by partition, FCM clustering and area-based region process. High frequency ones are activated by applying local energy density over a moving mask. Features are synthesized in order to reconstruct the original image state through inverse wavelet transform Background region is eliminated and character is extracted. The experimental results demonstrate the effectiveness of the proposed method.

Design and Analysis of TSK Fuzzy Inference System using Clustering Method (클러스터링 방법을 이용한 TSK 퍼지추론 시스템의 설계 및 해석)

  • Oh, Sung-Kwun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.3
    • /
    • pp.132-136
    • /
    • 2014
  • We introduce a new architecture of TSK-based fuzzy inference system. The proposed model used fuzzy c-means clustering method(FCM) for efficient disposal of data. The premise part of fuzzy rules don't assume any membership function such as triangular, gaussian, ellipsoidal because we construct the premise part of fuzzy rules using FCM. As a result, we can reduce to architecture of model. In this paper, we are able to use four types of polynomials as consequence part of fuzzy rules such as simplified, linear, quadratic, modified quadratic. Weighed Least Square Estimator are used to estimates the coefficients of polynomial. The proposed model is evaluated with the use of Boston housing data called Machine Learning dataset.