Abstract: “The object tracking algorithms based on men shift are good and efficient. But they have limitations like inaccuracy of target localization and sometimes complete tracking failure. These difficulties arises because of the fact that in basic kernel based mean shift tracking algorithm, the centroid is not always at the center of the target and the size of tracking window remains constant even if there is a major change in the size of object. It causes introduction of large number of background pixels in the object model which give localization errors or complete tracking failure. One more limitation of basic mean shift tracking algorithm is that it does not have an adaptive stop threshold in searching the target procedure. So even at times it gives proper target localization the computation time is much more. To deal with these challenges a new robust mean shift object tracking algorithm with improved tracking velocity and least localization errors is proposed in this paper. This approach”

Keywords: Mean Shift (MS), Kernel based object tracking, Bhattacharya coefficien