Learning occlusion with likelihoods for visual tracking

• Published in: 2011 International Conference on Computer Vision pp. 1551 - 1558
• Main Authors: Suha Kwak, Woonhyun Nam, Bohyung Han, Joon Hee Han
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2011
• Subjects: Cognition; Minimization; Target tracking; Training; Vectors; Videos
• ISBN: 9781457711015; 145771101X
• ISSN: 1550-5499; 2380-7504
• DOI: 10.1109/ICCV.2011.6126414

We propose a novel algorithm to detect occlusion for visual tracking through learning with observation likelihoods. In our technique, target is divided into regular grid cells and the state of occlusion is determined for each cell using a classifier. Each cell in the target is associated with many small patches, and the patch likelihoods observed during tracking construct a feature vector, which is used for classification. Since the occlusion is learned with patch likelihoods instead of patches themselves, the classifier is universally applicable to any videos or objects for occlusion reasoning. Our occlusion detection algorithm has decent performance in accuracy, which is sufficient to improve tracking performance significantly. The proposed algorithm can be combined with many generic tracking methods, and we adopt L 1 minimization tracker to test the performance of our framework. The advantage of our algorithm is supported by quantitative and qualitative evaluation, and successful tracking and occlusion reasoning results are illustrated in many challenging video sequences.