• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.772-780
• /
• 2008

K-means is one of the simplest unsupervised learning algorithms that solve the clustering problem. However K-means suffers the basic shortcoming: the number of clusters k has to be known in advance. In this paper, we propose extensions of X-means, which can estimate the number of clusters using Bayesian information criterion(BIC). We introduce two different versions of algorithm: modified X-means(MX-means) and generalized X-means(GX-means), which employ one full covariance matrix for one cluster and so can estimate the number of clusters efficiently without severe over-fitting which X-means suffers due to its spherical cluster assumption. The algorithms start with one cluster and try to split a cluster iteratively to maximize the BIC score. The former uses K-means algorithm to find a set of optimal clusters with current k, which makes it simple and fast. However it generates wrongly estimated centers when the clusters are overlapped. The latter uses EM algorithm to estimate the parameters and generates more stable clusters even when the clusters are overlapped. Experiments with synthetic data show that the purposed methods can provide a robust estimate of the number of clusters and cluster parameters compared to other existing top-down algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.15-23
• /
• 2017

The person Re-identification is the most challenging part of computer vision due to the significant changes in human pose and background clutter with occlusions. The picture from non-overlapping cameras enhance the difficulty to distinguish some person from the other. To reach a better performance match, most methods use feature selection and distance metrics separately to get discriminative representations and proper distance to describe the similarity between person and kind of ignoring some significant features. This situation has encouraged us to consider a novel method to deal with this problem. In this paper, we proposed an enhanced recurrent neural network with three-tier hierarchical network for person re-identification. Specifically, the proposed recurrent neural network (RNN) model contain an iterative expectation maximum (EM) algorithm and three-tier Hierarchical network to jointly learn both the discriminative features and metrics distance. The iterative EM algorithm can fully use of the feature extraction ability of convolutional neural network (CNN) which is in series before the RNN. By unsupervised learning, the EM framework can change the labels of the patches and train larger datasets. Through the three-tier hierarchical network, the convolutional neural network, recurrent network and pooling layer can jointly be a feature extractor to better train the network. The experimental result shows that comparing with other researchers' approaches in this field, this method also can get a competitive accuracy. The influence of different component of this method will be analyzed and evaluated in the future research.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.23-36
• /
• 2009

Network intrusion detection have been continuously improved by using data mining techniques. There are two kinds of methods in intrusion detection using data mining-supervised learning with class label and unsupervised learning without class label. In this paper we have studied the way of improving network intrusion detection accuracy by using LBG clustering algorithm which is one of unsupervised learning methods. The K-means method, that starts with random initial centroids and performs clustering based on the Euclidean distance, is vulnerable to noisy data and outliers. The nonuniform binary split algorithm uses binary decomposition without assigning initial values, and it is relatively fast. In this paper we applied the EM(Expectation Maximization) based LBG algorithm that incorporates the strength of two algorithms to intrusion detection. The experimental results using the KDD cup dataset showed that the accuracy of detection can be improved by using the LBG algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.8
• /
• pp.390-396
• /
• 2007

In this letter, we propose a novel approach to improve the performance of speech/music classification for the selectable mode vocoder(SMV) of 3GPP2 using the Gaussian mixture model(GMM) which is based on the expectation-maximization(EM) algorithm. We first present an effective analysis of the features and the classification method adopted in the conventional SMV. And then feature vectors which are applied to the GMM are selected from relevant Parameters of the SMV for the efficient speech/music classification. The performance of the proposed algorithm is evaluated under various conditions and yields better results compared with the conventional scheme of the SMV.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.105-106
• /
• 2017

본 논문에서는 최대 우도 기반 파라미터 생성 알고리즘을 적용하여 인공 신경망의 출력인 음향 파라미터 열의 정확성 및 자연성을 향상시키는 방법을 제안하였다. 인공 신경망의 출력으로 정적 특징벡터 뿐 만 아니라 동적 특징벡터도 함께 사용하였고, 미리 계산된 파라미터 분산을 파라미터 생성에 사용하였다. 추정된 정적, 동적 특징벡터의 평균, 분산을 EM 알고리즘에 적용하여 최대 우도 기준 파라미터를 추정할 수 있다. 제안된 알고리즘은 파라미터 생성 시 동적 특징벡터 및 분산을 함께 적용하여 시간축에서의 자연성을 향상시켰다. 제안된 알고리즘의 객관적 평가로 MCD, F0 의 RMSE 를 측정하였고, 주관적평가로 선호도 평가를 실시하였다. 그 결과 기존 알고리즘 대비 객관적, 주관적 성능이 향상되는 것을 검증하였다.

• Journal of Biomedical Engineering Research
• /
• v.30 no.1
• /
• pp.56-65
• /
• 2009

