FBEM: A filter bank EM algorithm for the joint optimization of features and acoustic model parameters in bird call classification

2012 ◽  
Author(s):  
Wei Chu ◽  
Abeer Alwan
Keyword(s):  
Em Algorithm ◽  
Filter Bank ◽  
Joint Optimization ◽  
Model Parameters ◽  
Acoustic Model ◽  
Call Classification ◽  
Bird Call

EM Algorithm Based on Fuzzification and its Application

2012 ◽  
Vol 532-533 ◽  
pp. 1445-1449
Author(s):  
Ting Ting Tong ◽  
Zhen Hua Wu
Keyword(s):  
Em Algorithm ◽  
Mixed Model ◽  
Image Data ◽  
Training Sample ◽  
Model Parameters ◽  
Parameter Learning ◽  
Weighted Degree ◽  
The Em Algorithm ◽  
The Impact

EM algorithm is a common method to solve mixed model parameters in statistical classification of remote sensing image. The EM algorithm based on fuzzification is presented in this paper to use a fuzzy set to represent each training sample. Via the weighted degree of membership, different samples will be of different effect during iteration to decrease the impact of noise on parameter learning and to increase the convergence rate of algorithm. The function and accuracy of classification of image data can be completed preferably.

scholarly journals Unsupervised Learning in RSS-Based DFLT Using an EM Algorithm

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5549
Author(s):  
Ossi Kaltiokallio ◽  
Roland Hostettler ◽  
Hüseyin Yiğitler ◽  
Mikko Valkama
Keyword(s):  
Em Algorithm ◽  
Expectation Maximization ◽  
Tracking System ◽  
Model Parameters ◽  
Calibration Data ◽  
Tracking Accuracy ◽  
Time Period ◽  
The Em Algorithm ◽  
Device Free ◽  
Localization And Tracking

Received signal strength (RSS) changes of static wireless nodes can be used for device-free localization and tracking (DFLT). Most RSS-based DFLT systems require access to calibration data, either RSS measurements from a time period when the area was not occupied by people, or measurements while a person stands in known locations. Such calibration periods can be very expensive in terms of time and effort, making system deployment and maintenance challenging. This paper develops an Expectation-Maximization (EM) algorithm based on Gaussian smoothing for estimating the unknown RSS model parameters, liberating the system from supervised training and calibration periods. To fully use the EM algorithm’s potential, a novel localization-and-tracking system is presented to estimate a target’s arbitrary trajectory. To demonstrate the effectiveness of the proposed approach, it is shown that: (i) the system requires no calibration period; (ii) the EM algorithm improves the accuracy of existing DFLT methods; (iii) it is computationally very efficient; and (iv) the system outperforms a state-of-the-art adaptive DFLT system in terms of tracking accuracy.

scholarly journals The Orthogonally Partitioned EM Algorithm: Extending the EM Algorithm for Algorithmic Stability and Bias Correction Due to Imperfect Data

2016 ◽  
Vol 12 (1) ◽  
pp. 65-77
Author(s):  
Michael D. Regier ◽  
Erica E. M. Moodie
Keyword(s):  
Missing Data ◽  
Measurement Error ◽  
Em Algorithm ◽  
Optimal Solution ◽  
Bias Reduction ◽  
Model Parameters ◽  
Finite Sample ◽  
Imperfect Data ◽  
The Em Algorithm ◽  
Finite Sample Properties

Abstract We propose an extension of the EM algorithm that exploits the common assumption of unique parameterization, corrects for biases due to missing data and measurement error, converges for the specified model when standard implementation of the EM algorithm has a low probability of convergence, and reduces a potentially complex algorithm into a sequence of smaller, simpler, self-contained EM algorithms. We use the theory surrounding the EM algorithm to derive the theoretical results of our proposal, showing that an optimal solution over the parameter space is obtained. A simulation study is used to explore the finite sample properties of the proposed extension when there is missing data and measurement error. We observe that partitioning the EM algorithm into simpler steps may provide better bias reduction in the estimation of model parameters. The ability to breakdown a complicated problem in to a series of simpler, more accessible problems will permit a broader implementation of the EM algorithm, permit the use of software packages that now implement and/or automate the EM algorithm, and make the EM algorithm more accessible to a wider and more general audience.

scholarly journals Hybrid DE-EM Algorithm for Gaussian Mixture Model-Based Wireless Channel Multipath Clustering

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Yupeng Li ◽  
Jianhua Zhang ◽  
Ruisi He ◽  
Lei Tian ◽  
Hewen Wei
Keyword(s):  
Em Algorithm ◽  
Gaussian Mixture Model ◽  
Mixture Model ◽  
Clustering Algorithm ◽  
Gaussian Mixture ◽  
Wireless Channel ◽  
Model Parameters ◽  
Em Algorithms ◽  
The Em Algorithm ◽  
Searching Ability

