• Title/Summary/Keyword: fuzzy K means

Search Result 430, Processing Time 0.027 seconds

User Satisfaction Models Based on a Fuzzy Rule-Based Modeling Approach (퍼지 규칙 기반 모델링 기법을 이용한 감성 만족도 모델 개발)

  • Park, Jungchul;Han, Sung H.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.3
    • /
    • pp.331-343
    • /
    • 2002
  • This paper proposes a fuzzy rule-based model as a means to build usability models between emotional satisfaction and design variables of consumer products. Based on a subtractive clustering algorithm, this model obtains partially overlapping rules from existing data and builds multiple local models each of which has a form of a linear regression equation. The best subset procedure and cross validation technique are used to select appropriate input variables. The proposed technique was applied to the modeling of luxuriousness, balance, and attractiveness of office chairs. For comparison, regression models were built on the same data in two different ways; one using only potentially important variables selected by the design experts, and the other using all the design variables available. The results showed that the fuzzy rule-based model had a great benefit in terms of the number of variables included in the model. They also turned out to be adequate for predicting the usability of a new product. Better yet, the information on the product classes and their satisfaction levels can be obtained by interpreting the rules. The models, when combined with the information from the regression models, are expected to help the designers gain valuable insights in designing a new product.

Design of Robust Face Recognition System Realized with the Aid of Automatic Pose Estimation-based Classification and Preprocessing Networks Structure

  • Kim, Eun-Hu;Kim, Bong-Youn;Oh, Sung-Kwun;Kim, Jin-Yul
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.6
    • /
    • pp.2388-2398
    • /
    • 2017
  • In this study, we propose a robust face recognition system to pose variations based on automatic pose estimation. Radial basis function neural network is applied as one of the functional components of the overall face recognition system. The proposed system consists of preprocessing and recognition modules to provide a solution to pose variation and high-dimensional pattern recognition problems. In the preprocessing part, principal component analysis (PCA) and 2-dimensional 2-directional PCA ($(2D)^2$ PCA) are applied. These functional modules are useful in reducing dimensionality of the feature space. The proposed RBFNNs architecture consists of three functional modules such as condition, conclusion and inference phase realized in terms of fuzzy "if-then" rules. In the condition phase of fuzzy rules, the input space is partitioned with the use of fuzzy clustering realized by the Fuzzy C-Means (FCM) algorithm. In conclusion phase of rules, the connections (weights) are realized through four types of polynomials such as constant, linear, quadratic and modified quadratic. The coefficients of the RBFNNs model are obtained by fuzzy inference method constituting the inference phase of fuzzy rules. The essential design parameters (such as the number of nodes, and fuzzification coefficient) of the networks are optimized with the aid of Particle Swarm Optimization (PSO). Experimental results completed on standard face database -Honda/UCSD, Cambridge Head pose, and IC&CI databases demonstrate the effectiveness and efficiency of face recognition system compared with other studies.

A Study on Static Situation Awareness System with the Aid of Optimized Polynomial Radial Basis Function Neural Networks (최적화된 pRBF 뉴럴 네트워크에 의한 정적 상황 인지 시스템에 관한 연구)

  • Oh, Sung-Kwun;Na, Hyun-Suk;Kim, Wook-Dong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.12
    • /
    • pp.2352-2360
    • /
    • 2011
  • In this paper, we introduce a comprehensive design methodology of Radial Basis Function Neural Networks (RBFNN) that is based on mechanism of clustering and optimization algorithm. We can divide some clusters based on similarity of input dataset by using clustering algorithm. As a result, the number of clusters is equal to the number of nodes in the hidden layer. Moreover, the centers of each cluster are used into the centers of each receptive field in the hidden layer. In this study, we have applied Fuzzy-C Means(FCM) and K-Means(KM) clustering algorithm, respectively and compared between them. The weight connections of model are expanded into the type of polynomial functions such as linear and quadratic. In this reason, the output of model consists of relation between input and output. In order to get the optimal structure and better performance, Particle Swarm Optimization(PSO) is used. We can obtain optimized parameters such as both the number of clusters and the polynomial order of weights connection through structural optimization as well as the widths of receptive fields through parametric optimization. To evaluate the performance of proposed model, NXT equipment offered by National Instrument(NI) is exploited. The situation awareness system-related intelligent model was built up by the experimental dataset of distance information measured between object and diverse sensor such as sound sensor, light sensor, and ultrasonic sensor of NXT equipment.

An Improved Automated Spectral Clustering Algorithm

  • Xiaodan Lv
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.185-199
    • /
    • 2024
  • In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

Spatial Focalization of Zen-Meditation Brain Based on EEG

  • Liu, Chuan-Yi;Lo, Pei-Chen
    • Journal of Biomedical Engineering Research
    • /
    • v.29 no.1
    • /
    • pp.17-24
    • /
    • 2008
  • The aim of this paper is to report our preliminary results of investigating the spatial focalization of Zen-meditation EEG (electroencephalograph) in alpha band (8-13 Hz). For comparison, the study involved two groups of subjects, practitioners (experimental group) and non-practitioners (control group). To extract EEG alpha rhythm, wavelet analysis was applied to multi-channel EEG signals. Normalized alpha-power vectors were then constructed from spatial distribution of alpha powers, that were classified by Fuzzy C-means based algorithm to explore various brain spatial characteristics during meditation (or, at rest). Optimal number of clusters was determined by correlation coefficients of the membership-value vectors of each cluster center. Our results show that, in the experimental group, the incidence of frontal alpha activity varied in accordance with the meditation stage. The results demonstrated three different spatiotemporal modules consisting with three distinctive meditation stages normally recognized by meditation practitioners. The frontal alpha activity in two groups decreased in different ways. Particularly, monotonic decline was observed in the control group, and the experimental group showed increasing results. The phenomenon might imply various mechanisms employed by meditation and relaxation in modulating parietal alpha.

