Online selection of the best k-feature subset for object tracking

  • Authors:
  • Guorong Li;Qingming Huang;Junbiao Pang;Shuqiang Jiang;Lei Qin

  • Affiliations:
  • Graduate University of Chinese Academy of Sciences (CAS), Beijing 100190, China;Graduate University of Chinese Academy of Sciences (CAS), Beijing 100190, China and Key Lab of Intell. Info. Process., Inst. of Comput. Tech., CAS, Beijing 100080, China;Key Lab of Intell. Info. Process., Inst. of Comput. Tech., CAS, Beijing 100080, China;Key Lab of Intell. Info. Process., Inst. of Comput. Tech., CAS, Beijing 100080, China;Key Lab of Intell. Info. Process., Inst. of Comput. Tech., CAS, Beijing 100080, China

  • Venue:
  • Journal of Visual Communication and Image Representation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new feature subset evaluation method for feature selection in object tracking. According to the fact that a feature which is useless by itself could become a good one when it is used together with some other features, we propose to evaluate feature subsets as a whole for object tracking instead of scoring each feature individually and find out the most distinguishable subset for tracking. In the paper, we use a special tree to formalize the feature subset space. Then conditional entropy is used to evaluating feature subset and a simple but efficient greedy search algorithm is developed to search this tree to obtain the optimal k-feature subset quickly. Furthermore, our online k-feature subset selection method is integrated into particle filter for robust tracking. Extensive experiments demonstrate that k-feature subset selected by our method is more discriminative and thus can improve tracking performance considerably.