• Title/Summary/Keyword: FCM clustering method

Search Result 119, Processing Time 0.025 seconds

Structure Preserving Dimensionality Reduction : A Fuzzy Logic Approach

  • Nikhil R. Pal;Gautam K. Nandal;Kumar, Eluri-Vijaya
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.426-431
    • /
    • 1998
  • We propose a fuzzy rule based method for structure preserving dimensionality reduction. This method selects a small representative sample and applies Sammon's method to project it. The input data points are then augmented by the corresponding projected(output) data points. The augmented data set thus obtained is clustered with the fuzzy c-means(FCM) clustering algorithm. Each cluster is then translated into a fuzzy rule for projection. Our rule based system is computationally very efficient compared to Sammon's method and is quite effective to project new points, i.e., it has good predictability.

  • PDF

A Study on Heavy Rainfall Guidance Realized with the Aid of Neuro-Fuzzy and SVR Algorithm Using AWS Data (AWS자료 기반 SVR과 뉴로-퍼지 알고리즘 구현 호우주의보 가이던스 연구)

  • Kim, Hyun-Myung;Oh, Sung-Kwun;Kim, Yong-Hyuk;Lee, Yong-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.4
    • /
    • pp.526-533
    • /
    • 2014
  • In this study, we introduce design methodology to develop a guidance for issuing heavy rainfall warning by using both RBFNNs(Radial basis function neural networks) and SVR(Support vector regression) model, and then carry out the comparative studies between two pattern classifiers. Individual classifiers are designed as architecture realized with the aid of optimization and pre-processing algorithm. Because the predictive performance of the existing heavy rainfall forecast system is commonly affected from diverse processing techniques of meteorological data, under-sampling method as the pre-processing method of input data is used, and also data discretization and feature extraction method for SVR and FCM clustering and PSO method for RBFNNs are exploited respectively. The observed data, AWS(Automatic weather wtation), supplied from KMA(korea meteorological administration), is used for training and testing of the proposed classifiers. The proposed classifiers offer the related information to issue a heavy rain warning in advance before 1 to 3 hours by using the selected meteorological data and the cumulated precipitation amount accumulated for 1 to 12 hours from AWS data. For performance evaluation of each classifier, ETS(Equitable Threat Score) method is used as standard verification method for predictive ability. Through the comparative studies of two classifiers, neuro-fuzzy method is effectively used for improved performance and to show stable predictive result of guidance to issue heavy rainfall warning.

Moving Object Tracking Using Co-occurrence Features of Objects (이동 물체의 상호 발생 특징정보를 이용한 동영상에서의 이동물체 추적)

  • Kim, Seongdong;Seongah Chin;Moonwon Choo
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.1-13
    • /
    • 2002
  • In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

  • PDF

Face Detection for Automatic Avatar Creation by using Deformable Template and GA (Deformable Template과 GA를 이용한 얼굴 인식 및 아바타 자동 생성)

  • Park Tae-Young;Kwon Min-Su;Kang Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.110-115
    • /
    • 2005
  • This paper proposes the method to detect contours of a face, eyes and a mouth in a color image for making an avatar automatically. First, we use the HSI color model to exclude the effect of various light condition, and we find skin regions in an input image by using the skin color is defined on HS-plane. And then, we use deformable templates and Genetic Algorithm(GA) to detect contours of a face, eyes and a mouth. Deformable templates consist of B-spline curves and control point vectors. Those can represent various shape of a face, eyes and a mouth. And GA is very useful search procedure based on the mechanics of natural selection and natural genetics. Second, an avatar is created automatically by using contours and Fuzzy C-means clustering(FCM). FCM is used to reduce the number of face color As a result, we could create avatars like handmade caricatures which can represent the user's identity, differing from ones generated by the existing methods.

Implementation of Unsupervised Nonlinear Classifier with Binary Harmony Search Algorithm (Binary Harmony Search 알고리즘을 이용한 Unsupervised Nonlinear Classifier 구현)

  • Lee, Tae-Ju;Park, Seung-Min;Ko, Kwang-Eun;Sung, Won-Ki;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.4
    • /
    • pp.354-359
    • /
    • 2013
  • In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

Generalized Fuzzy Modeling

  • Hwang, Hee-Soo;Joo, Young-Hoon;Woo, Kwang-Bang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1145-1150
    • /
    • 1993
  • In this paper, two methods of fuzzy modeling are prsented to describe the input-output relationship effectively based on relation characteristics utilizing simplified reasoning and neuro-fuzzy reasoning. The methods of modeling by the simplified reasoning and the neuro-fuzzy reasoning are used when the input-output relation of a system is 'crisp' and 'fuzzy', respectively. The structure and the parameter identification in the modeling method by the simplified reasoning are carried out by means of FCM clustering and the proposed GA hybrid scheme, respectively. The structure and the parameter identification in the modeling method by the neuro-fuzzy reasoning are carried out by means of GA and BP algorithm, respectively. The feasibility of the proposed methods are evaluated through simulation.

  • PDF

