Integrated probabilistic data association (IPDA)
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3796-3798
- https://doi.org/10.1109/cdc.1992.370951
Abstract
A version of the probabilistic data association (PDA) algorithm that is called integrated probabilistic data association (IPDA) is presented. Rather than deriving algorithms based on an assumption of track existence, IPDA starts from expressions which treat track existence as an event with an associated probability. This approach leads to a set of recursive formulae for both data association and probability of track existence or track quality. This is useful in the track initiation phase (to confirm a tentative track) and in track termination (to terminate a false track). The IPDA algorithm is compared with both the probabilistic data association algorithm (PDA) and the interactive multiple model (IMM) PDA algorithm.Keywords
This publication has 4 references indexed in Scilit:
- Integrated probabilistic data associationIEEE Transactions on Automatic Control, 1994
- Multisensor tracking of a maneuvering target in clutterIEEE Transactions on Aerospace and Electronic Systems, 1989
- Tracking methods in a multitarget environmentIEEE Transactions on Automatic Control, 1978
- Tracking in a cluttered environment with probabilistic data associationAutomatica, 1975