Mean Shift, Mode Seeking, and Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
The mean shift algorithm is an kernel based way for efficient object tracking. However, there is presently no clean mechanism for selecting kernel bandwidth when the object size is changing. We present an adaptive kernel bandwidth selection method for rigid object tracking. The kernel bandwidth is updated by using the object affine model that is estimated by using object corner correspondences between two consecutive frames. The centroid of object is registered by a special backward tracking method. M-estimate method is used to reject mismatched pairs (outliers) so as to get better regression results. We have applied the proposed method to track vehicles changing in size with encouraging results.