A New Fragments-Based Tracking Algorithm Based on Meanshift and Kalman

Article Preview

Abstract:

Occlusion detection is a difficult traffic in the occlusion occurs, the existing system has been blocked based on the regional and multi-block area is not proportional relationship between the division. meanshift algorithm is more popular, the algorithm is robust root tracking algorithm. However, over-reliance on the law target color information, so when multiple moving objects, the color looks similar to when this method often leads to failure of the root trace, In this paper, the object tracking using block and used to predict the kalman filter to speed up the convergence rate of block meanshift. We introduce a new outlook weights, less affected by background sub-block effect on the target track and improve robustness.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

4348-4353

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Hieu T Nguyen, Marcel Worring, Rein Van Den Boomgaard. Occlusion Robust Adaptive Template Tracking[A]. Proc8th IEEE Int Conf on Computer Vision[C]. Vancouver, 2001: 678-683.

DOI: 10.1109/iccv.2001.937587

Google Scholar

[2] Franco Oberti, Simona Calcagno, Michela Zara. Robust Tracking of Humans and Vehicles in cluttered Scenes with Occlusions [A]. IEEE Int Conf on Image Processing[C]. New York, 2002: 629-632.

DOI: 10.1109/icip.2002.1039049

Google Scholar

[3] Shunsuke Kamijo, Yasuyuki Matsushita, Katsushi Ikeuchi. Occlusion Robust Tracking utilizing Spatio-Temporal Markov Random field Model[A]. Proc15th Int Conf on Pattern Recognition[C]. Barcelona, 2000: 140-144.

DOI: 10.1109/icpr.2000.905292

Google Scholar

[4] Shunsuke Kamijo, Yasuyuki Matsushita, Katsushi Ikeuchi. Occlusion Robust Tracking utilizing Spatio-Temporal Markov Random field Model[A]. Proc15th Int Conf on Pattern Recognition[C]. Barcelona, 2000: 140-144.

DOI: 10.1109/icpr.2000.905292

Google Scholar

[5] Zhao J W, Wang P, Liu C Q. An Object Tracking Algorithm Based on Occlusion Mesh Model[A]. Int Conf on Machine Learning and Cybernetics[ C ]. Beijing, 2002: 288-292.

DOI: 10.1109/icmlc.2002.1176759

Google Scholar

[6] Javed Ahmed M.N. Jafri. Mubarak Shah. Muhammad Akbar. Real-time edge-enhanced dynamic correlation and predictive open-loop car-following control for robust tracking. Machine Vision and Application(2008)19: 1-25.

DOI: 10.1007/s00138-007-0072-4

Google Scholar

[7] Changjiang Yang, Ramani Duraiswami and Larry Davis. Efficient Meanshift Tracking via a new similarity measure. Conference on Computer Vision and Pattern Recognition(CVPR'05).

DOI: 10.1109/cvpr.2005.139

Google Scholar

[8] V. Parameswaran, V. Ramesh, and I. Zoghlami. Tunable.

Google Scholar

[9] Kernels for Tracking. Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition-Volume 2, pages 2179–2186, (2006).

Google Scholar

[10] D. Xu, Y. Wang, and J. An. Applying a New Spatial Color Histogram in Mean-Shift Based Tracking Algorithm. Image and Vision Computing New Zealand, (2005).

Google Scholar

[11] Fanglin Wang, Shengyang Yu, Jie Yang. A Novel Fragments-based Tracking Algorithm using Mean shift. conf. on Control, Automation , Robotics and Vision 2008 10th.

DOI: 10.1109/icarcv.2008.4795602

Google Scholar