Journal of System Simulation ›› 2018, Vol. 30 ›› Issue (9): 3552-3557.doi: 10.16182/j.issn1004731x.joss.201809041

Previous Articles     Next Articles

An Anti-occlusion Adaptive Particle Filtering Algorithm

Li Ju1,2, Cao Mingwei3, Yu Ye3, XiaYu1, Zhou Lifan1   

  1. 1. School of Computer Science and Engineering, Changshu Institute of Technology, Changshu 215500, China;
    2. Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China;
    3.VCC Division, School of Computer and Information, Hefei University of Technology, Hefei 230009, China
  • Received:2016-03-06 Online:2018-09-10 Published:2019-01-08

Abstract: Considering the influence of local occlusion on particle filter tracking algorithm, an anti occlusion adaptive particle filtering algorithm is proposed. It adopts a rectangle as the tracking window, and uses the K mean clustering algorithm to complete particle clustering in resampling, and then obtains the particle subgroup. It estimates the final state according to particles subgroups, and modifies the tracking window. When the area changes more than 5%, the tracking window maintains the same as the one in last frame. Otherwise, the tracking window will change according to the size of moving object, which is a self-adaptation process. At the same time it solves the degeneration problem of particle filter. This algorithm strengthens the robustness of tracking algorithm in case of local occlusion and moving object scale changing. The method performs better than the traditional particle filter tracking algorithm.

Key words: anti-occlusion, KM clustering, particle filter, moving object tracking

CLC Number: