Abstract
The size of target will induce a degradation of tracking performance, which has been neglected for simplicity in most previous studies. In multiple target tracking, occlusions will be caused by target size effect, one target can become a moving obstacle blocking the direct channel between the anchor and another target. In this paper, the data association problem in multiple target tracking is investigated. To reduce the computational complexity of traditional Joint Probabilistic Data Association (JPDA) algorithm, a modified JPDA algorithm is proposed to execute data association in multiple target tracking by utilizing the information of occlusion conditions, which is identified by a three-step algorithm. Simulation results show that the proposed algorithm is with good tracking performance and low computational complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have