• Title/Summary/Keyword: Expectation Maximization(EM)

Search Result 139, Processing Time 0.017 seconds

A Novel Expectation-Maximization based Channel Estimation for OFDM Systems (Expectation-Maximization 기반의 새로운 OFDM 채널 추정 방식)

  • Kim, Nam-Kyeom;Sohn, In-Soo;Shin, Jae-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4C
    • /
    • pp.397-402
    • /
    • 2009
  • Accurate estimation of time-selective fading channel is a difficult problem in OFDM(Orthogonal Frequency Division Multiplexing) system. There are many channel estimation algorithms that are very weak in noisy channel. For solving this problem, we use EM (Expectation-Maximization) algorithm for iterative optimization of the data. We propose an EM-LPC algorithm to estimate the time-selective fading. The proposed algorithm improves of the BER performance compared to EM based channel estimation algorithm and reduces the iteration number of the EM loop. We simulated the uncoded system. If coded system use the EM-LPC algorithm, the performance are enhanced because of the coding gain. The EM-LPC algorithm is able to apply to another communication system, not only OFDM systems. The image processing of the medical instruments that the demand of accurate estimation can also use the proposed algorithm.

Adaptive Threshold Detection Using Expectation-Maximization Algorithm for Multi-Level Holographic Data Storage (멀티레벨 홀로그래픽 저장장치를 위한 적응 EM 알고리즘)

  • Kim, Jinyoung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.809-814
    • /
    • 2012
  • We propose an adaptive threshold detector algorithm for multi-level holographic data storage based on the expectation-maximization (EM) method. In this paper, the signal intensities that are passed through the four-level holographic channel are modeled as a four Gaussian mixture with unknown DC offsets and the threshold levels are estimated based on the maximum likelihood criterion. We compare the bit error rate (BER) performance of the proposed algorithm with the non-adaptive threshold detection algorithm for various levels of DC offset and misalignments. Our proposed algorithm shows consistently acceptable performance when the DC offset variance is fixed or the misalignments are lower than 20%. When the DC offset varies with each page, the BER of the proposed method is acceptable when the misalignments are lower than 10% and DC offset variance is 0.001.

Metropolis-Hastings Expectation Maximization Algorithm for Incomplete Data (불완전 자료에 대한 Metropolis-Hastings Expectation Maximization 알고리즘 연구)

  • Cheon, Soo-Young;Lee, Hee-Chan
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.1
    • /
    • pp.183-196
    • /
    • 2012
  • The inference for incomplete data such as missing data, truncated distribution and censored data is a phenomenon that occurs frequently in statistics. To solve this problem, Expectation Maximization(EM), Monte Carlo Expectation Maximization(MCEM) and Stochastic Expectation Maximization(SEM) algorithm have been used for a long time; however, they generally assume known distributions. In this paper, we propose the Metropolis-Hastings Expectation Maximization(MHEM) algorithm for unknown distributions. The performance of our proposed algorithm has been investigated on simulated and real dataset, KOSPI 200.

Improved Expectation and Maximization via a New Method for Initial Values (새로운 초기치 선정 방법을 이용한 향상된 EM 알고리즘)

  • Kim, Sung-Soo;Kang, Jee-Hye
    • 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.

A Fuzzy Rule Extraction by EM Algorithm and A Design of Temperature Control System (EM 알고리즘에 의한 퍼지 규칙생성과 온도 제어 시스템의 설계)

  • 오범진;곽근창;유정웅
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.16 no.5
    • /
    • pp.104-111
    • /
    • 2002
  • This paper presents a fuzzy rule extraction method using EM(Expectation-Maximization) algorithm and a design method of adaptive neuro-fuzzy control. EM algorithm is used to estimate a maximum likelihood of a GMM(Gaussian Mixture Model) and cluster centers. The estimated clusters is used to automatically construct the fuzzy rules and membership functions for ANFIS(Adaptive Neuro-Fuzzy Inference System). Finally, we applied the proposed method to the water temperature control system and obtained better results with respect to the number of rules and SAE(Sum of Absolute Error) than previous techniques such as conventional fuzzy controller.

