Multiple Hypothesis Tracking (MHT) is generally the preferred data association technique for tracking targets in clutter and with missed detections due to its increased accuracy over conventional single-scan techniques such as Nearest Neighbor (NN) and Probabilistic Data Association (PDA). However, this improved accuracy comes at the price of greater complexity. Sequential K-best MHT is a simple implementation of MHT that attempts to achieve the accuracy of multiple hypothesis tracking with some of the simplicity of single-frame methods.
Our first major objective is to determine under
what general conditions Sequential K-best data association is preferable to Probabilistic Data Association. Both methods are implemented for a single-target, single-sensor scenario in two spatial dimensions. Using the track loss ratio as our primary performance metric, we compare the two methods under varying false alarm densities and missed-detection probabilities.
Upon implementing a single-target Sequential K-best MHT tracker, a fundamental problem was observed in which the tracks coalesce. The second major thrust of this research is to compare different approaches to resolve this issue. Several methods to detect track coalescence, mostly based on the Mahalanobis and Kullback-Leibler distances, are presented and compared.
| Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/11493 |
| Date | 22 May 2006 |
| Creators | Palkki, Ryan D. |
| Publisher | Georgia Institute of Technology |
| Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | 302411 bytes, application/pdf |
Page generated in 0.0017 seconds