A Coarse-to-Fine Searching Method with Kernel Matching Based on Bhattacharyya Coefficients
Liang Li, Feng Zu · 2008
Mean shift is an efficient pattern match algorithm.Aiming at object tracking in large motion area,a mean shift algorithm is proposed based on coarse-to-fine searching with kernel matching.It can efficiently use a similarity measure function to realize the rough location of motion object.Then,the mean shift method is used to obtain the accurate local optimal value by iterative computing,and thus object tracking in large motion area is successfully realized.Experimental results show it has good performance in accuracy and speed compared with traditional algorithm.