Weighted residual minimization in PCA subspace for visual tracking
B. K. Shreyamsha Kumar, M.N.S. Swamy, M. Omair Ahmad · 2016
The success of sparse representation, in face recognition and visual tracking, has attracted much attention in computer vision in spite of its computational complexity. These sparse representation-based methods assume that the coding residual follows either Gaussian or Laplacian distribution, which may not be accurate enough to describe the coding residuals in real scenarios. In order to deal with such issues in visual tracking, a novel generative tracker is proposed in a Bayesian inference framework by exploiting both the robust sparse coding and the principle component analysis (PCA) algorithm. In contrast to the existing algorithms, the proposed method introduces weighted least squares into the PCA reconstruction avoiding the much complex l1-regularization. Further, it is proposed to generate an occlusion map based on weights, and is used to avoid updating the occlusion information during incremental subspace learning. The performance evaluation on the challenging image sequences demonstrates that the proposed method performs favorably when compared with the several state-of-the-art methods.