For the environment of target tracking with highly non-linear models and non-Gaussian noise, the tracking performance of the particle filter is better than extended Kalman filter; in addition, the design of particle filter is simpler, so it is quite suitable for the realistic environment. However, particle filter depends on the probability model of the noise. If the knowledge of the noise is incorrect, the tracking performance of the particle filter will degrade severely. To tackle the problem, cost function-based particle filters have been studied. Though suffering from minor degradation on the performance, the cost function-based particle filters do not need probability assumptions of the noises. The application of cost function-based particle filters will be more robust in any realistic environment. Cost function-based particle filters will enable maneuvering multiple target tracking to be suitable for any environment because it does not depend on the noise model. The difficulty lies in the link between the estimator and data association. The likelihood function are generally obtained from the algorithm of the data association; while cost functions are used in the cost function-based particle filter for moving the particles and update the corresponding weights without probability assumptions on the noises. The thesis is focused on the combination of data association and cost function-based particle filter, in order to make the algorithm of multiple target tracking more robust in noisy environments.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0823107-134024 |
Date | 23 August 2007 |
Creators | Wang, Sung-chieh |
Contributors | Chen-Wen Yen, Chin-Der Wann, Miin-Jong Hao |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | Cholon |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823107-134024 |
Rights | campus_withheld, Copyright information available at source archive |
Page generated in 0.0017 seconds