Close category search window
 

Joint Detection, Tracking, and Classification of Multiple Targets in Clutter using the PHD Filter

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

4 Author(s)
Yang Wei ; Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha, China ; Fu Yaowen ; Long Jianqian ; Li Xiang

To account for joint detection, tracking, and classification (JDTC) of multiple targets from a sequence of noisy and cluttered observation sets, this paper introduces a recursive algorithm based on the probability hypothesis density (PHD) filter with the particle implementation. Assuming that each target class has a class-dependent kinematic model set, a class-matched PHD-like filter (i.e., PHD filter or its multiple-model implementation (MMPHD)) is assigned to it. In the prediction stage, the particles are propagated according to their class-dependent kinematic model set in the matched PHD-like filter. Then, the mutual information exchange between these PHD-like filters is completed by updating the particle weights in the update stage. The particles with the same class label and their corresponding weights represent the estimated class-conditioned PHD distribution. These class-conditioned PHD distributions are used to jointly estimate the number of the corresponding class targets and their states. Moreover, the algorithm incorporates the feature measurements into these PHD-like filters. The proposed multitarget JDTC algorithm has four distinctive features. First, it has a flexible modularized structure, i.e., it assigns a class-matched PHD-like filter for each target class, and facilitates the incorporation of the extra PHD-like filter for a new target class. Second, the particles can be propagated according to their exact class-dependent kinematic model set thanks to the modularized structure. Third, because of the feature measurements added and no explicit associations, it can track multiple closely spaced targets from different classes. Fourth, it avoids the possibility that the target classes with temporarily low likelihoods can end up being permanently lost. The computational burden of the proposed algorithm is linearly increased with the class number of targets. The algorithm is illustrated via a simulation example involving the tracking of two closely space- parallel moving targets and two crossing moving targets from different classes, where targets can appear and disappear.

Published in:
Aerospace and Electronic Systems, IEEE Transactions on  (Volume:48 ,  Issue: 4 )

Date of Publication: October 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.