The search functionality is under construction.

Keyword Search Result

[Keyword] expectation-maximization(7hit)

1-7hit
  • Parameters Estimation of Impulse Noise for Channel Coded Systems over Fading Channels

    Chun-Yin CHEN  Mao-Ching CHIU  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2021/01/18
      Vol:
    E104-B No:7
      Page(s):
    903-912

    In this paper, we propose a robust parameters estimation algorithm for channel coded systems based on the low-density parity-check (LDPC) code over fading channels with impulse noise. The estimated parameters are then used to generate bit log-likelihood ratios (LLRs) for a soft-inputLDPC decoder. The expectation-maximization (EM) algorithm is used to estimate the parameters, including the channel gain and the parameters of the Bernoulli-Gaussian (B-G) impulse noise model. The parameters can be estimated accurately and the average number of iterations of the proposed algorithm is acceptable. Simulation results show that over a wide range of impulse noise power, the proposed algorithm approaches the optimal performance under different Rician channel factors and even under Middleton class-A (M-CA) impulse noise models.

  • Adaptive Updating Probabilistic Model for Visual Tracking

    Kai FANG  Shuoyan LIU  Chunjie XU  Hao XUE  

     
    LETTER-Pattern Recognition

      Pubricized:
    2017/01/06
      Vol:
    E100-D No:4
      Page(s):
    914-917

    In this paper, an adaptive updating probabilistic model is proposed to track an object in real-world environment that includes motion blur, illumination changes, pose variations, and occlusions. This model adaptively updates tracker with the searching and updating process. The searching process focuses on how to learn appropriate tracker and updating process aims to correct it as a robust and efficient tracker in unconstrained real-world environments. Specifically, according to various changes in an object's appearance and recent probability matrix (TPM), tracker probability is achieved in Expectation-Maximization (EM) manner. When the tracking in each frame is completed, the estimated object's state is obtained and then fed into update current TPM and tracker probability via running EM in a similar manner. The highest tracker probability denotes the object location in every frame. The experimental result demonstrates that our method tracks targets accurately and robustly in the real-world tracking environments.

  • Automation of Model Parameter Estimation for Random Telegraph Noise

    Hirofumi SHIMIZU  Hiromitsu AWANO  Masayuki HIROMOTO  Takashi SATO  

     
    PAPER-Device and Circuit Modeling and Analysis

      Vol:
    E97-A No:12
      Page(s):
    2383-2392

    The modeling of random telegraph noise (RTN) of MOS transistors is becoming increasingly important. In this paper, a novel method is proposed for realizing automated estimation of two important RTN-model parameters: the number of interface-states and corresponding threshold voltage shift. The proposed method utilizes a Gaussian mixture model (GMM) to represent the voltage distributions, and estimates their parameters using the expectation-maximization (EM) algorithm. Using information criteria, the optimal estimation is automatically obtained while avoiding overfitting. In addition, we use a shared variance for all the Gaussian components in the GMM to deal with the noise in RTN signals. The proposed method improved estimation accuracy when the large measurement noise is observed.

  • Speaker Adaptation Based on PPCA of Acoustic Models in a Two-Way Array Representation

    Yongwon JEONG  

     
    LETTER-Speech and Hearing

      Vol:
    E97-D No:8
      Page(s):
    2200-2204

    We propose a speaker adaptation method based on the probabilistic principal component analysis (PPCA) of acoustic models. We define a training matrix which is represented in a two-way array and decompose the training models by PPCA to construct bases. In the two-way array representation, each training model is represented as a matrix and the columns of each training matrix are treated as training vectors. We formulate the adaptation equation in the maximum a posteriori (MAP) framework using the bases and the prior.

  • An EM Algorithm-Based Disintegrated Channel Estimator for OFDM AF Cooperative Relaying

    Jeng-Shin SHEU  Wern-Ho SHEEN  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E96-B No:1
      Page(s):
    254-262

    The cooperative orthogonal frequency-division multiplexing (OFDM) relaying system is widely regarded as a key design for future broadband mobile cellular systems. This paper focuses on channel estimation in such a system that uses amplify-and-forward (AF) as the relaying strategy. In the cooperative AF relaying, the destination requires the individual (disintegrated) channel state information (CSI) of the source-relay (S-R) and relay-destination (R-D) links for optimum combination of the signals received from source and relay. Traditionally, the disintegrated CSIs are obtained with two channel estimators: one at the relay and the other at the destination. That is, the CSI of the S-R link is estimated at relay and passed to destination, and the CSI of the R-D link is estimated at destination with the help of pilot symbols transmitted by relay. In this paper, a new disintegrated channel estimator is proposed; based on an expectation-maximization (EM) algorithm, the disintegrated CSIs can be estimated solely by the estimator at destination. Therefore, the new method requires neither signaling overhead for passing the CSI of the S-R link to destination nor pilot symbols for the estimation of the R-D link. Computer simulations show that the proposed estimator works well under the signal-to-noise ratios of interest.

  • Direct Importance Estimation with a Mixture of Probabilistic Principal Component Analyzers

    Makoto YAMADA  Masashi SUGIYAMA  Gordon WICHERN  Jaak SIMM  

     
    LETTER-Fundamentals of Information Systems

      Vol:
    E93-D No:10
      Page(s):
    2846-2849

    Estimating the ratio of two probability density functions (a.k.a. the importance) has recently gathered a great deal of attention since importance estimators can be used for solving various machine learning and data mining problems. In this paper, we propose a new importance estimation method using a mixture of probabilistic principal component analyzers. The proposed method is more flexible than existing approaches, and is expected to work well when the target importance function is correlated and rank-deficient. Through experiments, we illustrate the validity of the proposed approach.

  • Multiphase Learning for an Interval-Based Hybrid Dynamical System

    Hiroaki KAWASHIMA  Takashi MATSUYAMA  

     
    PAPER

      Vol:
    E88-A No:11
      Page(s):
    3022-3035

    This paper addresses the parameter estimation problem of an interval-based hybrid dynamical system (interval system). The interval system has a two-layer architecture that comprises a finite state automaton and multiple linear dynamical systems. The automaton controls the activation timing of the dynamical systems based on a stochastic transition model between intervals. Thus, the interval system can generate and analyze complex multivariate sequences that consist of temporal regimes of dynamic primitives. Although the interval system is a powerful model to represent human behaviors such as gestures and facial expressions, the learning process has a paradoxical nature: temporal segmentation of primitives and identification of constituent dynamical systems need to be solved simultaneously. To overcome this problem, we propose a multiphase parameter estimation method that consists of a bottom-up clustering phase of linear dynamical systems and a refinement phase of all the system parameters. Experimental results show the method can organize hidden dynamical systems behind the training data and refine the system parameters successfully.