• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1161-1170
• /
• 2004

This paper proposes to segment skin color areas using a clustering algorithm. Most of previously proposed clustering algorithms have some difficulties, since they generally detect hyperspherical clusters, run in a batch mode, and predefine a number of clusters. In this paper, we use a well-known elliptical clustering algorithm, an EM algorithm, and modify it to learn on-line and find automatically the number of clusters, called to an EAM algorithm. The effectiveness of the EAM algorithm is demonstrated on a task of skin color region segmentation. Experimental results present the EAM algorithm automatically finds a right number of clusters in a given image without any information on the number. Comparing with the EM algorithm, we achieved better segmentation results with the EAM algorithm. Successful results were achieved to detect and segment skin color regions using a conditional probability on a region. Also, we applied to classify images with persons and got good classification results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.6
• /
• pp.523-528
• /
• 2015

In this paper, we propose a new multiresolutional and dynamic approach of the EM algorithm. EM is a very popular and powerful clustering algorithm. EM, however, has problems that indexes multiresolution data and requires a priori information on a proper number of clusters in many applications, To solve such problems, the proposed EM algorithm can impose a multiresolution kd-tree structure in the E-step and allocates a cluster based on sequential data. To validate clusters, we use a merge criteria for cluster merging. We demonstrate the proposed EM algorithm outperforms for texture image segmentation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.1
• /
• pp.16-22
• /
• 2014

Clustering methods such as k-means and EM are the group of classification and pattern recognition, which are used in management science and literature search widely. In this paper, k-means and EM algorithm are compared the performance using by Weka. The winning Lottery numbers of 567 cases are experimented for our study and presentation. Processing speed of the k-means algorithm is superior to the EM algorithm, which is about 0.08 seconds faster than the other. As the result it is summerized that EM algorithm is better than K-means algorithm with comparison of accuracy, precision and recall. While K-means is known to be sensitive to the distribution of data, EM algorithm is probability sensitive for clustering.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.181-189
• /
• 2010

HAP(High Altitude Platform) is a stationary aerial platform positioned in the stratosphere between 17Km and 22Km height and it could act as an MBS (Mobile Base Station). HAP based Network has advantages of both satellite system and terrestrial communication system. In this paper we study the deploy of multiple HAP MBS that can provides efficient communication for users. For this study, EM(Expectation Maximization) clustering algorithm is used to cluster terrestrial mobile nodes. The object of this paper is improving EM algorithm into the clustering algorithm for efficiency in variety aspects considering distance between mobile terminal units and speed of mobile terminal units, and estimating performance of HAP MBS deploy technique with use of improved EM algorithm using RWP (Random Waypoint) node mobility.

• Communications for Statistical Applications and Methods
• /
• v.14 no.1
• /
• pp.205-213
• /
• 2007

In this paper, the normal mixture model subjected to general linear restriction for component-means based on linear regression is proposed, and its fitting method by EM algorithm and Lagrange multiplier is provided. This model is applied to gene clustering of microarray expression data, which demonstrates it has very good performances for real data set. This model also allows to obtain the clusters that an analyst wants to find out in the fashion that the hypothesis for component-means is represented by the design matrices and the linear restriction matrices.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.575-587
• /
• 2004

In this paper. a new Fast Expectation-Maximization algorithm(FEM) is proposed. Firstly the K-means algorithm is modified to reduce the number of iterations for finding the initial values that are used as the initial values in EM process. Conventionally the Initial values in K-means clustering are chosen randomly. which sometimes forces the process of clustering converge to some undesired center points. Uniform partitioning method is added to the conventional K-means to extract the proper initial points for each clusters. Secondly the effect of posterior probability is emphasized such that the application of Maximum Likelihood Posterior(MLP) yields fast convergence. The proposed FEM strengthens the characteristics of conventional EM by reinforcing the speed of convergence. The superiority of FEM is demonstrated in experimental results by presenting the improvement results of EM and accelerating the speed of convergence in parameter estimation procedures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1160-1167
• /
• 2012

Identifying traffic is an important issue for many networking applications including quality of service, firewall enforcement, and network security. Once we know the purpose of using the traffic in the firewall, we can allow or deny it and provide quality of service, and effective operation in terms of security. However, a number of applications encrypts traffics in order to enhance security or privacy. As a result, effective traffic monitoring is getting more difficult. In this paper, we analyse SSH encrypted traffic and identify differences among SSH tunneling, SFTP, and normal SSH traffics. By using EM clustering, we identify traffics and validate experiment results.

• International Journal of Advanced Culture Technology
• /
• v.5 no.3
• /
• pp.40-45
• /
• 2017

This data mining technique was used to extract useful information from percutaneous coronary intervention data obtained from the US public data homepage. The experiment was performed by extracting data on the area, frequency of operation, and the number of deaths. It led us to finding of meaningful correlations, patterns, and trends using various algorithms, pattern techniques, and statistical techniques. In this paper, information is obtained through efficient decision tree and cluster analysis in predicting the incidence of percutaneous coronary intervention and mortality. In the cluster analysis, EM algorithm was used to evaluate the suitability of the algorithm for each situation based on performance tests and verification of results. In the cluster analysis, the experimental data were classified using the EM algorithm, and we evaluated which models are more effective in comparing functions. Using data mining technique, it was identified which areas had effective treatment techniques and which areas were vulnerable, and we can predict the frequency and mortality of percutaneous coronary intervention for heart disease.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.416-426
• /
• 2003

In this paper we propose a new method for choosing the initial values of Expectation-Maximization(EM) algorithm that has been used in various applications for clustering. Conventionally, the initial values were chosen randomly, which sometimes yields undesired local convergence. Later, K-means clustering method was employed to choose better initial values, which is currently widely used. However the method using K-means still has the same problem of converging to local points. In order to resolve this problem, a new method of initializing values for the EM process. The proposed method not only strengthens the characteristics of EM such that the number of iteration is reduced in great amount but also removes the possibility of falling into local convergence.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.6
• /
• pp.1-8
• /
• 2009

Detecting entry and exit zones in a view covered by multiple cameras is an essential step to determine the topology of the camera setup, which is critical for achieving and sustaining the accuracy and efficiency of multi-camera surveillance system. In this paper, a graph theoretic clustering method is proposed to detect zones using data points which correspond to entry and exit events of objects in the camera view. The minimum spanning tree (MST) is constructed by associating the data points. Then a set of well-formed clusters is sought by removing inconsistent edges of the MST, based on the concepts of the cluster balance and the cluster density defined in the paper. Experimental results suggest that the proposed method is effective, even for sparsely elongated clusters which could be problematic for expectation-maximization (EM). In addition, comparing to the EM-based approaches, the number of data required to obtain stable outcome is relatively small, hence shorter learning period.