Kinematic calibration under the expectation maximization framework for exoskeletal inertial motion capture system

This study presents a kinematic calibration method for exoskeletal inertial motion capture (EI-MoCap) system with considering the random colored noise such as gyroscopic drift.In this method, the geometric parameters are calibrated by the traditional calibration method at first. Then, in order to calibrate the parameters affected by the random colored noise, the expectation maximization (EM) algorithm is introduced. Through the use of geometric parameters calibrated by the traditional calibration method, the iterations under the EM framework are decreased and the efficiency of the proposed method on embedded system is improved. The performance of the proposed kinematic calibration method is compared to the traditional calibration method. Furthermore, the feasibility of the proposed method is verified on the EI-MoCap system. The simulation and experiment demonstrate that the motion capture precision is significantly improved by 16.79%and 7.16%respectively in comparison to the traditional calibration method.

The study of a neutron spectrum unfolding method based on particle swarm optimization combined with maximum likelihood expectation maximization

The neutron spectrum unfolding by Bonner sphere spectrometer(BSS) is considered a complex multidimensional model,which requires complex mathematical methods to solve the first kind of Fredholm integral equation. In order to solve the problem of the maximum likelihood expectation maximization(MLEM) algorithm which is easy to suffer the pitfalls of local optima and the particle swarm optimization(PSO) algorithm which is easy to get unreasonable flight direction and step length of particles, which leads to the invalid iteration and affect efficiency and accuracy, an improved PSO-MLEM algorithm, combined of PSO and MLEM algorithm, is proposed for neutron spectrum unfolding. The dynamic acceleration factor is used to balance the ability of global and local search, and improves the convergence speed and accuracy of the algorithm. Firstly, the Monte Carlo method was used to simulated the BSS to obtain the response function and count rates of BSS. In the simulation of count rate, four reference spectra from the IAEA Technical Report Series No. 403 were used as input parameters of the Monte Carlo method. The PSO-MLEM algorithm was used to unfold the neutron spectrum of the simulated data and was verified by the difference of the unfolded spectrum to the reference spectrum. Finally, the 252Cf neutron source was measured by BSS, and the PSO-MLEM algorithm was used to unfold the experimental neutron spectrum.Compared with maximum entropy deconvolution(MAXED), PSO and MLEM algorithm, the PSO-MLEM algorithm has fewer parameters and automatically adjusts the dynamic acceleration factor to solve the problem of local optima. The convergence speed of the PSO-MLEM algorithm is 1.4 times and 3.1 times that of the MLEM and PSO algorithms. Compared with PSO, MLEM and MAXED, the correlation coefficients of PSO-MLEM algorithm are increased by 33.1%, 33.5% and 1.9%, and the relative mean errors are decreased by 98.2%, 97.8% and 67.4%.

Integration of Expectation Maximization using Gaussian Mixture Models and Naïve Bayes for Intrusion Detection

Intrusion detection is the investigation process of information about the system activities or its data to detect any malicious behavior or unauthorized activity.Most of the IDS implement K-means clustering technique due to its linear complexity and fast computing ability.Nonetheless,it is Naïve use of the mean data value for the cluster core that presents a major drawback.The chances of two circular clusters having different radius and centering at the same mean will occur.This condition cannot be addressed by the K-means algorithm because the mean value of the various clusters is very similar together.However,if the clusters are not spherical,it fails.To overcome this issue,a new integrated hybrid model by integrating expectation maximizing(EM)clustering using a Gaussian mixture model(GMM)and naïve Bays classifier have been proposed.In this model,GMM give more flexibility than K-Means in terms of cluster covariance.Also,they use probabilities function and soft clustering,that’s why they can have multiple cluster for a single data.In GMM,we can define the cluster form in GMM by two parameters:the mean and the standard deviation.This means that by using these two parameters,the cluster can take any kind of elliptical shape.EM-GMM will be used to cluster data based on data activity into the corresponding category.

Incremental expectation maximization principal component analysis for missing value imputation for coevolving EEG data

