• Title/Summary/Keyword: fuzzy-clustering

Search Result 734, Processing Time 0.02 seconds

Enhanced FCM-based Hybrid Network for Pattern Classification (패턴 분류를 위한 개선된 FCM 기반 하이브리드 네트워크)

  • Kim, Kwang-Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1905-1912
    • /
    • 2009
  • Clustering results based on the FCM algorithm sometimes produces undesirable clustering result through data distribution in the clustered space because data is classified by comparison with membership degree which is calculated by the Euclidean distance between input vectors and clusters. Symmetrical measurement of clusters and fuzzy theory are applied to the classification to tackle this problem. The enhanced FCM algorithm has a low impact with the variation of changing distance about each cluster, middle of cluster and cluster formation. Improved hybrid network of applying FCM algorithm is proposed to classify patterns effectively. The proposed enhanced FCM algorithm is applied to the learning structure between input and middle layers, and normalized delta learning rule is applied in learning stage between middle and output layers in the hybrid network. The proposed algorithms compared with FCM-based RBF network using Max_Min neural network, FMC-based RBF network and HCM-based RBF network to evaluate learning and recognition performances in the two-dimensional coordinated data.

Segmentation of MR Brain Image Using Scale Space Filtering and Fuzzy Clustering (스케일 스페이스 필터링과 퍼지 클러스터링을 이용한 뇌 자기공명영상의 분할)

  • 윤옥경;김동휘;박길흠
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.339-346
    • /
    • 2000
  • Medical image is analyzed to get an anatomical information for diagnostics. Segmentation must be preceded to recognize and determine the lesion more accurately. In this paper, we propose automatic segmentation algorithm for MR brain images using T1-weighted, T2-weighted and PD images complementarily. The proposed segmentation algorithm is first, extracts cerebrum images from 3 input images using cerebrum mask which is made from PD image. And next, find 3D clusters corresponded to cerebrum tissues using scale filtering and 3D clustering in 3D space which is consisted of T1, T2, and PD axis. Cerebrum images are segmented using FCM algorithm with its initial centroid as the 3D cluster's centroid. The proposed algorithm improved segmentation results using accurate cluster centroid as initial value of FCM algorithm and also can get better segmentation results using multi spectral analysis than single spectral analysis.

  • PDF

Automatic detection of discontinuity trace maps: A study of image processing techniques in building stone mines

  • Mojtaba Taghizadeh;Reza Khalou Kakaee;Hossein Mirzaee Nasirabad;Farhan A. Alenizi
    • Geomechanics and Engineering
    • /
    • v.36 no.3
    • /
    • pp.205-215
    • /
    • 2024
  • Manually mapping fractures in construction stone mines is challenging, time-consuming, and hazardous. In this method, there is no physical access to all points. In contrast, digital image processing offers a safe, cost-effective, and fast alternative, with the capability to map all joints. In this study, two methods of detecting the trace of discontinuities using image processing in construction stone mines are presented. To achieve this, we employ two modified Hough transform algorithms and the degree of neighborhood technique. Initially, we introduced a method for selecting the best edge detector and smoothing algorithms. Subsequently, the Canny detector and median smoother were identified as the most efficient tools. To trace discontinuities using the mentioned methods, common preprocessing steps were initially applied to the image. Following this, each of the two algorithms followed a distinct approach. The Hough transform algorithm was first applied to the image, and the traces were represented through line drawings. Subsequently, the Hough transform results were refined using fuzzy clustering and reduced clustering algorithms, along with a novel algorithm known as the farthest points' algorithm. Additionally, we developed another algorithm, the degree of neighborhood, tailored for detecting discontinuity traces in construction stones. After completing the common preprocessing steps, the thinning operation was performed on the target image, and the degree of neighborhood for lineament pixels was determined. Subsequently, short lines were removed, and the discontinuities were determined based on the degree of neighborhood. In the final step, we connected lines that were previously separated using the method to be described. The comparison of results demonstrates that image processing is a suitable tool for identifying rock mass discontinuity traces. Finally, a comparison of two images from different construction stone mines presented at the end of this study reveals that in images with fewer traces of discontinuities and a softer texture, both algorithms effectively detect the discontinuity traces.

