Visual tracking based on Log-Euclidean Riemannian sparse representation

  • Authors:
  • Yi Wu;Haibin Ling;Erik Blasch;Li Bai;Genshe Chen

  • Affiliations:
  • Center for Data Analytics and Biomedical Informatics, Computer and Information Science Department, Temple University, Philadelphia, PA;Center for Data Analytics and Biomedical Informatics, Computer and Information Science Department, Temple University, Philadelphia, PA;Air Force Research Lab, SNAA, OH;Electrical and Computer Engineering Department, Temple University, Philadelphia, PA;-

  • Venue:
  • ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, sparse representation has been utilized in many computer vision tasks and adapted for visual tracking. Sparsity-based visual tracking is formulated as searching candidates with minimal reconstruction errors from a template subspace with sparsity constraints in the approximation coefficients. However, an intensity template is easily corrupted by noise and not robust for target tracking under a dynamic environment. The recently proposed covariance region descriptor has been proven robust and versatile for a modest computational cost. Further, the covariance matrix enables efficient fusion of different types of features, where the spatial and statistical properties as well as their correlation are characterized, and its dimension is small. Although the covariance matrix lies on Riemannian manifolds, its log-transformation can be measured on a Euclidean subspace. Based on the covariance region descriptor and using the sparse representation, we propose a novel tracking approach on the Log-Euclidean Riemannian subspace. Specifically, the target region is characterized by a covariance matrix which is then log-transformed from the Riemannian manifold to the Euclidean subspace. After that, the target tracking problem is integrated under a sparse approximation framework, where the sparsity is achieved by solving an l1-regularization problem. Then the candidate with the smallest approximation is taken as the tracked target. For target propagation, we use the Bayesian state inference framework, which propagates sample distributions over time using the particle filter algorithm. To evaluate our method, we have collected several video sequences and the experimental results show that our tracker can achieve robustly and reliably target tracking.