By Topic

Markov chain Monte Carlo method for evaluating multi-frame data association hypotheses

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
$31 $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)
Mori, S. ; BAE Syst., Adv. Inf. Technol., Los Altos, CA ; Chee-Yee Chong

This paper describes algorithms for probabilistically evaluating multi-frame data-association hypotheses formed in multiple-hypothesis, multiple-target tracking, using Markov chain Monte Carlo (MCMC) methods (also known as sequential Monte Carlo (SMC) methods). Each algorithm is designed to sequentially, randomly generate multi-frame data association hypotheses, and to converge to a stationary process with the a posteriori probabilities of the multi-frame hypotheses, as the stationary (target) probability distribution. The paper explores three sampling designs: the metropolis sampling, the metropolis sampling with Boltzman acceptance probability, and the metropolis-hasting sampling. Their performances are compared with each other and with the hypothesis evaluation obtained by a K-best hypothesis selection algorithm, using two simple examples.

Published in:

Information Fusion, 2008 11th International Conference on

Date of Conference:

June 30 2008-July 3 2008