Minimum error bounded efficient $/ell _1$ tracker with occlusion detection

  • Authors:

  • Xue Mei; Haibin Ling; Yi Wu;E. Blasch; Li Bai

  • Affiliations:

  • Assembly Test Technol. Dev., Intel Corp., Chandler, AZ, USA;Comput. & Inf. Sci. Dept., Temple Univ., Philadelphia, PA, USA;Comput. & Inf. Sci. Dept., Temple Univ., Philadelphia, PA, USA;SNAA, Air Force Res. Lab., OH, USA;Assembly Test Technol. Dev., Intel Corp., Chandler, AZ, USA

  • Venue:
  • CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, sparse representation has been applied to visual tracking to find the target with the minimum reconstruction error from the target template subspace. Though effective, these L1 trackers require high computational costs due to numerous calculations for $/ell$_1 minimization. In addition, the inherent occlusion insensitivity of the $/ell$_1 minimization has not been fully utilized. In this paper, we propose an efficient L1 tracker with minimum error bound and occlusion detection which we call Bounded Particle Resampling (BPR)-L1 tracker. First, the minimum error bound is quickly calculated from a linear least squares equation, and serves as a guide for particle resampling in a particle filter framework. Without loss of precision during resampling, most insignificant samples are removed before solving the computationally expensive $/ell$_1 minimization function. The BPR technique enables us to speed up the L1 tracker without sacrificing accuracy. Second, we perform occlusion detection by investigating the trivial coefficients in the $/ell$_1 minimization. These coefficients, by design, contain rich information about image corruptions including occlusion. Detected occlusions enhance the template updates to effectively reduce the drifting problem. The proposed method shows good performance as compared with several state-of-the-art trackers on challenging benchmark sequences.