• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.5
• /
• pp.335-342
• /
• 2016

When dynamics changes occurred in an existing Bayesian Network (BN), the related parameters embedding on the BN have to be updated to new parameters adapting to changed patterns. In this case, these parameters have to be updated with the consideration of the causalities in the BN. This research suggests a framework for updating parameters dynamically using Expectation Maximization (EM) algorithm and Harmony Search (HS) algorithm among several Meta-Heuristics techniques. While EM is an effective algorithm for estimating hidden parameters, it has a limitation that the generated solution converges a local optimum in usual. In order to overcome the limitation, this paper applies HS for tracking the global optimum values of Maximum Likelihood Estimators (MLE) of parameters. The proposed method suggests a learning and propagation framework of BN with dynamic changes for overcoming disadvantages of EM algorithm and converging a global optimum value of MLE of parameters.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.369-376
• /
• 2006

This paper presents a new method of significantly improving conventional Bayesian statistical text classifier by incorporating accelerated EM(Expectation Maximization) algorithm. EM algorithm experiences a slow convergence and performance degrade in its iterative process, especially when real online-textual documents do not follow EM's assumptions. In this study, we propose a new accelerated EM algorithm with uncertainty-based selective sampling, which is simple yet has a fast convergence speed and allow to estimate a more accurate classification model on Naive Bayesian text classifier. Experiments using the popular Reuters-21578 document collection showed that the proposed algorithm effectively improves classification accuracy.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2
• /
• pp.21-26
• /
• 2001

An expectation-maximization (EM) based Bayesian adaptation method for the mean of noise is proposed for noise-robust speech recognition. In the algorithm, the on-line testing utterances are used for the unsupervised Bayesian adaptation and the prior distribution of the noise mean is estimated using the off-line training data. For the noisy speech modeling, the parallel model combination (PMC) method is employed. The proposed method has shown to be effective compared with the conventional PMC method for the speech recognition experiments in a car-noise condition.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1307-1310
• /
• 2008

EM(Expectation Maximization)은 불확실한 데이터들을 가지고 분포를 모델링하는, 널리 알려진 군집화 알고리즘이다. EM 알고리즘에서, 정규 분포는 기대(Expectation)-최대화(Maximization)과정을 반복하는 과정에서 그 윤곽을 다져간다. 이 때 이 과정은 EM 알고리즘의 다양한 확률 초기화에 따라 다른 결과를 내게 된다, 본 논문에서는 이 확률 초기화 값의 조정을 통하여 HAPS(High Altitude Platform Station) 기반 네트워크에서 이동 기지국의 위치를 실시간으로 결정하고자 하는 문제를 풀기 위한 조건을 몇 가지 반영시켜 확률 초기 값을 결정해 보고, 그 결과를 제시한다. 이에 더불어, ITU에서 제한하고 있는 이동 기지국의 서비스 반경을 고려하는 방법을 제시한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.170-173
• /
• 2002

본 논문에서는 여러 분야에서 널리 응용되고 있는 적응 뉴로-퍼지 시스템(ANFIS)에서의 효과적인 퍼지 규칙 생성방법을 제안한다. ANFIS의 성능 개선을 위해 구조동정을 수행함에 있어서 전제부 파라미터는 EM(Expectation-Maximization) 알고리즘을 적용하였으며, 파라미터학습은 Jang에 의한 하이브리드 방법을 적용한다. 여기서 초기의 중심과 분산을 구하기 위해 FCM(Fuzzy c-means) 클러스터링 기법을 사용하였다. 이렇게 함으로서 적은 규칙 수를 가지면서도 효율적인 퍼지 규칙을 얻을 수 있도록 하였다. 이들 방법의 유용함을 보이고자 Box-Jenkins의 가스로 데이터에 적용하여 제안된 방법이 이전의 연구보다 좋은 결과를 보임을 보이고자 한다

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.15-26
• /
• 2003

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 space. This paper describes an alternative approach which uses the least mean square (LMS) method and expectation 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 maximization (SAGE) algorithm In 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.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.454-460
• /
• 2003

In this paper, we propose an efficient method for recognizing human lips. Based on Point Distribution Model, a lip shape is represented as a set of points. We calculate a lip model and the distribution of shape parameters using Principle Component Analysis and Gaussian mixture, respectively. The Expectation Maximization algorithm is used to determine the maximum likelihood parameter of Gaussian mixture. The lip contour model is derived by using the gray value changes at each point and in regions around the point and used to search the lip shape in a image. The experiments have been performed for many images, and show very encouraging result.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.623-629
• /
• 2004

In this paper, a Efficient method for the mixed image separation is presented using independent component analysis and the new fast expectation-maximization(EM) algorithm. In general, the independent component analysis (ICA) is one of the widely used statistical signal processing scheme in various applications. However, it has been known that ICA does not establish good performance in source separation by itself. So, Innovation process which is one of the methods that were employed in image separation using ICA, which produces improved the mixed image separation. Unfortunately, the innovation process needs long processing time compared with ICA or EM. Thus, in order to overcome this limitation, we proposed new method which combined ICA with the New fast EM algorithm instead of using the innovation process. Proposed method improves the performance and reduces the total processing time for the Image separation. We compared our proposed method with ICA combined with innovation process. The experimental results show the effectiveness of the proposed method by applying it to image separation problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2446-2462
• /
• 2016

In this paper, a frequency domain Expectation-Maximization (EM)-based channel estimation algorithm for Space Time Block Coded-Orthogonal Frequency Division Multiplexing (STBC-OFDM) systems is investigated to support higher data rate applications in wireless communications. The computational complexity of the frequency domain EM-based channel estimation is increased when higher order constellations are used because of the ascending size of the search set space. Thus, a search set reduction algorithm is proposed to decrease the complexity without sacrificing the system performance. The performance results of the proposed algorithm is obtained in terms of Bit Error Rate (BER) and Mean Square Error (MSE) for 16QAM and 64QAM modulation schemes.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2007.06a
• /
• pp.139-144
• /
• 2007

Recording data in hundreds of narrow contiguous spectral intervals, hyperspectral images have provided the opportunity to detect small differences in material composition. But a limitation of a hyperspectral image is the signal to noise ratio (SNR) lower than that of a multispectral image. This paper presents the efficiency of Spectral Similarity Scale (SSS) in change detection of hyperspectral image and the experiment was performed with Hyperion data. SSS is an algorithm that objectively quantifies differences between reflectance spectra in both magnitude and direction dimensions. The thresholds for detecting the change area were determined through Expectation-Maximization (EM) algorithm. The experimental result shows that the SSS algorithm and EM algorithm are efficient enough to be applied to the unsupervised change detection of hyperspectral images.