J4 ›› 2017, Vol. 34 ›› Issue (2): 154-161.

• Basic Optics • Previous Articles     Next Articles

The Study of Target Tracking Algorithm Based on Mean Shift with Adaptive Bandwidth of Anisotropic Kernel Function

  

  • Received:2016-08-29 Revised:2016-10-31 Published:2017-03-28 Online:2017-04-06

Abstract: The traditional mean shift algorithm using fixed kernels or symmetric kernel function, which have problems of target tracking lost or failure when target tracking. In order to improve the accuracy and real-time of target tracking, A target tracking algorithm is proposed based on mean shift with adaptive bandwidth of anisotropic kernel function. Firstly, this algorithm introduced the signed distance constraint function to produce the anisotropic kernel function based on signed distance kernel function. This anisotropic kernel function to meet the function value is zero in external target, and provided accurate tracking window for target moving. Secondly, The mean shift based on anisotropic kernel function is applied to target tracking to meet the sum of weight is zero of the sample points to the center point vectors in the tracking window, and calculated the mean shift window center of anisotropic kernel function template. Thirdly, anisotropic kernel function templates adaptive update implementation by similarity threshold to limit the change of the template between two sequential pictures, so as to realize real-time precise tracking. Finally, the contrast experimental results show that our algorithm has good accuracy and high real time.

Key words: adaptive bandwidth

CLC Number: