• Title/Summary/Keyword: Improved K-means algorithm

Search Result 143, Processing Time 0.024 seconds

Region-based Multi-level Thresholding for Color Image Segmentation (영역 기반의 Multi-level Thresholding에 의한 컬러 영상 분할)

  • Oh, Jun-Taek;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.20-27
    • /
    • 2006
  • Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

Research on Speed Estimation Method of Induction Motor based on Improved Fuzzy Kalman Filtering

  • Chen, Dezhi;Bai, Baodong;Du, Ning;Li, Baopeng;Wang, Jiayin
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.3
    • /
    • pp.272-275
    • /
    • 2014
  • An improved fuzzy Kalman filtering speed estimation scheme was proposed by means of measuring stator side voltage and current value based on vector control state equation of induction motor. The designed fuzzy adaptive controller conducted recursive online correction of measurement noise covariance matrix by monitoring the ratio of theory residuals and actual residuals to make it approach real noise level gradually, allowing the filter to perform optimal estimation to improve estimation accuracy of EKF. Meanwhile, co-simulation scheme based on MATLAB and Ansoft was proposed in order to improve simulation accuracy. Field-circuit coupling problems of induction motor under the action of vector control were solved and the parameter optimization accuracy was improved dramatically. The simulation and experimental results show that this algorithm has a strong ability to inhibit the random measurement noise. It is able to estimate motor speed accurately, and has superior static and dynamic characteristics.

Implementation of Improved Ship Positioning Algorithm using Sextant (섹스탄트를 이용한 개선된 선박 측위 알고리즘의 구현)

  • Shin, Heui-han;Yim, Jae-hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1243-1251
    • /
    • 2017
  • When a Ship sails in the ocean, it is significant to find one's position for safe navigation. Most of ships have been using GPS navigation since its development after 1990's. The celestial navigation was used as the navigation method when sailing in the ocean, but time-consuming process such as complicated calculation and plotting the result on chart diminished its utilization. The thesis explains convenience and utilization of existing celestial navigation by resolving challenges it has. As a way of enhancing the celestial navigation, the author developed a software which incudes a numerical formula based on the previous calculation process. When a navigator inputs the altitude of sun, GHA and dec into computer while sailing, the position of the ship will be displayed as the coordinates. The improved method thus reaffirmed the usefulness of the celestial navigation and will greatly serve as means of navigation in the occurrence of distress. Abstract should be placed here.

Design of Partial Discharge Pattern Classifier of Softmax Neural Networks Based on K-means Clustering : Comparative Studies and Analysis of Classifier Architecture (K-means 클러스터링 기반 소프트맥스 신경회로망 부분방전 패턴분류의 설계 : 분류기 구조의 비교연구 및 해석)

  • Jeong, Byeong-Jin;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.1
    • /
    • pp.114-123
    • /
    • 2018
  • This paper concerns a design and learning method of softmax function neural networks based on K-means clustering. The partial discharge data Information is preliminarily processed through simulation using an Epoxy Mica Coupling sensor and an internal Phase Resolved Partial Discharge Analysis algorithm. The obtained information is processed according to the characteristics of the pattern using a Motor Insulation Monitoring System program. At this time, the processed data are total 4 types that void discharge, corona discharge, surface discharge and slot discharge. The partial discharge data with high dimensional input variables are secondarily processed by principal component analysis method and reduced with keeping the characteristics of pattern as low dimensional input variables. And therefore, the pattern classifier processing speed exhibits improved effects. In addition, in the process of extracting the partial discharge data through the MIMS program, the magnitude of amplitude is divided into the maximum value and the average value, and two pattern characteristics are set and compared and analyzed. In the first half of the proposed partial discharge pattern classifier, the input and hidden layers are classified by using the K-means clustering method and the output of the hidden layer is obtained. In the latter part, the cross entropy error function is used for parameter learning between the hidden layer and the output layer. The final output layer is output as a normalized probability value between 0 and 1 using the softmax function. The advantage of using the softmax function is that it allows access and application of multiple class problems and stochastic interpretation. First of all, there is an advantage that one output value affects the remaining output value and its accompanying learning is accelerated. Also, to solve the overfitting problem, L2-normalization is applied. To prove the superiority of the proposed pattern classifier, we compare and analyze the classification rate with conventional radial basis function neural networks.

Simple Algorithm for Large-scale Unbalanced Transportation Problem (대규모 불균형 수송문제의 간단한 해법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.223-230
    • /
    • 2015
  • As the Transportation Simplex Method of the general transportation problem are inapplicable to the large-scale unbalanced transportation problem, a commercialized linear programming package remains as the only viable means. There is, however, no method made available to verify the optimality of solutions attained by the package. This paper therefore proposes a simple heuristic algorithm to the large-scale unbalanced transportation problem. From a given problem of $31{\times}15$supply and demand areas, the proposed algorithm determines the number of demands areas for each supply area and executes on the latter in the ascending order of each of their corresponding demand areas. Next, given a single corresponding demand area, it supplies the full demand volume and else, it supplies first to an area of minimum associated costs and subsequently to the rest so as to meet the demand to the fullest extent. This initial optimal value is then optimized through an adjustment process whereby costs are minimized as much as possible. When tested on the $31{\times}15$cost matrix, the proposed algorithm has obtained an optimal result improved from the commercial linear programming package by 8.9%.

Classification method for failure modes of RC columns based on key characteristic parameters

  • Yu, Bo;Yu, Zecheng;Li, Qiming;Li, Bing
    • Structural Engineering and Mechanics
    • /
    • v.84 no.1
    • /
    • pp.1-16
    • /
    • 2022
  • An efficient and accurate classification method for failure modes of reinforced concrete (RC) columns was proposed based on key characteristic parameters. The weight coefficients of seven characteristic parameters for failure modes of RC columns were determined first based on the support vector machine-recursive feature elimination. Then key characteristic parameters for classifying flexure, flexure-shear and shear failure modes of RC columns were selected respectively. Subsequently, a support vector machine with key characteristic parameters (SVM-K) was proposed to classify three types of failure modes of RC columns. The optimal parameters of SVM-K were determined by using the ten-fold cross-validation and the grid-search algorithm based on 270 sets of available experimental data. Results indicate that the proposed SVM-K has high overall accuracy, recall and precision (e.g., accuracy>95%, recall>90%, precision>90%), which means that the proposed SVM-K has superior performance for classification of failure modes of RC columns. Based on the selected key characteristic parameters for different types of failure modes of RC columns, the accuracy of SVM-K is improved and the decision function of SVM-K is simplified by reducing the dimensions and number of support vectors.

Performance evaluation of principal component analysis for clustering problems

  • Kim, Jae-Hwan;Yang, Tae-Min;Kim, Jung-Tae
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.8
    • /
    • pp.726-732
    • /
    • 2016
  • Clustering analysis is widely used in data mining to classify data into categories on the basis of their similarity. Through the decades, many clustering techniques have been developed, including hierarchical and non-hierarchical algorithms. In gene profiling problems, because of the large number of genes and the complexity of biological networks, dimensionality reduction techniques are critical exploratory tools for clustering analysis of gene expression data. Recently, clustering analysis of applying dimensionality reduction techniques was also proposed. PCA (principal component analysis) is a popular methd of dimensionality reduction techniques for clustering problems. However, previous studies analyzed the performance of PCA for only full data sets. In this paper, to specifically and robustly evaluate the performance of PCA for clustering analysis, we exploit an improved FCBF (fast correlation-based filter) of feature selection methods for supervised clustering data sets, and employ two well-known clustering algorithms: k-means and k-medoids. Computational results from supervised data sets show that the performance of PCA is very poor for large-scale features.

Mean Square Projection Error Gradient-based Variable Forgetting Factor FAPI Algorithm (평균 제곱 투영 오차의 기울기에 기반한 가변 망각 인자 FAPI 알고리즘)

  • Seo, YoungKwang;Shin, Jong-Woo;Seo, Won-Gi;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.177-187
    • /
    • 2014
  • This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

The Classification Using Probabilistic Neural Network and Redundancy Reduction on Very Large Scaled Chemical Gas Sensor Array (대규모 가스 센서 어레이에서 중복도의 제거와 확률신경회로망을 이용한 분류)

  • Kim, Jeong-Do;Lim, Seung-Ju;Park, Sung-Dae;Byun, Hyung-Gi;Persaud, K.C.;Kim, Jung-Ju
    • Journal of Sensor Science and Technology
    • /
    • v.22 no.2
    • /
    • pp.162-173
    • /
    • 2013
  • The purpose of this paper is to classify VOC gases by emulating the characteristics found in biological olfaction. For this purpose, we propose new signal processing method based a polymeric chemical sensor array consisting of 4096 sensors which is created by NEUROCHEM project. To remove unstable sensors generated in the manufacturing process of very large scaled chemical sensor array, we used discrete wavelet transformation and cosine similarity. And, to remove the supernumerary redundancy, we proposed the method of selecting candidates of representative sensor representing sensors with similar features by Fuzzy c-means algorithm. In addition, we proposed an improved algorithm for selecting representative sensors among candidates of representative sensors to better enhance classification ability. However, Classification for very large scaled sensor array has a great deal of time in process of learning because many sensors are used for learning though a redundancy is removed. Throughout experimental trials for classification, we confirmed the proposed method have an outstanding classification ability, at transient state as well as steady state.

Korean Named Entity Recognition and Classification using Word Embedding Features (Word Embedding 자질을 이용한 한국어 개체명 인식 및 분류)

  • Choi, Yunsu;Cha, Jeongwon
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.678-685
    • /
    • 2016
  • Named Entity Recognition and Classification (NERC) is a task for recognition and classification of named entities such as a person's name, location, and organization. There have been various studies carried out on Korean NERC, but they have some problems, for example lacking some features as compared with English NERC. In this paper, we propose a method that uses word embedding as features for Korean NERC. We generate a word vector using a Continuous-Bag-of-Word (CBOW) model from POS-tagged corpus, and a word cluster symbol using a K-means algorithm from a word vector. We use the word vector and word cluster symbol as word embedding features in Conditional Random Fields (CRFs). From the result of the experiment, performance improved 1.17%, 0.61% and 1.19% respectively for TV domain, Sports domain and IT domain over the baseline system. Showing better performance than other NERC systems, we demonstrate the effectiveness and efficiency of the proposed method.