In this paper, the Gaussian mixture model (GMM) is introduced to the channel multipath clustering. In the GMM field, the expectation-maximization (EM) algorithm is usually utilized to estimate the model parameters. However, the EM widely converges into local optimization. To address this issue, a hybrid differential evolution (DE) and EM (DE-EM) algorithms are proposed in this paper. To be specific, the DE is employed to initialize the GMM parameters. Then, the parameters are estimated with the EM algorithm. Thanks to the global searching ability of DE, the proposed hybrid DE-EM algorithm is more likely to obtain the global optimization. Simulations demonstrate that our proposed DE-EM clustering algorithm can significantly improve the clustering performance.

Identification of nonlinear state-space time-delay system

2019 ◽  
Vol 40 (1) ◽  
pp. 22-30
Author(s):  
Xin Liu ◽  
Hang Zhang ◽  
Pengbo Zhu ◽  
Xianqiang Yang ◽  
Zhiwei Du
Keyword(s):  
Time Delay ◽  
Em Algorithm ◽  
State Space ◽  
Latent Variable ◽  
Industrial Process ◽  
Delay System ◽  
Model Parameters ◽  
Content Type ◽  
Output Time ◽  
Nonlinear State

Purpose This paper aims to investigate an identification strategy for the nonlinear state-space model (SSM) in the presence of an unknown output time-delay. The equations to estimate the unknown model parameters and output time-delay are derived simultaneously in the proposed strategy. Design/methodology/approach The unknown integer-valued time-delay is processed as a latent variable which is uniformly distributed in a priori known range. The estimations of the unknown time-delay and model parameters are both realized using the Expectation-Maximization (EM) algorithm, which has a good performance in dealing with latent variable issues. Moreover, the particle filter (PF) with an unknown time-delay is introduced to calculated the Q-function of the EM algorithm. Findings Although amounts of effective approaches for nonlinear SSM identification have been developed in the literature, the problem of time-delay is not considered in most of them. The time-delay is commonly existed in industrial scenario and it could cause extra difficulties for industrial process modeling. The problem of unknown output time-delay is considered in this paper, and the validity of the proposed approach is demonstrated through the numerical example and a two-link manipulator system. Originality/value The novel approach to identify the nonlinear SSM in the presence of an unknown output time-delay with EM algorithm is put forward in this work.

Online Learning with Hidden Markov Models

2008 ◽  
Vol 20 (7) ◽  
pp. 1706-1716 ◽  
Author(s):  
Gianluigi Mongillo ◽  
Sophie Deneve
Keyword(s):  
Em Algorithm ◽  
Hidden Markov Models ◽  
Online Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Parameters Estimation ◽  
Discount Factor ◽  
Model Parameters ◽  
Sufficient Statistics ◽  
Backward Procedure

We present an online version of the expectation-maximization (EM) algorithm for hidden Markov models (HMMs). The sufficient statistics required for parameters estimation is computed recursively with time, that is, in an online way instead of using the batch forward-backward procedure. This computational scheme is generalized to the case where the model parameters can change with time by introducing a discount factor into the recurrence relations. The resulting algorithm is equivalent to the batch EM algorithm, for appropriate discount factor and scheduling of parameters update. On the other hand, the online algorithm is able to deal with dynamic environments, i.e., when the statistics of the observed data is changing with time. The implications of the online algorithm for probabilistic modeling in neuroscience are briefly discussed.

scholarly journals Independent Vector Analysis for Source Separation Using a Mixture of Gaussians Prior

2010 ◽  
Vol 22 (6) ◽  
pp. 1646-1673 ◽  
Author(s):  
Jiucang Hao ◽  
Intae Lee ◽  
Te-Won Lee ◽  
Terrence J. Sejnowski
Keyword(s):  
Em Algorithm ◽  
Music Performance ◽  
Gaussian Mixture Models ◽  
Gaussian Mixture ◽  
Vector Analysis ◽  
Model Parameters ◽  
Sensor Noise ◽  
Independent Vector ◽  
Convolutive Mixtures ◽  
Independent Vector Analysis

Convolutive mixtures of signals, which are common in acoustic environments, can be difficult to separate into their component sources. Here we present a uniform probabilistic framework to separate convolutive mixtures of acoustic signals using independent vector analysis (IVA), which is based on a joint distribution for the frequency components originating from the same source and is capable of preventing permutation disorder. Different gaussian mixture models (GMM) served as source priors, in contrast to the original IVA model, where all sources were modeled by identical multivariate Laplacian distributions. This flexible source prior enabled the IVA model to separate different type of signals. Three classes of models were derived and tested: noiseless IVA, online IVA, and noisy IVA. In the IVA model without sensor noise, the unmixing matrices were efficiently estimated by the expectation maximization (EM) algorithm. An online EM algorithm was derived for the online IVA algorithm to track the movement of the sources and separate them under nonstationary conditions. The noisy IVA model included the sensor noise and combined denoising with separation. An EM algorithm was developed that found the model parameters and separated the sources simultaneously. These algorithms were applied to separate mixtures of speech and music. Performance as measured by the signal-to-interference ratio (SIR) was substantial for all three models.

Sign in / Sign up

Export Citation Format

Share Document