Missing values occur in bio-signal processing for various reasons,including technical problems or biological char-acteristics.These missing values are then either simply excluded or substituted with estimated values for further processing.When the missing signal values are estimated for electroencephalography (EEG) signals,an example where electrical signals arrive quickly and successively,rapid processing of high-speed data is required for immediate decision making.In this study,we propose an incremental expectation maximization principal component analysis (iEMPCA) method that automatically estimates missing values from multivariable EEG time series data without requiring a whole and complete data set.The proposed method solves the problem of a biased model,which inevitably results from simply removing incomplete data rather than estimating them,and thus reduces the loss of information by incorporating missing values in real time.By using an incremental approach,the proposed method alsominimizes memory usage and processing time of continuously arriving data.Experimental results show that the proposed method assigns more accurate missing values than previous methods.

Studies on unfolding energy spectra of neutrons using maximumlikelihood expectation–maximization method

Energy spectra of neutrons are important for identification of unknown neutron sources and for determination of the equivalent dose. Although standard energy spectra of neutrons are available in some situations, e.g., for some radiotherapy treatment machines, they are unknown in other cases, e.g., for photoneutrons created in radiotherapy rooms and neutrons generated in nuclear reactors. In situations where neutron energy spectra need to be determined, unfolding the required neutron energy spectra using the Bonner sphere spectrometer (BSS) and nested neutron spectrometer (NNS) has been found promising. However, without any prior knowledge on the spectra, the unfolding process has remained a tedious task. In this work, a standalone numerical tool named ‘‘NRUunfold’’ was developed which could satisfactorily unfold neutron spectra for BSS or NNS, or any other systems using similar detection methodology. A generic and versatile algorithm based on maximum-likelihood expectation– maximization method was developed and benchmarked against the widely used STAY’SL algorithm which was based on the least squares method. The present method could output decent results in the absence of precisely calculated initial guess, although it was also remarked that employment of exceptionally bizarre initial spectra could lead to some unreasonable output spectra. The neutron count rates computed using the manufacturer’s response functions were used for sensitivity studies. The present NRUunfold code could be useful for neutron energy spectrum unfolding for BSS or NNS applications in the absence of a precisely calculated initial guess.

Novel method for extraction of ship target with overlaps in SAR image via EM algorithm

The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition can be influenced.For addressing this issue,a method for extracting ship targets with overlaps via the expectation maximization(EM)algorithm is pro-posed.First,the scatterers of ship targets are obtained via the target detection technique.Then,the EM algorithm is applied to extract the scatterers of a single ship target with a single IPP.Afterwards,a novel image amplitude estimation approach is pro-posed,with which the radar image of a single target with a sin-gle IPP can be generated.The proposed method can accom-plish IPP selection and targets separation in the image domain,which can improve the image quality and reserve the target information most possibly.Results of simulated and real mea-sured data demonstrate the effectiveness of the proposed method.

EFFECTIVE IMAGE SEGMENTATION FRAMEWORK FOR GAUSSIAN MIXTURE MODEL INCORPORATING LOCAL INFORMATION

A new two-step framework is proposed for image segmentation. In the first step, the gray-value distribution of the given image is reshaped to have larger inter-class variance and less intra-class variance. In the sec- ond step, the discriminant-based methods or clustering-based methods are performed on the reformed distribution. It is focused on the typical clustering methods-Gaussian mixture model （GMM） and its variant to demonstrate the feasibility of the framework. Due to the independence of the first step in its second step, it can be integrated into the pixel-based and the histogram-based methods to improve their segmentation quality. The experiments on artificial and real images show that the framework can achieve effective and robust segmentation results.

EM-based detection scheme for differential unitary space-time modulation

The performance loss of an approximately 3 dB signal-to-noise ratio is always paid with conventional differential detection compared to the related coherent detection. A new detection scheme consisting of two steps is proposed for the differential unitary space-time modulation （DUSTM） system. In the first step, the data sequence is estimated by conventional unitary space-time demodulation （DUSTD） and differentially encoded again to produce an initial estimate of the transmitted symbol stream. In the second step, the initial estimate of the symbol stream is utilized to initialize an expectation maximization （EM）-based iterative detector. In each iteration, the most recent detected symbol stream is employed to estimate the channel, which is then used to implement coherent sequence detection to refine the symbol stream. Simulation results show that the proposed detection scheme performs much better than the conventional DUSTD after several iterations.

基于非对称拉普拉斯分布的混合分位数回归参数估计

