• Title/Summary/Keyword: k-means clustering Algorithm

Search Result 545, Processing Time 0.029 seconds

Mobile Application based on Image Processing and a Proportion for Food Intake Measuring

  • Kim, Do-Hyeon;Kim, Yoon;Han, Yu-Ri
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.5
    • /
    • pp.57-63
    • /
    • 2017
  • In the paper, we propose a new reliable technique for measuring food intake based on image automatically without user intervention. First, food and bowl image before and after meal is obtained by user. The food and the bowl are divided into each region by the K-means clustering, Otsu algorithm, Morphology, etc. And the volume of food is measured by a proportional expression based on the information of the container such as it's entrance diameter, depth, and bottom diameter. Finally, our method calculates the volume of the consumed food by the difference between before and after meal. The proposed technique has higher accuracy than existing method for measuring food intake automatically. The experiment result shows that the average error rate is up to 7% for three types of containers. Computer simulation results indicate that the proposed algorithm is a convenient and accurate method of measuring the food intake.

Implementation of Elbow Method to improve the Gases Classification Performance based on the RBFN-NSG Algorithm

  • Jeon, Jin-Young;Choi, Jang-Sik;Byun, Hyung-Gi
    • Journal of Sensor Science and Technology
    • /
    • v.25 no.6
    • /
    • pp.431-434
    • /
    • 2016
  • Currently, the radial basis function network (RBFN) and various other neural networks are employed to classify gases using chemical sensors arrays, and their performance is steadily improving. In particular, the identification performance of the RBFN algorithm is being improved by optimizing parameters such as the center, width, and weight, and improved algorithms such as the radial basis function network-stochastic gradient (RBFN-SG) and radial basis function network-normalized stochastic gradient (RBFN-NSG) have been announced. In this study, we optimized the number of centers, which is one of the parameters of the RBFN-NSG algorithm, and observed the change in the identification performance. For the experiment, repeated measurement data of 8 samples were used, and the elbow method was applied to determine the optimal number of centers for each sample of input data. The experiment was carried out in two cases(the only one center per sample and the optimal number of centers obtained by elbow method), and the experimental results were compared using the mean square error (MSE). From the results of the experiments, we observed that the case having an optimal number of centers, obtained using the elbow method, showed a better identification performance than that without any optimization.

Optimization of Fuzzy Learning Machine by Using Particle Swarm Optimization (PSO 알고리즘을 이용한 퍼지 Extreme Learning Machine 최적화)

  • Roh, Seok-Beom;Wang, Jihong;Kim, Yong-Soo;Ahn, Tae-Chon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.1
    • /
    • pp.87-92
    • /
    • 2016
  • In this paper, optimization technique such as particle swarm optimization was used to optimize the parameters of fuzzy Extreme Learning Machine. While the learning speed of conventional neural networks is very slow, that of Extreme Learning Machine is very fast. Fuzzy Extreme Learning Machine is composed of the Extreme Learning Machine with very fast learning speed and fuzzy logic which can represent the linguistic information of the field experts. The general sigmoid function is used for the activation function of Extreme Learning Machine. However, the activation function of Fuzzy Extreme Learning Machine is the membership function which is defined in the procedure of fuzzy C-Means clustering algorithm. We optimize the parameters of the membership functions by using optimization technique such as Particle Swarm Optimization. In order to validate the classification capability of the proposed classifier, we make several experiments with the various machine learning datas.

Design of Fingerprints Identification Based on RBFNN Using Image Processing Techniques (영상처리 기법을 통한 RBFNN 패턴 분류기 기반 개선된 지문인식 시스템 설계)

  • Bae, Jong-Soo;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.6
    • /
    • pp.1060-1069
    • /
    • 2016
  • In this paper, we introduce the fingerprint recognition system based on Radial Basis Function Neural Network(RBFNN). Fingerprints are classified as four types(Whole, Arch, Right roof, Left roof). The preprocessing methods such as fast fourier transform, normalization, calculation of ridge's direction, filtering with gabor filter, binarization and rotation algorithm, are used in order to extract the features on fingerprint images and then those features are considered as the inputs of the network. RBFNN uses Fuzzy C-Means(FCM) clustering in the hidden layer and polynomial functions such as linear, quadratic, and modified quadratic are defined as connection weights of the network. Particle Swarm Optimization (PSO) algorithm optimizes a number of essential parameters needed to improve the accuracy of RBFNN. Those optimized parameters include the number of clusters and the fuzzification coefficient used in the FCM algorithm, and the orders of polynomial of networks. The performance evaluation of the proposed fingerprint recognition system is illustrated with the use of fingerprint data sets that are collected through Anguli program.

Fault Diagnosis for Rotating Machine Using Feature Extraction and Minimum Detection Error Algorithm (특징 추출과 검출 오차 최소화 알고리듬을 이용한 회전기계의 결함 진단)

  • Chong, Ui-pil;Cho, Sang-jin;Lee, Jae-yeal
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.16 no.1 s.106
    • /
    • pp.27-33
    • /
    • 2006
  • Fault diagnosis and condition monitoring for rotating machines are important for efficiency and accident prevention. The process of fault diagnosis is to extract the feature of signals and to classify each state. Conventionally, fault diagnosis has been developed by combining signal processing techniques for spectral analysis and pattern recognition, however these methods are not able to diagnose correctly for certain rotating machines and some faulty phenomena. In this paper, we add a minimum detection error algorithm to the previous method to reduce detection error rate. Vibration signals of the induction motor are measured and divided into subband signals. Each subband signal is processed to obtain the RMS, standard deviation and the statistic data for constructing the feature extraction vectors. We make a study of the fault diagnosis system that the feature extraction vectors are applied to K-means clustering algorithm and minimum detection error algorithm.

