• Title/Summary/Keyword: FCM algorithm

Search Result 239, Processing Time 0.033 seconds

Blind linear/nonlinear equalization for heavy noise-corrupted channels

  • Han, Soo- Whan;Park, Sung-Dae
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.383-391
    • /
    • 2009
  • In this paper, blind equalization using a modified Fuzzy C-Means algorithm with Gaussian Weights (MFCM_GW) is attempted to the heavy noise-corrupted channels. The proposed algorithm can deal with both of linear and nonlinear channels, because it searches for the optimal channel output states of a channel instead of estimating the channel parameters in a direct manner. In contrast to the common Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in its search procedure. The selected channel states by MFCM_GW are always close to the optimal set of a channel even the additive white Gaussian noise (AWGN) is heavily corrupted in it. Simulation studies demonstrate that the performance of the proposed method is relatively superior to existing genetic algorithm (GA) and conventional FCM based methods in terms of accuracy and speed.

A Mixed Co-clustering Algorithm Based on Information Bottleneck

  • Liu, Yongli;Duan, Tianyi;Wan, Xing;Chao, Hao
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1467-1486
    • /
    • 2017
  • Fuzzy co-clustering is sensitive to noise data. To overcome this noise sensitivity defect, possibilistic clustering relaxes the constraints in FCM-type fuzzy (co-)clustering. In this paper, we introduce a new possibilistic fuzzy co-clustering algorithm based on information bottleneck (ibPFCC). This algorithm combines fuzzy co-clustering and possibilistic clustering, and formulates an objective function which includes a distance function that employs information bottleneck theory to measure the distance between feature data point and feature cluster centroid. Many experiments were conducted on three datasets and one artificial dataset. Experimental results show that ibPFCC is better than such prominent fuzzy (co-)clustering algorithms as FCM, FCCM, RFCC and FCCI, in terms of accuracy and robustness.

Development of Electronic Tongue System Using Fuzzy C-Means Algorithm Combined to PCA Method (PCA와 결합된 Fuzzy C-Means 알고리즘을 이용한 전자 혀 시스템 개발)

  • Jung Woo Suk;Hong Chul Ho;Kim Jeong Do
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.109-116
    • /
    • 2005
  • In this paper, we investigate the visual and quantitative analysis at the same time with an electronic tongue(e-tongue) system using an array of ISE(ion-selective electrode). We apply the FCM(fuzzy c-means) algorithm combined with PCA(principal component analysis), which can be reduced multi-dimensional data to third-dimensional data, to classify data patterns detected by E-Tongue system. The proposed technique can be designed to solve the cluster centers and membership grade of patterns combined with the output results obtained by PCA method. According to the proposed technique, the membership grade of unknown pattern, which does not shown previously can be determined and analyzed visually. Conclusionally, the relationship between the standard patterns and unknown pattern can be easily analyzed. Throughout the experimental trials, the proposed technique has been confirmed using developed E-Tongue system.

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

A fuzzy cluster validity index for the evaluation of Fuzzy C-Means algorithm (최적 클러스터 분할을 위한 FCM 평가 인덱스)

  • 김대원;이광현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.374-376
    • /
    • 2003
  • 본 논문에서는 Fussy C-Means (FCM) 알고리즘에 의해 계산된 퍼지 클러스터들에 대한 평가 인덱스를 제안한다. 제안된 인덱스는 퍼지 클러스터들간의 인접성(inter-cluster proximity)을 이용한다. 클러스터 인접성을 도입함으로써 클러스터간의 중첩 정도를 계산할 수 있다. 따라서, 인접성 값이 낮을수록 클러스터들은 공간에 잘 분포하게 됨을 알 수 있다. 다양한 데이터 집합에 대한 실험을 통해서 제안된 인덱스의 효율성과 신뢰성을 검증하였다.

  • 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

Face Detection for Automatic Avatar Creation by using Deformable Template and GA

  • Park, Tae-Young;Lee, Ja-Yong;Kang, Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1534-1538
    • /
    • 2005
  • In this paper, we propose a method to detect contours of a face, eyes, and a mouth of a person in the color image in order to make an avatar automatically. First, we use the HSI color model to exclude the effect of various light conditions, and find skin regions in the input image by using the skin color 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 represent various shapes of a face, eyes and a mouth. GA is a very useful search algorithm based on the principals of natural selection and genetics. Second, the avatar is automatically created by using GA-detected contours and Fuzzy C-Means clustering (FCM). FCM is used to reduce the number of face colors. In result, we could create avatars which look like handmade caricatures representing user's identity. Our approach differs from those generated by existing methods.

  • PDF

A Study of Land-Cover Classification Technique for Merging Image Using Fuzzy C-Mean Algorithm (Fuzzy C-Mean 알고리즘을 이용한 중합 영상의 토지피복분류기법 연구)

  • 신석효;안기원;양경주
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.22 no.2
    • /
    • pp.171-178
    • /
    • 2004
  • The advantage of the remote sensing is extraction the information of wide area rapidly. Such advantage is the resource and environment are quick and efficient method to grasps accurately method through the land cover classification of wide area. Accordingly this study was presented more better land cover classification method through an algorithm development. We accomplished FCM(Fuzzy C-Mean) classification technique with MLC (Maximum Likelihood classification) technique to be general land cover classification method in the content of research. And evaluated the accuracy assessment of two classification method. This study is used to the high-resolution(6.6m) Electro-Optical Camera(EOC) panchromatic image of the first Korea Multi-Purpose Satellite 1(KOMPSAT-1) and the multi-spectral Moderate Resolution Imaging Spectroradiometer(MODIS) image data(36 bands).

A Study on Effective Selection of University Lecture Evaluation (대학 강의평가에서 문항 추출에 관한 연구)

  • Hwang Se-Myung;Kim In-Taek
    • Journal of Engineering Education Research
    • /
    • v.8 no.1
    • /
    • pp.31-45
    • /
    • 2005
  • In this paper, selecting survey items was performed using three clustering methods: factor analysis, fuzzy c-Means algorithm and cluster analysis. The methods were used to extract key items from various questionnaires. The key item represents several similar questionnaires that form a cluster. Test survey was made of 120 items obtained from several surveys and it was answered by 646 students from 4 universities. Each item contains 6 choices. Applying the clustering method chose 25 items which is reduced from the original 120 items. The results yielded by three methods are very similar.

A Design of GA-based TSK Fuzzy Classifier and Its Application (GA 기반 TSK 퍼지 분류기의 설계와 응용)

  • 곽근창;김승석;유정웅;김승석
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.8
    • /
    • pp.754-759
    • /
    • 2001
  • In this paper, we propose a TSK(Takagi-Sugeno-Kang)-type fuzzy classifier using PCA(Principal Component Analysis), FCM(Fuzzy c-Means) clustering, ANFIS(Adaptive Neuro-Fuzzy Inference System) and hybrid GA(Genetic Algorithm). First, input data is transformed to reduce correlation among the data components by PCA. FCM clustering is applied to obtain a initial TSK-type fuzzy classifier. Parameter identification is performed by AGA(Adaptive GA) and RLSE(Recursive Least Square Estimate). Finally, we applied the proposed method to Iris data classificationl problems and obtained a better performance than previous works.

  • PDF