• Title/Summary/Keyword: Maximization Step

Search Result 45, Processing Time 0.023 seconds

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.

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.

The Expectation and Sparse Maximization Algorithm

  • Barembruch, Steffen;Scaglione, Anna;Moulines, Eric
    • Journal of Communications and Networks
    • /
    • v.12 no.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.

New Inference for a Multiclass Gaussian Process Classification Model using a Variational Bayesian EM Algorithm and Laplace Approximation

  • Cho, Wanhyun;Kim, Sangkyoon;Park, Soonyoung
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.202-208
    • /
    • 2015
  • In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

Cost Maximization Approach to Edge Detection Using a Genetic Algorithm (유전자 알고리즘을 이용한 비용 최대화에 의한 에지추출)

  • 김수겸;박중순
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.21 no.3
    • /
    • pp.293-301
    • /
    • 1997
  • Edge detection is the first step and very important step in image analysis. We cast edge detec¬tion as a problem in cost maximization. This is acheived by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for compar¬ing the performances of different detectors. We used a Genetic Algorithm for maximizing cost func¬tion. Genetic algorithms are a class of adaptive search techniques that have been intensively stud¬ied in recent years and have been prone to converge prematurely before the best solution has been found. This paper shows that carefully chosen modifications(three factors of the crossover opera¬tor) are implemented can be effective in alleviating this problem.

  • PDF

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.

Hybrid Pulse Width Modulation Strategy for Wide Speed Range in IPMSM with Low Cost Drives

  • Ahn, Han-woong;Go, Sung-chul;Lee, Ju
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.3
    • /
    • pp.670-674
    • /
    • 2016
  • The control performance of hybrid PWM inverter using a phase current measurement is presented in this paper. The hybrid PWM technique consists of space vector pulse width modulation (SVPWM) and six-step voltage control operation. The SVPWM is performed to reduce the harmonic components in the low speed region, and the six-step modulation is applied to increase the maximum speed of the IPMSM in the high speed region. Therefore, it is possible to obtain a great performance in both the low speed range and high speed range. However, the six-step modulation cannot be completely implemented, since the inverter that includes the lag-shunt sensing method has an immeasurable current region. In this paper, a quasi-six-step modulation using a modified voltage vector is proposed. The validity and usefulness of the proposed PWM technique is verified by MATLAB/Simulink and experimental results.

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.

Distributed Target Localization with Inaccurate Collaborative Sensors in Multipath Environments

  • Feng, Yuan;Yan, Qinsiwei;Tseng, Po-Hsuan;Hao, Ganlin;Wu, Nan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2299-2318
    • /
    • 2019
  • Location-aware networks are of great importance for both civil lives and military applications. Methods based on line-of-sight (LOS) measurements suffer sever performance loss in harsh environments such as indoor scenarios, where sensors can receive both LOS and non-line-of-sight (NLOS) measurements. In this paper, we propose a data association (DA) process based on the expectation maximization (EM) algorithm, which enables us to exploit multipath components (MPCs). By setting the mapping relationship between the measurements and scatters as a latent variable, coefficients of the Gaussian mixture model are estimated. Moreover, considering the misalignment of sensor position, we propose a space-alternating generalized expectation maximization (SAGE)-based algorithms to jointly update the target localization and sensor position information. A two dimensional (2-D) circularly symmetric Gaussian distribution is employed to approximate the probability density function of the sensor's position uncertainty via the minimization of the Kullback-Leibler divergence (KLD), which enables us to calculate the expectation step with low computational complexity. Moreover, a distributed implementation is derived based on the average consensus method to improve the scalability of the proposed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms can perform close to the Monte Carlo-based method with much lower communication overhead and computational complexity.

A New Method of Profit Maximization Based on the Theory of Constraints (제약이론 기반의 기업이익 최적화 방법론)

  • Moon, Je-Chang;Rim, Suk-Chul
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.356-364
    • /
    • 2001
  • Production Improvement Method in TOC consists of five steps, but it is very difficult for most firms to implement it because it lacks the detailed methods at each step. This paper suggests some of detailed methods to implement the TOC. In the first step, computer simulation is used to identify the constraints in production lines. Subsequently, ASP, AUT, and CM calculation are defined for the second step, which are helpful to exploit the company's constraints. We also suggest the OEE method to effectively exploit the constraints of production lines in the factory. Finally the TOC/OEE procedure is suggested to optimize the investment in the fourth step. As an illustrative example, we introduce a case of a wafer manufacturer to adopt the suggested methods. The benefits of implementating the suggested methods are addressed in the framework of the balanced scorecard.

  • PDF