Algorithm of target tracking based on Mean-Shift with adaptive bandwidth of kernel function
核函数带宽自适应的Mean-Shift跟踪算法

To achieve adaptive bandwidth of kernel function in Mean-Shift tracking algorithm, a new method based on comparing Bhattacharyya coefficients was proposed, in which, the Bhattacharyya coefficient was firstly computed out by using of center weighted and edge weighted histograms of template image, and then, a new Bhattacharyya coefficient during tracking was computed out according to the edge weighted histogram of candidate image and center weighted histogram of template image, finally 10% of the bandwidth of kernel function was expanded or shrunk by comparing two coefficients. The experiment results show that the method can avoid the problem of nonstop shrinking bandwidth effectively, and adapt tracking window to the change of the target size successfully.