• 제목/요약/키워드: Expectation-Maximization algorithm

검색결과 165건 처리시간 0.024초

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

  • 전수영;이희찬
    • 응용통계연구
    • /
    • 제25권1호
    • /
    • pp.183-196
    • /
    • 2012
  • 결측자료(missing data), 절단분포(truncated distribution), 중도절단자료(censored data) 등 불완전한 자료(incomplete data)하의 추론문제(incomplete problems)는 통계학에서 자주 발생되는 현상이다. 이런 문제의 해결방법으로 Expectation Maximization, Monte Carlo Expectation Maximization, Stochastic Expectation Maximization 알고리즘 등을 이용하는 방법이 있지만, 정형화된 분포의 가정이 필요하다는 단점을 가지고 있다. 본 연구에서는 정형화된 분포의 가정이 없는 경우에 사용할 수 있는 Metropolis-Hastings Expectation Maximization(MHEM) 알고리즘을 제안하고자 한다. MHEM 알고리즘의 효율성은 중도절단자료(censored data)를 이용한 모의실험과 KOSPI 200 수익률의 실증자료분석를 통해 알수 있었다.

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

  • 김진영;이재진
    • 한국통신학회논문지
    • /
    • 제37A권10호
    • /
    • pp.809-814
    • /
    • 2012
  • 본 논문은 멀티레벨을 가지는 홀로그래픽 저장 장치에서 EM (Expectation-maximization) 알고리즘을 이용한 적응 문턱전압검출기를 제안한다. 멀티레벨을 이용한 홀로그래픽 저장 장치의 경우 DC 오프셋의 정도에 따라 비적응 문턱전압검출기의 성능에 매우 심각한 영향을 미친다. EM 방법은 채널을 통과한 데이터를 이용해 Expectation step과 maximization step을 반복하면서 평균과 분산을 추정하는 방법이다. DC 오프셋이 있는 상황에서 제안된 방법을 적용하여 문턱값을 찾아내서 검출한 결과 일정한 한도 내의 DC 오프셋의 경우는 DC 오프셋이 없는 경우와 동일한 성능을 보였다.

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

  • 김남겸;손인수;신재호
    • 한국통신학회논문지
    • /
    • 제34권4C호
    • /
    • pp.397-402
    • /
    • 2009
  • 대용량의 데이터 전송을 위해 최근에 많이 사용되고 있는 OFDM 시스템은 다중경로페이딩에는 유리하지만 시간 선택성 페이딩에서는 자유롭지 못하고 이를 위해 채널추정이 필요하게 된다. 이를 위해 본 논문에서는 기존의 EM 알고리즘의 성능을 향상시키기 위해 LPC 알고리즘을 접목시킨 EM-LPC 알고리즘을 제안했다. 이 알고리즘은 기존의 EM 알고리즘의 M-Step 다음에 LPC 알고리즘을 사용하여 미리 다음 pilot 데이터를 추정할 수 있게된다. 또한 interpolation을 통한 데이터 수정도 가능하게 된다. 살펴본 결과 EM-LPC 알고리즘이 기존의 LS 알고리즘과 EM 알고리즘보다 좋은 성능을 내는 것을 볼 수 있었다. 또한 EM 루프의 반복도 역시 줄어드는 것을 볼 수 있었다.

The Expectation and Sparse Maximization Algorithm

  • Barembruch, Steffen;Scaglione, Anna;Moulines, Eric
    • Journal of Communications and Networks
    • /
    • 제12권4호
    • /
    • pp.317-329
    • /
    • 2010
  • In recent years, many sparse estimation methods, also known as compressed sensing, have been developed. However, most of these methods presume that the measurement matrix is completely known. We develop a new blind maximum likelihood method-the expectation-sparse-maximization (ESpaM) algorithm-for models where the measurement matrix is the product of one unknown and one known matrix. This method is a variant of the expectation-maximization algorithm to deal with the resulting problem that the maximization step is no longer unique. The ESpaM algorithm is justified theoretically. We present as well numerical results for two concrete examples of blind channel identification in digital communications, a doubly-selective channel model and linear time invariant sparse channel model.

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

  • 이규인;우경수;이주현;윤상보;조용수
    • 한국통신학회논문지
    • /
    • 제32권7C호
    • /
    • pp.635-643
    • /
    • 2007
  • 본 논문에서는 OFDM(Orthogonal Frequency Division Multiplexing) 기반 셀룰라 시스템에서 채널추정 성능을 향상시키기 위한 DEM(Decision-directed Expectation Maximization) 알고리듬을 제안한다. DEM 알고리듬은 다중안테나를 사용하는 단말이 셀 경계지역에 위치하는 경우 데이터 신호를 이용하여 주파수 효율의 감소 없이 채널추정 성능을 향상시킬 수 있으며, 한 그룹 내 채널변화 성분을 고려하여 채널갱신을 함으로써 고속 이동환경에도 큰 열화 없이 채널추정 성능을 향상시킬 수 있다. 모의실험을 통하여 제안된 DEM 알고리듬이 EM(Expectation Maximization) 기법과 비교하여 고속이동 환경에서 채널추정 성능을 향상 시키면서 연산 복잡도를 크게 감소시킬 수 있음을 확인한다.

Variational Expectation-Maximization Algorithm in Posterior Distribution of a Latent Dirichlet Allocation Model for Research Topic Analysis

  • Kim, Jong Nam
    • 한국멀티미디어학회논문지
    • /
    • 제23권7호
    • /
    • pp.883-890
    • /
    • 2020
  • In this paper, we propose a variational expectation-maximization algorithm that computes posterior probabilities from Latent Dirichlet Allocation (LDA) model. The algorithm approximates the intractable posterior distribution of a document term matrix generated from a corpus made up by 50 papers. It approximates the posterior by searching the local optima using lower bound of the true posterior distribution. Moreover, it maximizes the lower bound of the log-likelihood of the true posterior by minimizing the relative entropy of the prior and the posterior distribution known as KL-Divergence. The experimental results indicate that documents clustered to image classification and segmentation are correlated at 0.79 while those clustered to object detection and image segmentation are highly correlated at 0.96. The proposed variational inference algorithm performs efficiently and faster than Gibbs sampling at a computational time of 0.029s.

Sparsity Adaptive Expectation Maximization Algorithm for Estimating Channels in MIMO Cooperation systems

  • Zhang, Aihua;Yang, Shouyi;Li, Jianjun;Li, Chunlei;Liu, Zhoufeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3498-3511
    • /
    • 2016
  • We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.

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

  • 백장현;서재영;나만균
    • 한국경영과학회지
    • /
    • 제30권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.

Bayesian Image Reconstruction Using Edge Detecting Process for PET

  • Um, Jong-Seok
    • 한국멀티미디어학회논문지
    • /
    • 제8권12호
    • /
    • pp.1565-1571
    • /
    • 2005
  • Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).

  • PDF

퍼지-베이시안을 이용한 인간.가축 분류 (Human-Livestock Classifier by Using Fuzzy Bayesian Algorithm)

  • 오명재;주영훈
    • 전기학회논문지
    • /
    • 제60권10호
    • /
    • pp.1941-1945
    • /
    • 2011
  • In this paper, we propose a real-time classifier to distinguish humans from livestock by using the spatial integral. The image-difference method and the Expectation Maximization are used to reduce noises in input image. A histogram analysis based on Simulated Annealing and the fuzzy-Bayesian algorithm are used to classify human and livestock. Finally, the experiment results show the validity of the proposed method.