An Image Segmentation Method and Similarity Measurement Using fuzzy Algorithm for Object Recognition (물체인식을 위한 영상분할 기법과 퍼지 알고리듬을 이용한 유사도 측정)

  • Kim, Dong-Gi;Lee, Seong-Gyu;Lee, Moon-Wook;Kang, E-Sok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.2
    • /
    • pp.125-132
    • /
    • 2004
  • In this paper, we propose a new two-stage segmentation method for the effective object recognition which uses region-growing algorithm and k-means clustering method. At first, an image is segmented into many small regions via region growing algorithm. And then the segmented small regions are merged in several regions so that the regions of an object may be included in the same region using typical k-means clustering method. This paper also establishes similarity measurement which is useful for object recognition in an image. Similarity is measured by fuzzy system whose input variables are compactness, magnitude of biasness and orientation of biasness of the object image, which are geometrical features of the object. To verify the effectiveness of the proposed two-stage segmentation method and similarity measurement, experiments for object recognition were made and the results show that they are applicable to object recognition under normal circumstance as well as under abnormal circumstance of being.

Designing Tracking Method using Compensating Acceleration with FCM for Maneuvering Target (FCM 기반 추정 가속도 보상을 이용한 기동표적 추적기법 설계)

  • Son, Hyun-Seung;Park, Jin-Bae;Joo, Young-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.3
    • /
    • pp.82-89
    • /
    • 2012
  • This paper presents the intelligent tracking algorithm for maneuvering target using the positional error compensation of the maneuvering target. The difference between measured point and predict point is separated into acceleration and noise. Fuzzy c-mean clustering and predicted impact point are used to get the optimal acceleration value. The membership function is determined for acceleration and noise which are divided by fuzzy c-means clustering and the characteristics of the maneuvering target is figured out. Divided acceleration and noise are used in the tracking algorithm to compensate computational error. The filtering process in a series of the algorithm which estimates the target value recognize the nonlinear maneuvering target as linear one because the filter recognize only remained noise by extracting acceleration from the positional error. After filtering process, we get the estimates target by compensating extracted acceleration. The proposed system improves the adaptiveness and the robustness by adjusting the parameters in the membership function of fuzzy system. To maximize the effectiveness of the proposed system, we construct the multiple model structure. Procedures of the proposed algorithm can be implemented as an on-line system. Finally, some examples are provided to show the effectiveness of the proposed algorithm.

Backlit Region Detection Using Adaptively Partitioned Block and Fuzzy C-means Clustering for Backlit Image Enhancement (역광 영상 개선을 위한 퍼지 C-평균 분류기와 적응적 블록 분할을 사용한 역광 영역 검출)

  • Kim, Nahyun;Lee, Seungwon;Paik, Joonki
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.124-132
    • /
    • 2014
  • In this paper, we present a novel backlit region detection and contrast enhancement method using fuzzy C-means clustering and adaptively partitioned block based contrast stretching. The proposed method separates an image into both dark backlit and bright background regions using adaptively partitioned blocks based on the optimal threshold value computed by fuzzy logic. The detected block-wise backlit region is refined using the guided filter for removing block artifacts. Contrast stretching algorithm is then applied to adaptively enhance the detected backlit region. Experimental results show that the proposed method can successfully detect the backlit region without a complicated segmentation algorithm and enhance the object information in the backlit region.

MRI Data Segmentation Using Fuzzy C-Mean Algorithm with Intuition (직관적 퍼지 C-평균 모델을 이용한 자기 공명 영상 분할)

  • Kim, Tae-Hyun;Park, Dong-Chul;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.191-197
    • /
    • 2011
  • An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

Speaker-Adaptive Speech Synthesis based on Fuzzy Vector Quantizer Mapping and Neural Networks (퍼지 벡터 양자화기 사상화와 신경망에 의한 화자적응 음성합성)

  • Lee, Jin-Yi;Lee, Gwang-Hyeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.149-160
    • /
    • 1997
  • This paper is concerned with the problem of speaker-adaptive speech synthes is method using a mapped codebook designed by fuzzy mapping on FLVQ (Fuzzy Learning Vector Quantization). The FLVQ is used to design both input and reference speaker's codebook. This algorithm is incorporated fuzzy membership function into the LVQ(learning vector quantization) networks. Unlike the LVQ algorithm, this algorithm minimizes the network output errors which are the differences of clas s membership target and actual membership values, and results to minimize the distances between training patterns and competing neurons. Speaker Adaptation in speech synthesis is performed as follow;input speaker's codebook is mapped a reference speaker's codebook in fuzzy concepts. The Fuzzy VQ mapping replaces a codevector preserving its fuzzy membership function. The codevector correspondence histogram is obtained by accumulating the vector correspondence along the DTW optimal path. We use the Fuzzy VQ mapping to design a mapped codebook. The mapped codebook is defined as a linear combination of reference speaker's vectors using each fuzzy histogram as a weighting function with membership values. In adaptive-speech synthesis stage, input speech is fuzzy vector-quantized by the mapped codcbook, and then FCM arithmetic is used to synthesize speech adapted to input speaker. The speaker adaption experiments are carried out using speech of males in their thirties as input speaker's speech, and a female in her twenties as reference speaker's speech. Speeches used in experiments are sentences /anyoung hasim nika/ and /good morning/. As a results of experiments, we obtained a synthesized speech adapted to input speaker.

  • PDF