Xiaowei An, Youngjoon Han, Hernsoo Hahn
(Dept. of Electronic Engineering, Soongsil University, Seoul 156-743, Korea)
Abstract：In order to reduce redundant empty bin capacity in the probability representation, we present a new color feature arrangement mechanism for mean shift tracking objects. In the proposed mechanism, the important optimal color, or we call it optimal color vector, is clustered by closing Euclidean distance which happens inside the original RGB color 3-D spatial domain. After obtaining clustering colors from the reference image RGB spatial domain, novel clustering groups substitute for original color data. So the new color substitution distribution is as similar as the original one. And then target region in the candidate frame is mapped by the constructed optimal clustering colors and the cluster Indices. In the final, mean shift algorithm gives a performance in the new optimal color distribution. Comparison under the same circumstance between the proposed algorithm and conventional mean shift algorithm shows that the former has a certain advantage in computation cost.
Key words：color feature arrangement； optimal color vector； cluster; redundant bin
CLD number： TP391.413 Document code： A
Article ID： 1674-8042(2013)01-0038-05 doi： 10.3969/j.issn.1674-8042.2013.01.009
References
[1] Kam W W. Machine vision, robot vision, computer close-range photogrammetry, 1992.
[2] Yilmaz A, Javed O, Shah M. Object tracking: a survey. ACM Computing Surveys, 2006, 38(4): 13-57.
[3] Odobez J M, Gatica-Perez D, Ba S O. Embedding motion in model-based stochastic tracking. IEEE Transactions on Imaging Processing, 2006, 15(11): 3514-3530.
[4] Dorin C, Meer P. Mean shift: a robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(5): 603-619.
[5] Collins R T. Mean-shift blob tracking through scale space. In: proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2003: 234-241.
[6] Yang C, Duraiswami R, Davis L. Efficient mean-shift tracking via a new similarity measure. In: proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2005: 176-183.
[7] ZHAO Qi, TAO Hai. Object tracking using color correlogram. In: Proceedings of 2nd Jonit IEEE International Workshop on Visual Surveillance Performance Evaluation of Tracking and Surveillance, 2005: 263-270.
[8] Isard M, Blake A. Contour tracking by stochastic propagation of conditional density, In: proceedings of European Conference on Computer Vision, Cambridge, U.K, 1996: 343-356.
[9] Isard M, Blake A. Condensation—conditional density propagation for visual tracking. International Journal of Computer Vision, 1998.
[10] YAO An-bang, LIN Xing-gang, WANG Gui-jin. A compact association of particle filtering and kernel based object tracking. Pattern Recognition, 2012, 45(7): 2584-2597.
[11] CHEN Qiang, SUN Quan-sen Sun, Heng P A, et al. Two-stage object tracking method based on kernel and active contour. IEEE Transactions on Circuits and Systems for Video Technology, 2010, 20(4): 605-609.
[12] FANG Jiang-xiong, YANG Jie, LIU Hua-xiang. Efficient and robust fragments-based multiple kernels tracking. International Journal of Electronics and Communications, 2011, 65(11): 915-923.
[13] ZHANG Xu-guang, LIU Hong-hai, LI Xiao-li. Target tracking for mobile robot platforms via object matching and background anti-matching. Robotics and Autonomous Systems, 2010, 58(11): 1197-1206.
[full text view]
