Sparse coding based visual tracking: Review and experimental comparison

  • Authors:
  • Shengping Zhang;Hongxun Yao;Xin Sun;Xiusheng Lu

  • Affiliations:
  • School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

Recently, sparse coding has been successfully applied in visual tracking. The goal of this paper is to review the state-of-the-art tracking methods based on sparse coding. We first analyze the benefits of using sparse coding in visual tracking and then categorize these methods into appearance modeling based on sparse coding (AMSC) and target searching based on sparse representation (TSSR) as well as their combination. For each categorization, we introduce the basic framework and subsequent improvements with emphasis on their advantages and disadvantages. Finally, we conduct extensive experiments to compare the representative methods on a total of 20 test sequences. The experimental results indicate that: (1) AMSC methods significantly outperform TSSR methods. (2) For AMSC methods, both discriminative dictionary and spatial order reserved pooling operators are important for achieving high tracking accuracy. (3) For TSSR methods, the widely used identity pixel basis will degrade the performance when the target or candidate images are not aligned well or severe occlusion occurs. (4) For TSSR methods, @?"1 norm minimization is not necessary. In contrast, @?"2 norm minimization can obtain comparable performance but with lower computational cost. The open questions and future research topics are also discussed.