By Topic

An expectation-maximisation tracker for multiple observations of a single target in clutter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. W. Pulford ; Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia ; A. Logothetis

We consider the estimation the state of a discrete-time, linear stochastic system whose observation process consists of a finite set of known, linear measurement models with additive white noise. Unlike conventional data fusion and tracking problems, the correspondence between the measurements and the models is assumed to be unknown. In addition, some of the measurements may be false alarms which convey no information about the state of the system. The expectation maximisation (EM) algorithm is applied as a MAP estimator of the sequence of measurement-to-model associations, with state sequence estimates obtained through fixed-interval Kalman smoothing conditioned on the association sequence. Each pass uses a Viterbi algorithm to provide updated data association estimates. The new technique is called expectation maximisation data association and represents an optimal fusion of dynamic programming and Kalman smoothing for data association

Published in:

Decision and Control, 1997., Proceedings of the 36th IEEE Conference on  (Volume:5 )

Date of Conference:

10-12 Dec 1997