Target tracking under occlusion by combining integral-intensity-matching with multi-block-voting

Authors:
Faliang Chang;Li Ma;Yizheng Qiao
Affiliations:
School of Control Science and Engineering, Shandong University, Shandong Province, P. R. China;School of Control Science and Engineering, Shandong University, Shandong Province, P. R. China;School of Control Science and Engineering, Shandong University, Shandong Province, P. R. China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Year:
2005

Citing 5
Cited 0

Robust Tracking of Position and Velocity With Kalman Snakes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Occlusion Robust Tracking Utilizing Spatio-Temporal Markov Random Field Model

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 1
Tracking People through Occlusions

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Tracking appearances with occlusions

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Occlusion-adaptive, content-based mesh design and forward tracking

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new method to solve the occlusion problem efficiently in rigid target tracking by combining integral-intensity-matching algorithm with multi-block-voting algorithm. If the target is occluded, means some blocks are occluded and tracked falsely. Then we don't let the occluded blocks participate in voting and integral-intensity-matching calculation, and use the remainder unoccluded blocks which can represent target' attribute to track the target unceasingly. Experimental results show that the adopted two algorithms are complementary, and effective combination can achieve reliable tracking performance under heavy occlusion.