利用非对称拉普拉斯分布提出一种新的混合分位数回归模型.传统模型仅考虑位置参数,而所提出模型同时考虑了位置参数和尺度参数,并利用期望最大化(expectation maximization,EM)算法对模型参数进行估计.数值分析结果表明,参数估计的精度在各个分位数上均较为理想,并且估计精度随着样本量的增加而提高.最后运用所提出模型及其算法对城市房价数据进行分析.

Real-time reliability evaluation based on damaged measurement degradation data

A method was proposed to evaluate the real-time reliability for a single product based on damaged measurement degradation data.Most researches on degradation analysis often assumed that the measurement process did not have any impact on the product's performance.However,in some cases,the measurement process may exert extra stress on products being measured.To obtain trustful results in such a situation,a new degradation model was derived.Then,by fusing the prior information of product and its own on-line degradation data,the real-time reliability was evaluated on the basis of Bayesian formula.To make the proposed method more practical,a procedure based on expectation maximization (EM) algorithm was presented to estimate the unknown parameters.Finally,the performance of the proposed method was illustrated by a simulation study.The results show that ignoring the influence of the damaged measurement process can lead to biased evaluation results,if the damaged measurement process is involved.

Research on Time Synchronization Method Under Arbitrary Network Delay in Wireless Sensor Networks

To cope with the arbitrariness of the network delays,a novel method,referred to as the composite particle filter approach based on variational Bayesian(VB-CPF),is proposed herein to estimate the clock skew and clock offset in wireless sensor networks.VB-CPF is an improvement of the Gaussian mixture kalman particle filter(GMKPF)algorithm.In GMKPF,Expectation-Maximization(EM)algorithm needs to determine the number of mixture components in advance,and it is easy to generate overfitting and underfitting.Variational Bayesian EM(VB-EM)algorithm is introduced in this paper to determine the number of mixture components adaptively according to the observations.Moreover,to solve the problem of data packet loss caused by unreliable links,we propose a robust time synchronization(RTS)method in this paper.RTS establishes an autoregressive model for clock skew,and calculates the clock parameters based on the established autoregressive model in case of packet loss.The final simulation results illustrate that VB-CPF yields much more accurate results relative to GMKPF when the network delays are modeled in terms of an asymmetric Gaussian distribution.Moreover,RTS shows good robustness to the continuous and random dropout of time messages.

A multi-target tracking algorithm based on Gaussian mixture model

Since the joint probabilistic data association(JPDA)algorithm results in calculation explosion with the increasing number of targets,a multi-target tracking algorithm based on Gaussian mixture model(GMM)clustering is proposed.The algorithm is used to cluster the measurements,and the association matrix between measurements and tracks is constructed by the posterior probability.Compared with the traditional data association algorithm,this algorithm has better tracking performance and less computational complexity.Simulation results demonstrate the effectiveness of the proposed algorithm.

Software sensor for slab reheating furnace

It has long been thought that a reheating furnace, with its inherent measurement difficulties and complex dynamics, posed almost insurmountable problems to engineers in steel plants. A novel software sensor is proposed to make more effective use of those measurements that are already available, which has great importance both to slab quality and energy saving. The proposed method is based on the mixtures of Gaussian processes (GP) with the expectation maximization (EM) algorithm employed for parameter esti- mation of the mixture of models. The mixture model can alleviate the computational complexity of GP and also accords with the changes of operating condition in practical processes. It is demonstrated by on-line estimation of the furnace gas temperature in 1580 reheating furnace in Baosteel Corporation (Group).

Improved H-infinity channel estimator based on EM for MIMO-OFDM systems

H-infinity estimator is generally implemented in timevariant state-space models, but it leads to high complexity when the model is used for multiple input multiple output with orthogo- hal frequency division multiplexing （MIMO-OFDM） systems. Thus, an H-infinity estimator over time-invariant system models is pro- posed, which modifies the Krein space accordingly. In order to avoid the large matrix inversion and multiplication required in each OFDM symbol from different transmit antennas, expectation maximization （EM） is developed to reduce the high computational load. Joint estimation over multiple OFDM symbols is used to resist the high pilot overhead generated by the increasing number of transmit antennas. Finally, the performance of the proposed estimator is enhanced via an angle-domain process. Through performance analysis and simulation experiments, it is indicated that the pro- posed algorithm has a better mean square error （MSE） and bit error rate （BER） performance than the optimal least square （LS） estimator. Joint estimation over multiple OFDM symbols can not only reduce the pilot overhead but also promote the channel performance. What is more, an obvious improvement can be obtained by using the angle-domain filter.

