• Title/Summary/Keyword: Fuzzy C-means Clustering

Search Result 310, Processing Time 0.022 seconds

A study on the modeling and the design of multivariable fuzzy controller for the activated sludge process (활성오니 공정의 모델링 및 다변수 퍼지 제어기 설계에 관한 연구)

  • 남의석;오성권;황희수;최진혁;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.502-506
    • /
    • 1992
  • In this study, we proposed the fuzzy modeling method and designed a model-based logic controller for Activated and Sludge Process(A.S.P.) in sewage treatment. The identification of the structure of fuzzy implications is carreid out by use of fuzzy c-means clustering algorithm. And to identify the parameters of fuzzy implications, we used the complex and the least square method. To tune the premise parameters automatically the complex method is implemented. The model-based fuzzy controller is designed by rules generated from the identified A.S.P. fuzzy model. The feasibility of the proposed approach is evaluated through the identification of the fuzzy model to describe an input-output relation of the A.S.P.. The performance of identified model-based fuzzy controller is evaluated through the computer simulations.

  • PDF

Improved Algorithm of Hybrid c-Means Clustering for Supervised Classification of Remote Sensing Images (원격탐사 영상의 감독분류를 위한 개선된 하이브리드 c-Means 군집화 알고리즘)

  • Jeon, Young-Joon;Kim, Jin-Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.3
    • /
    • pp.185-191
    • /
    • 2007
  • Remote sensing images are multispectral image data collected from several band divided by wavelength ranges. The classification of remote sensing images is the method of classifying what has similar spectral characteristics together among each pixel composing an image as the important algorithm in this field. This paper presents a pattern classification method of remote sensing images by applying a possibilistic fuzzy c-means (PFCM) algorithm. The PFCM algorithm is a hybridization of a FCM algorithm, which adopts membership degree depending on the distance between data and the center of a certain cluster, combined with a PCM algorithm, which considers class typicality of the pattern sets. In this proposed method, we select the training data for each class and perform supervised classification using the PFCM algorithm with spectral signatures of the training data. The application of the PFCM algorithm is tested and verified by using Landsat TM and IKONOS remote sensing satellite images. As a result, the overall accuracy showed a better results than the FCM, PCM algorithm or conventional maximum likelihood classification(MLC) algorithm.

  • PDF

Implementation of Adaptive Hierarchical Fair Com pet ion-based Genetic Algorithms and Its Application to Nonlinear System Modeling (적응형 계층적 공정 경쟁 기반 병렬유전자 알고리즘의 구현 및 비선형 시스템 모델링으로의 적용)

  • Choi, Jeoung-Nae;Oh, Sung-Kwun;Kim, Hyun-Ki
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.120-122
    • /
    • 2006
  • The paper concerns the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA) and information data granulation. The granulation is realized with the aid of the Hard C-means clustering and HFCGA is a kind of multi-populations of Parallel Genetic Algorithms (PGA), and it is used for structure optimization and parameter identification of fuzzy model. It concerns the fuzzy model-related parameters such as the number of input variables to be used, a collection of specific subset of input variables, the number of membership functions, the order of polynomial, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. Thestructural optimization is realized via HFCGA and HCM method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods.

  • PDF

A Watershed-based Texture Segmentation Method Using Marker Clustering (마커 클러스터링을 이용한 유역변환 기반의 질감 분할 기법)

  • Hwang, Jin-Ho;Kim, Won-Hee;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.4
    • /
    • pp.441-449
    • /
    • 2007
  • In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

  • PDF