Voice Activity Detection Algorithm base on Radial Basis Function Networks with Dual Threshold (Radial Basis Function Networks를 이용한 이중 임계값 방식의 음성구간 검출기)

  • Kim Hong lk;Park Sung Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12C
    • /
    • pp.1660-1668
    • /
    • 2004
  • This paper proposes a Voice Activity Detection (VAD) algorithm based on Radial Basis Function (RBF) network using dual threshold. The k-means clustering and Least Mean Square (LMS) algorithm are used to upade the RBF network to the underlying speech condition. The inputs for RBF are the three parameters in a Code Exited Linear Prediction (CELP) coder, which works stably under various background noise levels. Dual hangover threshold applies in BRF-VAD for reducing error, because threshold value has trade off effect in VAD decision. The experimental result show that the proposed VAD algorithm achieves better performance than G.729 Annex B at any noise level.

Identification of Heterogeneous Prognostic Genes and Prediction of Cancer Outcome using PageRank (페이지랭크를 이용한 암환자의 이질적인 예후 유전자 식별 및 예후 예측)

  • Choi, Jonghwan;Ahn, Jaegyoon
    • Journal of KIISE
    • /
    • v.45 no.1
    • /
    • pp.61-68
    • /
    • 2018
  • The identification of genes that contribute to the prediction of prognosis in patients with cancer is one of the challenges in providing appropriate therapies. To find the prognostic genes, several classification models using gene expression data have been proposed. However, the prediction accuracy of cancer prognosis is limited due to the heterogeneity of cancer. In this paper, we integrate microarray data with biological network data using a modified PageRank algorithm to identify prognostic genes. We also predict the prognosis of patients with 6 cancer types (including breast carcinoma) using the K-Nearest Neighbor algorithm. Before we apply the modified PageRank, we separate samples by K-Means clustering to address the heterogeneity of cancer. The proposed algorithm showed better performance than traditional algorithms for prognosis. We were also able to identify cluster-specific biological processes using GO enrichment analysis.

Identification of Fuzzy Inference System Based on Information Granulation

  • Huang, Wei;Ding, Lixin;Oh, Sung-Kwun;Jeong, Chang-Won;Joo, Su-Chong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.575-594
    • /
    • 2010
  • In this study, we propose a space search algorithm (SSA) and then introduce a hybrid optimization of fuzzy inference systems based on SSA and information granulation (IG). In comparison with "conventional" evolutionary algorithms (such as PSO), SSA leads no.t only to better search performance to find global optimization but is also more computationally effective when dealing with the optimization of the fuzzy models. In the hybrid optimization of fuzzy inference system, SSA is exploited to carry out the parametric optimization of the fuzzy model as well as to realize its structural optimization. IG realized with the aid of C-Means clustering helps determine the initial values of the apex parameters of the membership function of fuzzy model. The overall hybrid identification of fuzzy inference systems comes in the form of two optimization mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and polyno.mial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by SSA and C-Means while the parameter estimation is realized via SSA and a standard least square method. The evaluation of the performance of the proposed model was carried out by using four representative numerical examples such as No.n-linear function, gas furnace, NO.x emission process data, and Mackey-Glass time series. A comparative study of SSA and PSO demonstrates that SSA leads to improved performance both in terms of the quality of the model and the computing time required. The proposed model is also contrasted with the quality of some "conventional" fuzzy models already encountered in the literature.

Analysis of Departing Passengers' Dwell Time using Clustering Techniques (클러스터링 기법을 활용한 출발 여객 체류 시간 분석)

  • An, Deok-bae;Kim, Hui-yang;Baik, Ho-jong
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.5
    • /
    • pp.380-385
    • /
    • 2019
  • This paper is concerned with departure passengers' dwell time analysis using real system data. Previous researches emphasize the importance of dwell time analysis from perspective of airport terminal planning and non-aeronautical revenue. However, short-term airport operation using passengers' dwell time is considered impossible due to absence of passengers' behavior data. Recently, in accordance with the wave of smart airport, world leading airports are systematically collecting passenger data. So there is high possibility of analyzing passengers' dwell time with the data stacked in the airport database. We conducted dwell time analysis using data from Incheon Int'l airport. In order to handle passenger data, we adapted clustering algorithm which is one of data mining techniques. As a clustering result, passengers are divided into 3 clusters. One is the cluster for passengers whose dwell time is relatively short and who tend to spend longer time in the airside. Another is the cluster for passengers who have near 3 hours dwell time. The other is the cluster for passengers whose total dwell time is extremely long.

Automatic Construction of Reduced Dimensional Cluster-based Keyword Association Networks using LSI (LSI를 이용한 차원 축소 클러스터 기반 키워드 연관망 자동 구축 기법)

  • Yoo, Han-mook;Kim, Han-joon;Chang, Jae-young
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1236-1243
    • /
    • 2017
  • In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.