Speech Enhancement Based on Approximate Message Passing

To overcome the limitations of conventional speech enhancement methods, such as inaccurate voice activity detector(VAD) and noise estimation, a novel speech enhancement algorithm based on the approximate message passing(AMP) is adopted. AMP exploits the difference between speech and noise sparsity to remove or mute the noise from the corrupted speech. The AMP algorithm is adopted to reconstruct the clean speech efficiently for speech enhancement. More specifically, the prior probability distribution of speech sparsity coefficient is characterized by Gaussian-model, and the hyper-parameters of the prior model are excellently learned by expectation maximization(EM) algorithm. We utilize the k-nearest neighbor(k-NN) algorithm to learn the sparsity with the fact that the speech coefficients between adjacent frames are correlated. In addition, computational simulations are used to validate the proposed algorithm, which achieves better speech enhancement performance than other four baseline methods-Wiener filtering, subspace pursuit(SP), distributed sparsity adaptive matching pursuit(DSAMP), and expectation-maximization Gaussian-model approximate message passing(EM-GAMP) under different compression ratios and a wide range of signal to noise ratios(SNRs).

Improved dark channel image dehazing method based on Gaussian mixture model

To solve the problem of color distortion after dehazing in the sky region by using the classical dark channel prior method to process the hazy images with large regions of sky,an improved dark channel image dehazing method based on Gaussian mixture model is proposed.Firstly,we use the Gaussian mixture model to model the hazy image,and then use the expectation maximization(EM)algorithm to optimize the parameters,so that the hazy image can be divided into the sky region and the non-sky region.Secondly,the sky region is divided into a light haze region,a medium haze region and a heavy haze region according to the different dark channel values to estimate the transmission respectively.Thirdly,the restored image is obtained by combining the atmospheric scattering model.Finally,adaptive local tone mapping for high dynamic range images is used to adjust the brightness of the restored image.The experimental results show that the proposed method can effectively eliminate the color distortion in the sky region,and the restored image is clearer and has better visual effect.

Semantic image annotation based on GMM and random walk model

Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.

Nonlinear System Identification with Unknown Piecewise Time-Varying Delay

Identification of nonlinear systems with unknown piecewise time-varying delay is concerned in this paper.Multiple auto regressive exogenous(ARX) models are identified at different process operating points,and the complete dynamics of the nonlinear system is represented by using a combination of a normalized exponential function as the probability density function with each of the local models.The parameters of the local ARX models and the exponential functions as well as the unknown piecewise time-varying delays are estimated simultaneously under the framework of the expectation maximization(EM) algorithm.A simulation example is applied to demonstrating the proposed identification method.

Noise estimation and filtering method of MEMS gyroscope based on EMMAP

Aiming at the problems of low measurement accuracy,uncertainty and nonlinearity of random noise of the micro electro mechanical system(MEMS)gyroscope,a gyroscope noise estimation and filtering method is proposed,which combines expectation maximum(EM)with maximum a posterior(MAP)to form an adpative unscented Kalman filter(UKF),called EMMAP-UKF.According to the MAP estimation principle,a suboptimal unbiased MAP noise statistical estimation model is constructed.Then,EM algorithm is introduced to transform the noise estimation problem into the mathematical expectation maximization problem,which can dynamically adjust the variance of the observed noise.Finally,the estimation and filtering of gyroscope random drift error can be realized.The performance of the gyro noise filtering method is evaluated by Allan variance,and the effectiveness of the method is verified by hardware-in-the-loop simulation.

Fusing PLSA model and Markov random fields for automatic image annotation

A novel image auto-annotation method is presented based on probabilistic latent semantic analysis(PLSA) model and multiple Markov random fields(MRF).A PLSA model with asymmetric modalities is first constructed to estimate the joint probability between images and semantic concepts,then a subgraph is extracted served as the corresponding structure of Markov random fields and inference over it is performed by the iterative conditional modes so as to capture the final annotation for the image.The novelty of our method mainly lies in two aspects:exploiting PLSA to estimate the joint probability between images and semantic concepts as well as multiple MRF to further explore the semantic context among keywords for accurate image annotation.To demonstrate the effectiveness of this approach,an experiment on the Corel5 k dataset is conducted and its results are compared favorably with the current state-of-the-art approaches.