Tracking of multiple moving sources using recursive EM algorithm
EURASIP Journal on Applied Signal Processing
Online updating belief rule based system for pipeline leak detection under expert intervention
Expert Systems with Applications: An International Journal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A fast high-resolution method for bearing estimation in shallow ocean
Multidimensional Systems and Signal Processing
A sequential learning algorithm for online constructing belief-rule-based systems
Expert Systems with Applications: An International Journal
New model for system behavior prediction based on belief rule based systems
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
Condition-based maintenance of dynamic systems using online failure prognosis and belief rule base
Expert Systems with Applications: An International Journal
Cross-ambiguity function domain multipath channel parameter estimation
Digital Signal Processing
Hi-index | 0.01 |
This paper is concerned with recursive estimation using augmented data. We study two recursive procedures closely linked with the well-known expectation and maximization (EM) and space alternating generalized EM (SAGE) algorithms. Unlike iterative methods, the recursive EM and SAGE-inspired algorithms give a quick update on estimates given new data. Under mild conditions, estimates generated by these procedures are strongly consistent and asymptotically normally distributed. These mathematical properties are valid for a broad class of problems. When applied to direction of arrival (DOA) estimation, the recursive EM and SAGE-inspired algorithms lead to a very simple and fast implementation of the maximum-likelihood (ML) method. The most complicated computation in each recursion is inversion of the augmented information matrix. Through data augmentation, this matrix is diagonal and easy to invert. More importantly, there is no search in such recursive procedures. Consequently, the computational time is much less than that associated with existing numerical methods for finding ML estimates. This feature greatly increases the potential of the ML approach in real-time processing. Numerical experiments show that both algorithms provide good results with low computational cost.