• 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.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.529-531
• /
• 2001

We present an expectation-maximization algorithm for principal component analysis via orthogonalization. The algorithm finds actual principal components, whereas previously proposed EM algorithms can only find principal subspace. New algorithm is simple and more efficient thant probabilistic PCA specially in noiseless cases. Conventional PCA needs computation of inverse of the covariance matrices, which makes the algorithm prohibitively expensive when the dimensions of data space is large. This EM algorithm is very powerful for high dimensional data when only a few principal components are needed.

• 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의 가스로 데이터에 적용하여 제안된 방법이 이전의 연구보다 좋은 결과를 보임을 보이고자 한다

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.61-63
• /
• 2005

Retreiving indoor scene reference image from database using visual information is important issue in Robot Navigation. Scene matching problem in navigation robot is not easy because input image that is taken in navigation process is affinly distorted. We represent probabilistic framework for the feature matching between features in input image and features in database reference images to guarantee robust scene matching efficiency. By reconstructing probabilistic scene matching framework we get a higher precision than the existing feaure-feature matching scheme. To construct probabilistic framework we represent each image as Gaussian Mixture Model using Expectation Maximization algorithm using SIFT(Scale Invariant Feature Transform).

• The Korean Journal of Applied Statistics
• /
• v.24 no.4
• /
• pp.609-622
• /
• 2011

The pattern of methylation draws significant attention from cancer researchers because it is believed that DNA methylation and gene expression have a causal relationship. As the interest in the role of methylation patterns in cancer studies (especially drug resistant cancers) increases, many studies have been done investigating the association between gene expression and methylation. However, a model-based approach is still in urgent need. We developed a finite mixture model in the Bayesian framework to find a possible relationship between gene expression and methylation. For inference, we employ Expectation-Maximization(EM) algorithm to deal with latent (unobserved) variable, producing estimates of parameters in the model. Then we validated our model through simulation study and then applied the method to real data: wild type and hydroxytamoxifen(OHT) resistant MCF7 breast cancer cell lines.

• 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 Information Science Society Conference
• /
• 1998.10c
• /
• pp.360-362
• /
• 1998

In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.405-406
• /
• 2006

This paper proposes the new algorithm for the extraction of the corresponding points. Our algorithm is based on RANSAC(Random Sample Consensus) with EM(Expectation-Maximization). In the procedure of RANSAC, N-points are selected by the result of EM instead of the random selection. EM+SAC algorithm is applied to the correspondence for the mosaicing.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.298-307
• /
• 2019

This paper investigates the use of the inverse-free sparse Bayesian learning (SBL) approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency-division multiplexing (OFDM)-based multiuser massive multiple-input multiple-output (MIMO) systems. The Bayesian inference method employs a truncated Gaussian mixture prior for the sought-after low-PAPR signal. To learn the prior signal, associated hyperparameters and underlying statistical parameters, we use the variational expectation-maximization (EM) iterative algorithm. The matrix inversion involved in the expectation step (E-step) is averted by invoking a relaxed evidence lower bound (relaxed-ELBO). The resulting inverse-free SBL algorithm has a much lower complexity than the standard SBL algorithm. Numerical experiments confirm the substantial improvement over existing methods in terms of PAPR reduction for different MIMO configurations.