In order to avoid the unreasonable kernel weight imposed on images by mean-shift tracking algorithm and the tracking bias
a maximum posterior probability measure based centroid iteration tracking algorithm is developed. The computation property of maximum posterior probability similarity measure is first analyzed
based on which it is indicated that the contribution of each pixel to the similarity value can be calculated by this measure. On the basis of it
a non-kernel and non-parametric centroid iteration image tracking algorithm is proposed
which takes the similarity contribution of each pixel as density and the similarity value of the candidate as mass
and obtains the target region by moving iteratively to the next centroid from the initial target region centroid. Theoretical analysis and experimental results show that the new algorithm is non-kernel and needs no extraction computation
which reduces the computational complexity. Meanwhile
utilizing the depressing capability of maximum posterior probability measure on the background
the tracking precision can be greatly improved.
关键词
Keywords
references
Cheng Yizong. Mean shift, mode seeking, and clustering [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1995, 17(8):790-799.
Comaniciu D, Meer P. Mean shift: a robust approach toward feature space analysis [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(5):603-619.
Comaniciu D, Ramesh V, Meer P. Kernel-based object tracking [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(5):564-577.
Comaniciu D, Ramesh V, Meer P. Real-time tracking of non-rigid objects using mean shift[C]∥Proceedings of International Conference on Computer Vision and Pattern Recognition. Piscataway, USA: IEEE, 2000:142-149.
Comaniciu D. An algorithm for data-driven bandwidth selection [J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(2):281-288.
Comaniciu D, Ramesh V, Meer P. The variable bandwidth mean shift and data-driven scale selection[C]∥International Conference on Computer Vision. Piscataway, USA: IEEE, 2001:438-445.
Collins R T. Mean-shift blob tracking through scale space[C]∥Proceedings of International Conference on Computer Vision and Pattern Recognition. Piscataway, USA: IEEE, 2003:234-240.
Comaniciu D, Ramesh V. Mean shift and optimal prediction for efficient object tracking[C]∥International Conference on Image Processing. Piscataway, USA: IEEE, 2000:70-73.
Peng Ningsong, Yang Jie. Mean-shift tracking with adaptive model update mechanism [J]. Journal of Data Acquisition Processing, 2005, 20(2):125-129.
Liu Tyng-Luh, Chen Hwann-Tzong. Real-time tracking using trust-region methods [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(3):397-402.
Liu Tyng-Luh, Chen Hwann-Tzong. Trust-region methods for real-time tracking [C]∥International Conference on Computer Vision. Piscataway, USA: IEEE, 2001:717-722.
Horn B K, Schunk B G. Determining optical flow [J]. Artificial Intelligence, 1981, 17(1/3):185-203.
Smith S M, Brady J M. ASSET-2: real-time motion segmentation and shape tracking [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1995, 17(8):814-820.
Isard M, Blake A. Contour tracking by stochastic propagation of conditional density[C]∥European Conference on Computer Vision. Cambridge, UK: Springer, 1996:343-356.
Feng Zuren, Lü Na, Li Liangfu. Research on image similarity criterion based on maximum posterior probability [J]. Acta Automatica Sinica, 2007, 33(1):1-8.