Compton imaging is often recognized as a potentially more valuable 3-D technique in nuclear medicine than conventional emission tomography. Due to inherent computational limitations, however, it has been of a difficult problem to reconstruct images with good accuracy. In this work we show that the row-action maximum likelihood algorithm (RAMLA), which have proven useful for conventional tomographic reconstruction, can also be applied to the problem of 3-D reconstruction of cone-beam projections from Compton scattered data. The major advantage of RAMLA is that it converges to a true maximum likelihood solution at an order of magnitude faster than the standard expectation maximiation (EM) algorithm. For our simulations, we first model a Compton camera system consisting of the three pairs of scatterer and absorber detectors placed at x-, y- and z-axes, and generate conical projection data using a software phantom. We then compare the quantitative performance of RAMLA and EM reconstructions in terms of the percentage error. The net conclusion based on our experimental results is that the RAMLA applied to Compton camera reconstruction significantly outperforms the EM algorithm in convergence rate; while computational costs of one iteration of RAMLA and EM are about the same, one iteration of RAMLA performs as well as 128 iterations of EM.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.25 no.1
• /
• pp.27-35
• /
• 2005

Ultrasonic inspection methods are widely used for detecting flaws in materials. The signal analysis step plays a crucial part in the data interpretation process. A number of signal processing methods have been proposed to classify ultrasonic flaw signals. One of the more popular methods involves the extraction of an appropriate set of features followed by the use of a neural network for the classification of the signals in the feature spare. This paper describes an alternative approach which uses the least mean square (LMS) method and exportation maximization (EM) algorithm with the model based deconvolution which is employed for classifying nondestructive evaluation (NDE) signals from steam generator tubes in a nuclear power plant. The signals due to cracks and deposits are not significantly different. These signals must be discriminated to prevent from happening a huge disaster such as contamination of water or explosion. A model based deconvolution has been described to facilitate comparison of classification results. The method uses the space alternating generalized expectation maximiBation (SAGE) algorithm ill conjunction with the Newton-Raphson method which uses the Hessian parameter resulting in fast convergence to estimate the time of flight and the distance between the tube wall and the ultrasonic sensor. Results using these schemes for the classification of ultrasonic signals from cracks and deposits within steam generator tubes are presented and showed a reasonable performances.

• Geophysics and Geophysical Exploration
• /
• v.22 no.4
• /
• pp.186-194
• /
• 2019

Deterministic optimization, commonly used to find the geophysical inverse solutions, have its limitation that it cannot find the proper solution since it might converge into the local minimum. One of the solutions to this problem is to use global optimization based on a stochastic approach, among which a large number of particle swarm optimization (PSO) applications have been introduced. In this paper, I developed a geophysical inversion algorithm applying PSO method for the layered-earth resistivity inversion of the small-loop electromagnetic (EM) survey data and carried out numerical inversion experiments on synthetic datasets. From the results, it is confirmed that the PSO inversion algorithm could increase the inversion success rate even when attempting the inversion of small-loop EM survey data from which it might be difficult to find a best solution by applying the Gauss-Newton inversion algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.7-12
• /
• 2019

Ambient backscatter communication is limited to channel estimation technique through a pilot signal, which is a channel estimation method in current RF communication, due to transmission power efficiency. In a limited transmission power environment, the research of traditional ambient backscatter communication has been studied assuming that it is an ideal channel without signal distortions due to channel conditions. In this paper, we propose an expectation-maximization(EM) algorithm, one of the blind channel estimation techniques, as a channel estimation method in ambient backscatter communication system which is the state of channel following normal distribution. In the proposed system model, the simulations confirm that channel estimate through EM algorithm is approaching the lower bound of the mean square error compared with the Bayesian Cramer-Rao Boundary(BCRB) to check performance. It shows that the channel parameter can be estimated in the ambient backscatter communication system.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.645-648
• /
• 2009

본 논문에서는 안테나 설계에 있어서 자동화 설계 프로세스를 제안하고자 한다. 안테나 설계는 최적화를 위한 반복적인 시뮬레이션 과정을 거쳐야 하며, 설계된 안테나의 실제 적용 시 튜닝 과정을 통한 시간이 많이 소요되는 경우가 있다. 본 논문에서는 유전자 알고리즘을 이용 하여 초기 안테나 모델 설계 시 안테나 설계자에게 사용 가능한 다양한 모델을 제시하며, 안테나 설계 시 중요 인자를 제시함으로써 초기 설계 및 방향설정의 시간을 줄이고자 한다. 사용된 최적화 알고리즘은 Non-dominated Sorting 유전자 알고리즘이며, 이 알고리즘은 multi-objective를 가지는 문제 해결에 적합한 알고리즘이다. 안테나 설계를 위한 EM computational tool로는 ESP V.5가 사용되었다. 시뮬레이션 결과를 통해 사용 가능한 적합한 안테나 모델을 제시하였다.