Tracking the maneuvering targets using multiple scan joint probabilistic data association algorithm
Tracking the maneuvering targets using multiple scan joint probabilistic data association algorithm
- Author(s): E. Vahdati-khajeh
- DOI: 10.1049/ic:20040049
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Target Tracking 2004: Algorithms and Applications — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): E. Vahdati-khajeh Source: Target Tracking 2004: Algorithms and Applications, 2004 p. 33 – 38
- Conference: Target Tracking 2004: Algorithms and Applications
- DOI: 10.1049/ic:20040049
- ISBN: 0 86341 397 8
- Location: Brighton, UK
- Conference date: 23-24 March 2004
- Format: PDF
The paper addresses the multi-target tracking problem for maneuvering targets in cluttered environments. The multiple scan joint probabilistic data association (MJPDA) algorithm is used for the sake of overcoming the problem of clutter points and targets which have joint observation. A comparison between different filtering methods through the sliding window of scans is presented. The problem of maneuvering targets is addressed and a new tracking algorithm which uses the multiple scan JPDA and interacting multiple model (IMM) together is formulated.
Inspec keywords: probability; filtering theory; target tracking; clutter; tracking filters; statistical analysis
Subjects: Filtering methods in signal processing; Other topics in statistics
Related content
content/conferences/10.1049/ic_20040049
pub_keyword,iet_inspecKeyword,pub_concept
6
6