Channel Estimation for OFDM-based Cellular Systems Using a DEM Algorithm (OFDM 기반 셀룰라 시스템에서 DEM 알고리듬을 이용한 채널추정 기법)

  • Lee, Kyu-In;Woo, Kyung-Soo;Yi, Joo-Hyun;Yun, Sang-Boh;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7C
    • /
    • pp.635-643
    • /
    • 2007
  • In this paper, a decision-directed expectation maximization (DEM) algorithm is proposed to improve the performance of channel estimation in OFDM-based cellular systems. The DEM algorithm enables a mobile station (MS) with multiple antennas, located at the cell boundary, to increase the performance of channel estimation using transmit data, without decreasing spectral efficiency. Also, DEM algorithm can apply fast fading without loss of channel estimation performance because that includes channel variation factor in a group. It is verified by computer simulation that the DEM algorithm can reduce computational complexity significantly while improving the performance of channel estimation in fast fading channels, compared with the expectation maximization (EM) algorithm.

A New Fast EM Algorithm (새로운 고속 EM 알고리즘)

  • 김성수;강지혜
    • 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.

Analysis of Common Cause Failure Using Two-Step Expectation and Maximization Algorithm (2단계 EM 알고리즘을 이용한 공통원인 고장 분석)

  • Baek Jang Hyun;Seo Jae Young;Na Man Gyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.63-71
    • /
    • 2005
  • In the field of nuclear reactor safety study, common cause failures (CCFs) became significant contributors to system failure probability and core damage frequency in most Probabilistic risk assessments. However, it is hard to estimate the reliability of such a system, because of the dependency of components caused by CCFs. In order to analyze the system, we propose an analytic method that can find the parameters with lack of raw data. This study adopts the shock model in which the failure probability increases as the shock is cumulated. We use two-step Expectation and Maximization (EM) algorithm to find the unknown parameters. In order to verify the analysis result, we perform the simulation under same environment. This approach might be helpful to build the defensive strategy for the CCFs.

Prediction of Childhood Asthma Using Expectation Maximization and Minimum Description Length Algorithm

  • Kim, Hyo Seon;Park, Jong Suk;Nam, Dong Kyu;Jung, Yong Gyu
    • International Journal of Advanced Culture Technology
    • /
    • v.8 no.3
    • /
    • pp.275-279
    • /
    • 2020
  • Due to the recent rapid industrialization worldwide, the number of pediatric asthma patients is increasing. And the fine dust containing heavy metals is linked to the characteristics of high toxic lead due to the increase heating in factory operation and automobile driving. It is the reason of arsenic increasing. In the treatment of pediatric asthma patients, drug administration, oral drug entry, and HMPC (Home Management Plan of Care) are used. In this paper, we analyze the relationship between the onset of asthma and the method of prescription for specific childhood asthma in the United States using EM (Expectation Maximization) and MDL (Minimum Description Length) algorithms. And the association is also analyzed by comparing the nature of specific congestion between the past prevalence of digestive asthma and the recent prevalence of environmental pollution.

The Study of Direction Finding Algorithms for Coherent Multiple Signals in Uniform Circular Array (등각원형배열을 고려한 코히어런트 다중신호 방향탐지 기법 연구)

  • Park, Cheol-Sun;Lee, Ho-Joo;Jang, Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.1
    • /
    • pp.97-105
    • /
    • 2009
  • In this paper, the performance of AP(Alternating Projection) and EM(Expectation Maximization) algorithms is investigated in terms of detection of multiple signals, resolvability of coherent signals and the efficiency of sensor array processing. The basic idea of these algorithms is utilization of relaxation technique of successive 1D maximization to solve a direction finding problem by maximizing the multidimensional likelihood function. It means that the function is maximized over only for a single parameter while the other parameters are fixed at each step of the iteration. According to simulation results, the algorithms showed good performance for both incoherent and coherent multiple signals. Moreover, some advantages are identified for direction finding with very small samples and fast convergence. The performance of AP algorithm is compared with that of EM using multiple criteria such as the number of sensor, SNR, the number of samples, and convergence speed over uniform circular array. It is resulted AP algorithm is superior to EM overally except for one criterion, convergence speed. Especially, for EM algorithm there is no performance difference between incoherent and coherent case. In conclusion, AP and EM are viable and practical alternatives, which can be applied to a direction under due to the resolvability of multi-path signals, reliable performance and no troublesome eigen-decomposition of the sample-covariance matrix.