By Topic

Effective data association scheme for tracking closely moving targets using factor graphs

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)
Panakkal, V.P. ; Central Res. Lab., Bharat Electron. Ltd., Bangalore, India ; Velmurugan, R.

Effectiveness of tracking closely moving targets depends on the capability to resolve the ambiguity in associating measurements-to-tracks. Joint probabilistic data association (JPDA) has been shown to be very effective in tracking closely moving objects, but the approach is susceptible to track coalescence. The factor graph (FG) based association scheme developed in this paper circumvents the track coalescence by avoiding multiple hypothesis equivalence with recursive updation of likelihood values. The improvement in association using factor graph based data association scheme over JPDA has been demonstrated using a simulated scenario of closely moving targets. The steady state likelihood values obtained at the end of recursive process are shown to match the likelihoods obtained from measurements.

Published in:

Communications (NCC), 2011 National Conference on

Date of Conference:

28-30 Jan. 2011