Train integrity whilst in service establishes the foundation for railway safety. This study investigates train integrity detection which reliably deduces whether the train consists remain intact. A switching linear dy...
详细信息
Train integrity whilst in service establishes the foundation for railway safety. This study investigates train integrity detection which reliably deduces whether the train consists remain intact. A switching linear dynamic system (SLDS) based train integrity detection method is proposed for Global Navigation Satellite System (GNSS) based train integrity Monitoring System (TIMS) using the relative distance, velocity and acceleration of the locomotive and the last van. There, expectationmaximisation (EM) algorithm estimates the parameters of SLDS model while the Gaussian Sum Filter infers train integrity state. After that, to cope with false detection and misdetection, a verification procedure and train parting time estimation are designed. The approach is evaluated with both field trials and simulated data. Results show that the false alarm rate and misdetection rate of SLDS-based integrity detection approach are 0 and 0.09% respectively, which proves better than the estimated train length based detection model and Hidden Markov Model (HMM).
Motivated by tracking a manoeuvring target in electronic counter environments, the authors present the problem of joint estimation and identification of a class of discrete-time stochastic systems with unknown inputs ...
详细信息
Motivated by tracking a manoeuvring target in electronic counter environments, the authors present the problem of joint estimation and identification of a class of discrete-time stochastic systems with unknown inputs in both the plant and sensors. Based on the expectation-maximum criterion, the joint optimisation scheme of state estimation, parameter identification and iteration terminate decision were derived. A numerical example of tracking a manoeuvring target accompanied range gate pull-off is utilised to verify the proposed scheme.
Probabilistic Multiple Hypothesis Tracking (PMHT) is an algorithm for multi-target tracking in clutter with computational requirements, which are linear in the number of targets and the number of measurements. In orde...
详细信息
Probabilistic Multiple Hypothesis Tracking (PMHT) is an algorithm for multi-target tracking in clutter with computational requirements, which are linear in the number of targets and the number of measurements. In order to achieve this, the PMHT removes the point target constraint, and uses the expectationmaximisation procedure to optimise both data association probabilities and the target trajectory state estimates. However, PMHT is known to have high track-loss percentage in comparison with Probabilistic Data Association, at least in point target tracking. The authors propose a new PMHT-like algorithm to solve some problems of PMHT. In this study they revert the point target constraint. The authors call the new algorithm Point target PMHT. Simulation results show the efficiency of this method.
In this study, the problem of recovering structured sparse signals with a priori distribution whose structure patterns are unknown is studied from one-bit adaptive (AD) quantised measurements. A generalised approximat...
详细信息
In this study, the problem of recovering structured sparse signals with a priori distribution whose structure patterns are unknown is studied from one-bit adaptive (AD) quantised measurements. A generalised approximate message passing (GAMP) algorithm is utilised, and an expectationmaximisation (EM) method is embedded in the algorithm to iteratively estimate the unknown a priori distribution. In addition, the nearest neighbour sparsity pattern learning (NNSPL) method is adopted to further improve the recovery performance of the structured sparse signals. Numerical results demonstrate the effectiveness of GAMP-EM-AD-NNSPL method with both simulated and real data.
作者:
Liu, XinYang, XianqiangLiu, XiaofengHohai Univ
Coll IoT Engn Changzhou Peoples R China Harbin Inst Technol
Res Inst Intelligent Control & Syst Harbin Heilongjiang Peoples R China Harbin Inst Technol
State Key Lab Robot & Syst Harbin Heilongjiang Peoples R China Hohai Univ
Changzhou Key Lab Robot & Intelligent Technol Changzhou Peoples R China Hohai Univ
Jiangsu Key Lab Special Robots Changzhou Peoples R China
This paper investigates a robust identification solution for the nonlinear state-space model in which the outputs are polluted by unknown outliers. The problem of outliers is frequently encountered in practical indust...
详细信息
This paper investigates a robust identification solution for the nonlinear state-space model in which the outputs are polluted by unknown outliers. The problem of outliers is frequently encountered in practical industries that can greatly challenge the modelling of industrial processes. In order to overcome the obstacles brought by the outliers, the heavy-tailed Laplace distribution is applied to describe the output measurement process. Specifically, the Laplace distribution can be decomposed as a scale mixture of Gaussian distributions, which makes it robust for the outliers. The unknown model parameters are estimated with the expectation-maximisation algorithm while the particle smoother is used to solve the latent state estimation problem. The usefulness and robustness of the proposed algorithm are verified through the numerical examples including the model of a common chemical process.
A dimensionality-reduction-augmented non-linear state-space representation has been proposed to reduce the optimisation space for maximum-likelihood estimation. Based on the above representation, an expectation-maximi...
详细信息
A dimensionality-reduction-augmented non-linear state-space representation has been proposed to reduce the optimisation space for maximum-likelihood estimation. Based on the above representation, an expectation-maximisation algorithm has been derived to realise joint estimation of states and parameters. During the expectation step, the system state was estimated via the use of a fifth-order cubature Kalman filter and Rauch-Tung-Striebel smoother based on the state-augmented method. During the maximisation step, unknown parameters within iterations were estimated using the Newton method. Subsequently, two joint-estimation methods - one containing all measurements and the other involving a sliding window - were developed to estimate the invariants and step parameters, respectively. An example concerning manoeuvring-target tracking has been discussed to demonstrate the performance of proposed algorithms.
Gaussian mixture models (GMMs) are widely used in speech and speaker recognition. This study explores the idea that a mixture of skew Gaussians might capture better feature vectors that tend to have skew empirical dis...
详细信息
Gaussian mixture models (GMMs) are widely used in speech and speaker recognition. This study explores the idea that a mixture of skew Gaussians might capture better feature vectors that tend to have skew empirical distributions. It begins with deriving an expectationmaximisation (EM) algorithm to train a mixture of two-piece skew Gaussians that turns out to be not much more complicated than the usual EM algorithm used to train symmetric GMMs. Next, the algorithm is used to compare skew and symmetric GMMs in some simple speaker recognition experiments that use Mel frequency cepstral coefficients (MFCC) and line spectral frequencies (LSF) as the feature vectors. MFCC are one of the most popular feature vectors in speech and speaker recognition applications. LSF were chosen because they exhibit significantly more skewed distribution than MFCC and because they are widely used [together with the related immittance spectral frequencies (ISF)] in speech transmission standards. In the reported experiments, models with skew Gaussians performed better than models with symmetric Gaussians and skew GMMs with LSF compared favourably with both skew symmetric and symmetric GMMs that used MFCC.
Considering the intentionally introduced inter-symbol interference and coloured noise, proposed is a new signal-to-noise ratio (SNR) estimator based on the expectation-maximisation algorithm for the faster-than-Nyquis...
详细信息
Considering the intentionally introduced inter-symbol interference and coloured noise, proposed is a new signal-to-noise ratio (SNR) estimator based on the expectation-maximisation algorithm for the faster-than-Nyquist signalling system. The proposed SNR estimator can maximise the likelihood function by iteratively using the soft information from the channel decoder. Moreover, the new SNR estimator can be applied into high-order modulation. The performance of the proposed SNR estimator is verified and tested.
The application, of the expectation-maximization (EM) algorithm to estimate the signal autocorrelation in Wiener extrapolation allows us to view previous techniques as particular cases, to modify them, and to introduc...
详细信息
The application, of the expectation-maximization (EM) algorithm to estimate the signal autocorrelation in Wiener extrapolation allows us to view previous techniques as particular cases, to modify them, and to introduce new ones offering better performance with a moderate increase in computational load.
This paper reviews and compares three maximum likelihood algorithms for transmission tomography, One of these algorithms is the EM algorithm, one is based on a convexity argument devised by De Pierro in the context of...
详细信息
This paper reviews and compares three maximum likelihood algorithms for transmission tomography, One of these algorithms is the EM algorithm, one is based on a convexity argument devised by De Pierro in the context of emission tomography, and one is an ad hoc gradient algorithm, The algorithms enjoy desirable local and global convergence properties and combine gracefully with Bayesian smoothing priors, Preliminary numerical testing of the algorithms on simulated data suggest that the convex algorithm and the ad hoc gradient algorithm are computationally superior to the EM algorithm, This superiority stems from the larger number of exponentiations required by the EM algorithm, The convex and gradient algorithms are well adapted to parallel computing.
暂无评论