KNN/PFCM Hybrid Algorithm for Indoor Location Determination in WLAN (WLAN 실내 측위 결정을 위한 KNN/PFCM Hybrid 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.146-153
    • /
    • 2010
  • For the indoor location, wireless fingerprinting is most favorable because fingerprinting is most accurate among the technique for wireless network based indoor location which does not require any special equipments dedicated for positioning. As fingerprinting method,k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighborsk and positions of reference points(RPs). So possibilistic fuzzy c-means(PFCM) clustering algorithm is applied to improve KNN, which is the KNN/PFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN,k RPs are firstly chosen as the data samples of PFCM based on signal to noise ratio(SNR). Then, thek RPs are classified into different clusters through PFCM based on SNR. Experimental results indicate that the proposed KNN/PFCM hybrid algorithm generally outperforms KNN and KNN/FCM algorithm when the locations error is less than 2m.

Optimized KNN/IFCM Algorithm for Efficient Indoor Location (효율적인 실내 측위를 위한 최적화된 KNN/IFCM 알고리즘)

  • Lee, Jang-Jae;Song, Lick-Ho;Kim, Jong-Hwa;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.2
    • /
    • pp.125-133
    • /
    • 2011
  • For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So intuitive fuzzy c-means(IFCM) clustering algorithm is applied to improve KNN, which is the KNN/IFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of IFCM based on signal to noise ratio(SNR). Then, the k RPs are classified into different clusters through IFCM based on SNR. Experimental results indicate that the proposed KNN/IFCM hybrid algorithm generally outperforms KNN, KNN/FCM, KNN/PFCM algorithm when the locations error is less than 2m.

The Effect of the Number of Phoneme Clusters on Speech Recognition (음성 인식에서 음소 클러스터 수의 효과)

  • Lee, Chang-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.11
    • /
    • pp.1221-1226
    • /
    • 2014
  • In an effort to improve the efficiency of the speech recognition, we investigate the effect of the number of phoneme clusters. For this purpose, codebooks of varied number of phoneme clusters are prepared by modified k-means clustering algorithm. The subsequent processing is fuzzy vector quantization (FVQ) and hidden Markov model (HMM) for speech recognition test. The result shows that there are two distinct regimes. For large number of phoneme clusters, the recognition performance is roughly independent of it. For small number of phoneme clusters, however, the recognition error rate increases nonlinearly as it is decreased. From numerical calculation, it is found that this nonlinear regime might be modeled by a power law function. The result also shows that about 166 phoneme clusters would be the optimal number for recognition of 300 isolated words. This amounts to roughly 3 variations per phoneme.

Intrusion Detection System Modeling Based on Learning from Network Traffic Data

  • Midzic, Admir;Avdagic, Zikrija;Omanovic, Samir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5568-5587
    • /
    • 2018
  • This research uses artificial intelligence methods for computer network intrusion detection system modeling. Primary classification is done using self-organized maps (SOM) in two levels, while the secondary classification of ambiguous data is done using Sugeno type Fuzzy Inference System (FIS). FIS is created by using Adaptive Neuro-Fuzzy Inference System (ANFIS). The main challenge for this system was to successfully detect attacks that are either unknown or that are represented by very small percentage of samples in training dataset. Improved algorithm for SOMs in second layer and for the FIS creation is developed for this purpose. Number of clusters in the second SOM layer is optimized by using our improved algorithm to minimize amount of ambiguous data forwarded to FIS. FIS is created using ANFIS that was built on ambiguous training dataset clustered by another SOM (which size is determined dynamically). Proposed hybrid model is created and tested using NSL KDD dataset. For our research, NSL KDD is especially interesting in terms of class distribution (overlapping). Objectives of this research were: to successfully detect intrusions represented in data with small percentage of the total traffic during early detection stages, to successfully deal with overlapping data (separate ambiguous data), to maximize detection rate (DR) and minimize false alarm rate (FAR). Proposed hybrid model with test data achieved acceptable DR value 0.8883 and FAR value 0.2415. The objectives were successfully achieved as it is presented (compared with the similar researches on NSL KDD dataset). Proposed model can be used not only in further research related to this domain, but also in other research areas.

Nonlinear Characteristic Analysis of Charging Current for Linear Type Magnetic Flux Pump Using RBFNN (RBF 뉴럴네트워크를 이용한 리니어형 초전도 전원장치의 비선형적 충전전류특성 해석)

  • Chung, Yoon-Do;Park, Ho-Sung;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.140-145
    • /
    • 2010
  • In this work, to theoretically analyze the nonlinear charging characteristic, a Radial Basis Function Neural Network (RBFNN) is adopted. Based on the RBFNN, an charging characteristic tendency of a Linear Type Magnetic Flux Pump (LTMFP) is analyzed. In the paper, we developed the LTMFP that generates stable and controllable charging current and also experimentally investigated its charging characteristic in the cryogenic system. From these experimental results, the charging current of the LTMFP was also found to be frequency dependent with nonlinear quality due to the nonlinear magnetic behaviour of superconducting Nb foil. On the whole, in the case of essentially cryogenic experiment, since cooling costs loomed large in the cryogenic environment, it is difficult to carry out various experiments. Consequentially, in this paper, we estimated the nonlinear characteristic of charging current as well as realized the intelligent model via the design of RBFNN based on the experimental data. In this paper, we view RBF neural networks as predominantly data driven constructs whose processing is based upon an effective usage of experimental data through a prudent process of Fuzzy C-Means clustering method. Also, the receptive fields of the proposed RBF neural network are formed by the FCM clustering.

Health Risk Management using Feature Extraction and Cluster Analysis considering Time Flow (시간흐름을 고려한 특징 추출과 군집 분석을 이용한 헬스 리스크 관리)

  • Kang, Ji-Soo;Chung, Kyungyong;Jung, Hoill
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.1
    • /
    • pp.99-104
    • /
    • 2021
  • In this paper, we propose health risk management using feature extraction and cluster analysis considering time flow. The proposed method proceeds in three steps. The first is the pre-processing and feature extraction step. It collects user's lifelog using a wearable device, removes incomplete data, errors, noise, and contradictory data, and processes missing values. Then, for feature extraction, important variables are selected through principal component analysis, and data similar to the relationship between the data are classified through correlation coefficient and covariance. In order to analyze the features extracted from the lifelog, dynamic clustering is performed through the K-means algorithm in consideration of the passage of time. The new data is clustered through the similarity distance measurement method based on the increment of the sum of squared errors. Next is to extract information about the cluster by considering the passage of time. Therefore, using the health decision-making system through feature clusters, risks able to managed through factors such as physical characteristics, lifestyle habits, disease status, health care event occurrence risk, and predictability. The performance evaluation compares the proposed method using Precision, Recall, and F-measure with the fuzzy and kernel-based clustering. As a result of the evaluation, the proposed method is excellently evaluated. Therefore, through the proposed method, it is possible to accurately predict and appropriately manage the user's potential health risk by using the similarity with the patient.

Design of Black Plastics Classifier Using Data Information (데이터 정보를 이용한 흑색 플라스틱 분류기 설계)

  • Park, Sang-Beom;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.4
    • /
    • pp.569-577
    • /
    • 2018
  • In this paper, with the aid of information which is included within data, preprocessing algorithm-based black plastic classifier is designed. The slope and area of spectrum obtained by using laser induced breakdown spectroscopy(LIBS) are analyzed for each material and its ensuing information is applied as the input data of the proposed classifier. The slope is represented by the rate of change of wavelength and intensity. Also, the area is calculated by the wavelength of the spectrum peak where the material property of chemical elements such as carbon and hydrogen appears. Using informations such as slope and area, input data of the proposed classifier is constructed. In the preprocessing part of the classifier, Principal Component Analysis(PCA) and fuzzy transform are used for dimensional reduction from high dimensional input variables to low dimensional input variables. Characteristic analysis of the materials as well as the processing speed of the classifier is improved. In the condition part, FCM clustering is applied and linear function is used as connection weight in the conclusion part. By means of Particle Swarm Optimization(PSO), parameters such as the number of clusters, fuzzification coefficient and the number of input variables are optimized. To demonstrate the superiority of classification performance, classification rate is compared by using WEKA 3.8 data mining software which contains various classifiers such as Naivebayes, SVM and Multilayer perceptron.