Genetic Design of Granular-oriented Radial Basis Function Neural Network Based on Information Proximity (정보 유사성 기반 입자화 중심 RBF NN의 진화론적 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.436-444
    • /
    • 2010
  • In this study, we introduce and discuss a concept of a granular-oriented radial basis function neural networks (GRBF NNs). In contrast to the typical architectures encountered in radial basis function neural networks(RBF NNs), our main objective is to develop a design strategy of GRBF NNs as follows : (a) The architecture of the network is fully reflective of the structure encountered in the training data which are granulated with the aid of clustering techniques. More specifically, the output space is granulated with use of K-Means clustering while the information granules in the multidimensional input space are formed by using a so-called context-based Fuzzy C-Means which takes into account the structure being already formed in the output space, (b) The innovative development facet of the network involves a dynamic reduction of dimensionality of the input space in which the information granules are formed in the subspace of the overall input space which is formed by selecting a suitable subset of input variables so that the this subspace retains the structure of the entire space. As this search is of combinatorial character, we use the technique of genetic optimization to determine the optimal input subspaces. A series of numeric studies exploiting some nonlinear process data and a dataset coming from the machine learning repository provide a detailed insight into the nature of the algorithm and its parameters as well as offer some comparative analysis.

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.

A Study on Nucleus Recognition of Uterine Cervical Pap-Smears using Fuzzy c-Means Clustering Algorithm (퍼지 c-Means 클러스터링 알고리즘을 이용한 자궁 세포진 핵 인식에 관한 연구)

  • Heo, Jung-Min;Kim, Jung-Min;Kim, Kwang-Baek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.403-407
    • /
    • 2005
  • 자궁 경부 세포진 영상의 핵 영역 분할은 자궁 경부암 자동화 검색 시스템의 가장 어렵고도 중요한 분야로 알려져 있다. 본 논문에서는 자궁 경부 세포진 영상에서 HSI 모델을 이용하여 세포진 핵 영역을 추출한다. 추출된 세포진 핵 영역은 형태학적 정보(morphometric feature)와 명암 정보(densitometric feature), 색상 정보(colorimetric feature), 질감 정보(textural features)를 분석하여 핵의 특징을 추출한다. 또한 Bethesda System에서의 분류 기준에 따라 핵의 분류 기준을 정하고 추출된 핵의 특징들을 퍼지 c-Means 클러스터링 알고리즘에 적용하여 실험한 결과, 제안된 방법이 자궁 세포진 핵 추출과 인식에 있어서 효율적임을 확인하였다.

  • PDF

ATM Connection Admission Control Using Traffic Parameters Compression (트래픽 파라메타 압축을 이용한 ATM 연결수락제어)

  • Lee, Jin-Lee
    • The KIPS Transactions:PartC
    • /
    • v.8C no.3
    • /
    • pp.311-318
    • /
    • 2001
  • 본 논문에서는 연결수락 제어시 사용자가 전송하는 트래픽 파라메타(샐 개수의 분산값과 평균값)를 압축하여 망에 신고하는 방법을 제안하고, 압축방법에 의한 연결수락제어의 성능을 분석 비교한다. 트래픽 파라메타 압축방법은 K-means, CL(Competitive Learning), Fuzzy ISODATA,FNC(Fuzzy Neural Clustering)를 사용한다. 제안한 트래픽 파라메타의 압축에 의한 연결수락제어는 퍼지 매핑함수(Fuzzy Mapping Funciton)fp 의해 신고한 트래픽 패턴을 추정하고, 전방향 구조의 신경망을 사용하여 연결의 수락/거절을 결정한다. ON-OFF 트래픽 모델 환경에서 컴퓨터 실험을 통하여 여러 가지 압축방법들을 사용한 연결수락제어의 성능을 Fuzziness 값에 따라 비교하였고, 그 결과 FNC 방법이 우수함을 알 수 있었다. EH한 연결수락제어의 성능을 높히기 위해서 관측 프레임의 셀 분산값이 크면 Fuzziness 값을 작게 선정하고, 작으면 상대적으로 크게 선정해야 함을 알 수 있었다.

  • PDF

A Possibilistic C-Means Approach to the Hough Transform for Line Detection

  • Frank Chung-HoonRhee;Shim, Eun-A
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.476-479
    • /
    • 2003
  • The Rough transform (HT) is often used for extracting global features in binary images, for example curve and line segments, from local features such as single pixels. The HT is useful due to its insensitivity to missing edge points and occlusions, and robustness in noisy images. However, it possesses some disadvantages, such as time and memory consumption due to the number of input data and the selection of an optimal and efficient resolution of the accumulator space can be difficult. Another problem of the HT is in the difficulty of peak detection due to the discrete nature of the image space and the round off in estimation. In order to resolve the problem mentioned above, a possibilistic C-means approach to clustering [1] is used to cluster neighboring peaks. Several experimental results are given.

  • PDF

Building Change Detection Using Deep Learning for Remote Sensing Images

  • Wang, Chang;Han, Shijing;Zhang, Wen;Miao, Shufeng
    • Journal of Information Processing Systems
    • /
    • v.18 no.4
    • /
    • pp.587-598
    • /
    • 2022
  • To increase building change recognition accuracy, we present a deep learning-based building change detection using remote sensing images. In the proposed approach, by merging pixel-level and object-level information of multitemporal remote sensing images, we create the difference image (DI), and the frequency-domain significance technique is used to generate the DI saliency map. The fuzzy C-means clustering technique pre-classifies the coarse change detection map by defining the DI saliency map threshold. We then extract the neighborhood features of the unchanged pixels and the changed (buildings) from pixel-level and object-level feature images, which are then used as valid deep neural network (DNN) training samples. The trained DNNs are then utilized to identify changes in DI. The suggested strategy was evaluated and compared to current detection methods using two datasets. The results suggest that our proposed technique can detect more building change information and improve change detection accuracy.