The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Bookmark and Share
Sparsity-Constrained and Dynamic Group Structured Sparse Coding for Robust VisuaI Tracking
Pages: 1499-1505
Year: Issue:  8
Journal: Acta Electronica Sinica

Keyword:  L1 trackersparse codingsparsity-constrainedspatial continuity structure;
Abstract: L1 tracker is one of the most effective methods in dealing with the occlusions for sparseness of coding coefficients of objects. However, the existing sparse coding algorithms do not use special sparse structure of coding coefficients in L1 tracker. In this paper, we propose a two-stage sparse coding algorithm for visual tracking based on constrained sparsity of target template coefficients and spatial continuity structure of trivial template coefficients with block coordinate optimization theory. At the first stage, the algorithm solves sparsity-constrained coding coefficients on target template set using orthogonal matching pursuit. At the second stage,the algorithm finds sparse coding coefficients with spatial continuity on trivial template set via dynamic group sparse coding. Robust visual tracking is achieved using the proposed sparse coding algorithm in particle filter framework. The experimental results demonstrate that the proposed tracking method has better robustness and higher precision than the state-of-the-art trackers.
Related Articles
No related articles found