Segmentation of Multispectral MRI Using Fuzzy Clustering (퍼지 클러스터링을 이용한 다중 스펙트럼 자기공명영상의 분할)

  • 윤옥경;김현순;곽동민;김범수;김동휘;변우목;박길흠
    • Journal of Biomedical Engineering Research
    • /
    • v.21 no.4
    • /
    • pp.333-338
    • /
    • 2000
  • In this paper, an automated segmentation algorithm is proposed for MR brain images using T1-weighted, T2-weighted, and PD images complementarily. The proposed segmentation algorithm is composed of 3 step. In the first step, cerebrum images are extracted by putting a cerebrum mask upon the three input images. In the second step, outstanding clusters that represent inner tissues of the cerebrum are chosen among 3-dimensional(3D) clusters. 3D clusters are determined by intersecting densely distributed parts of 2D histogram in the 3D space formed with three optimal scale images. Optimal scale image is made up of applying scale space filtering to each 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram and searching graph structure. Optimal scale image best describes the shape of densely distributed parts of pixels in 2D histogram. In the final step, cerebrum images are segmented using FCM algorithm with its initial centroid value as the outstanding clusters centroid value. The proposed cluster's centroid accurately. And also can get better segmentation results from the proposed segmentation algorithm with multi spectral analysis than the method of single spectral analysis.

  • PDF

An Efficient Clustering Algorithm based on Heuristic Evolution (휴리스틱 진화에 기반한 효율적 클러스터링 알고리즘)

  • Ryu, Joung-Woo;Kang, Myung-Ku;Kim, Myung-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.80-90
    • /
    • 2002
  • Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

A new Design of Granular-oriented Self-organizing Polynomial Neural Networks (입자화 중심 자기구성 다항식 신경 회로망의 새로운 설계)

  • Oh, Sung-Kwun;Park, Ho-Sung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.2
    • /
    • pp.312-320
    • /
    • 2012
  • In this study, we introduce a new design methodology of a granular-oriented self-organizing polynomial neural networks (GoSOPNNs) that is based on multi-layer perceptron with Context-based Polynomial Neurons (CPNs) or Polynomial Neurons (PNs). In contrast to the typical architectures encountered in polynomial neural networks (PNN), our main objective is to develop a methodological design strategy of GoSOPNNs as follows : (a) The 1st layer of the proposed network consists of Context-based Polynomial Neuron (CPN). In here, CPN is fully reflective of the structure encountered in numeric data which are granulated with the aid of Context-based Fuzzy C-Means (C-FCM) clustering method. The context-based clustering supporting the design of information granules is completed in the space of the input data while the build of the clusters is guided by a collection of some predefined fuzzy sets (so-called contexts) defined in the output space. (b) The proposed design procedure being applied at each layer of GoSOPNN leads to the selection of preferred nodes of the network (CPNs or PNs) whose local characteristics (such as the number of contexts, the number of clusters, a collection of the specific subset of input variables, and the order of the polynomial) can be easily adjusted. These options contribute to the flexibility as well as simplicity and compactness of the resulting architecture of the network. For the evaluation of performance of the proposed GoSOPNN network, we describe a detailed characteristic of the proposed model using a well-known learning machine data(Automobile Miles Per Gallon Data, Boston Housing Data, Medical Image System Data).

Development of an Activity-Based Conceptual Cost Estimating Model for P.S.CBox Girder Bridge (대표공종 기반의 P.S.C 박스 거더교 개략공사비 산정모델 개발 -상부공사 중심으로-)

  • Cho, Ji-Hoon;Kim, Sang-Bum
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2008.11a
    • /
    • pp.197-201
    • /
    • 2008
  • Conceptual cost estimates for domestic highway projects have generally been conducted using governmental unit-price references. Inaccuracies in governmental unit-price data has repeatedly addressed in the Korean construction industry which often lead to poor decision making and cost management practices. Thus, needs for developing a better way of conceptual cost estimating has been widely recognized. This research is considered as the first step in developing such model using real-world cost data based on actual construction activities. The data analyzed in this paper includes 41 P.S.C (Prestressed Concrete) Box bridges which broke into 4 categories based on construction methods such as I.L.M(Incremental Launching Method), M.S.S(Movable Scaffolding System), F.S.M(Full Staging Method), and F.C.M(Free Cantilever Method). Actual design documents; including actual cost estimating documents, drawings and specifications were carefully reviewed to effectively break down cost structures for PSC girder bridges. Among more than 40 cost categories for each P.S.C girder bridge type, 7 of them were identified which accounted for more than 95% of total construction cost (ILM: 99.47%, MSS: 99.22%, FSM: 98.18%, and FCM: 98.12%). In order to validate the clustering of cost categories, the variation of each cost category has been investigated which resulted in between -1.16 % and 0.59%.

  • PDF