%0 Journal Article %1 IJACSA.2011.020801 %A E M Saad El. Bardawiny, H.I.ALI N.M.Shawky %D 2011 %J International Journal of Advanced Computer Science and Applications(IJACSA) %K ; ;Viterbi Carlo; Markov Monte algorithm association; chain data filter filtering multi-target particle tracking; %N 8 %T MCMC Particle Filter Using New Data Association Technique with Viterbi Filtered Gate Method for Multi-Target Tracking in Heavy Clutter %U http://ijacsa.thesai.org/ %V 2 %X Improving data association technique in dense clutter environment for multi-target tracking used in Markov chain Monte Carlo based particle filter (MCMC-PF) are discussed in this paper. A new method named Viterbi filtered gate Markov chain Monte Carlo VFG-MCMC is introduced to avoid track swap and to overcome the issue of loosing track to highly maneuvering targets in the presence of more background clutter and false signals. An adaptive search based on Viterbi algorithm is then used to detect the valid filtered data point in each target gate. The detected valid point for each target is applied to the estimation algorithm of MCMC-PF during calculating the sampling weights. This proposed method makes the MCMC interacts only with the valid target that is candidate from the filtered gate and no more calculations are considered for invalid targets. Simulation results demonstrate the effectiveness and better performance when compared to conventional algorithm MCMC-PF.

@article{IJACSA.2011.020801, abstract = { Improving data association technique in dense clutter environment for multi-target tracking used in Markov chain Monte Carlo based particle filter (MCMC-PF) are discussed in this paper. A new method named Viterbi filtered gate Markov chain Monte Carlo VFG-MCMC is introduced to avoid track swap and to overcome the issue of loosing track to highly maneuvering targets in the presence of more background clutter and false signals. An adaptive search based on Viterbi algorithm is then used to detect the valid filtered data point in each target gate. The detected valid point for each target is applied to the estimation algorithm of MCMC-PF during calculating the sampling weights. This proposed method makes the MCMC interacts only with the valid target that is candidate from the filtered gate and no more calculations are considered for invalid targets. Simulation results demonstrate the effectiveness and better performance when compared to conventional algorithm MCMC-PF.}, added-at = {2014-02-21T08:00:08.000+0100}, author = {{E M Saad El. Bardawiny}, H.I.ALI N.M.Shawky}, biburl = {https://www.bibsonomy.org/bibtex/26d6e1ac5bd8dc451258dbb4620f20c0f/thesaiorg}, interhash = {c211c84666d7e2013ea39665daa2f40e}, intrahash = {6d6e1ac5bd8dc451258dbb4620f20c0f}, journal = {International Journal of Advanced Computer Science and Applications(IJACSA)}, keywords = {; ;Viterbi Carlo; Markov Monte algorithm association; chain data filter filtering multi-target particle tracking;}, number = 8, timestamp = {2014-02-21T08:00:08.000+0100}, title = {{MCMC Particle Filter Using New Data Association Technique with Viterbi Filtered Gate Method for Multi-Target Tracking in Heavy Clutter}}, url = {http://ijacsa.thesai.org/}, volume = 2, year = 2011 }