Inverse Sparse Group Lasso Model for Robust Object Tracking

Yun Zhou

doi:10.1109/TMM.2017.2689918

Inverse Sparse Group Lasso Model for Robust Object Tracking

2017-08-01

32

PRE

AI

DOI：10.1109/TMM.2017.2689918

Original

Original request for help

Save

Abstract

En 中文

Sparse representation has been applied to visual tracking. The visual tracking models based on sparse representation use a template set as dictionary atoms to reconstruct candidate samples without considering similarity among atoms. In this paper, we present a robust tracking method based on the inverse sparse group lasso model. Our method exploits both the group structure of similar candidate samples and the local structure between templates and samples. Unlike the conventional sparse representation, the templates are encoded by the candidate samples, and similar samples are selected to reconstruct the template at the group level, which facilitates inter-group sparsity. Every sample group achieves the intra-group sparsity so that the information between the related dictionary atoms is taken into account. Moreover, the local structure between templates and samples is considered to build the reconstruction model, which ensures that the computed coefficients similarity is consistent with the similarity between templates and samples. A gradient descent-based optimization method is employed and a sparse mapping table is obtained using the coefficient matrix and hash-distance weight matrix. Experiments were conducted with publicly available datasets and a comparison study was performed against 20 state-of-the-art methods. Both qualitative and quantitative results are reported. The proposed method demonstrated improved robustness and accuracy and exhibited comparable computational complexity.

Keywords:

Computer vision

hash distance

sparse coding

sparse group lasso

visual tracking

Inverse Sparse Group Lasso Model for Robust Object Tracking

Abstract

AI Summary

Journal

Organization