TY - JOUR
T1 - Robust Visual Tracking Via Consistent Low-Rank Sparse Learning
AU - Zhang, Tianzhu
AU - Liu, Si
AU - Ahuja, Narendra
AU - Yang, Ming-Hsuan
AU - Ghanem, Bernard
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/6/19
Y1 - 2014/6/19
N2 - Object tracking is the process of determining the states of a target in consecutive video frames based on properties of motion and appearance consistency. In this paper, we propose a consistent low-rank sparse tracker (CLRST) that builds upon the particle filter framework for tracking. By exploiting temporal consistency, the proposed CLRST algorithm adaptively prunes and selects candidate particles. By using linear sparse combinations of dictionary templates, the proposed method learns the sparse representations of image regions corresponding to candidate particles jointly by exploiting the underlying low-rank constraints. In addition, the proposed CLRST algorithm is computationally attractive since temporal consistency property helps prune particles and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25 challenging image sequences. Experimental results show that the CLRST algorithm performs favorably against state-of-the-art tracking methods in terms of accuracy and execution time.
AB - Object tracking is the process of determining the states of a target in consecutive video frames based on properties of motion and appearance consistency. In this paper, we propose a consistent low-rank sparse tracker (CLRST) that builds upon the particle filter framework for tracking. By exploiting temporal consistency, the proposed CLRST algorithm adaptively prunes and selects candidate particles. By using linear sparse combinations of dictionary templates, the proposed method learns the sparse representations of image regions corresponding to candidate particles jointly by exploiting the underlying low-rank constraints. In addition, the proposed CLRST algorithm is computationally attractive since temporal consistency property helps prune particles and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25 challenging image sequences. Experimental results show that the CLRST algorithm performs favorably against state-of-the-art tracking methods in terms of accuracy and execution time.
UR - http://hdl.handle.net/10754/556145
UR - http://link.springer.com/10.1007/s11263-014-0738-0
UR - http://www.scopus.com/inward/record.url?scp=84922000600&partnerID=8YFLogxK
U2 - 10.1007/s11263-014-0738-0
DO - 10.1007/s11263-014-0738-0
M3 - Article
SN - 0920-5691
VL - 111
SP - 171
EP - 190
JO - International Journal of Computer Vision
JF - International Journal of Computer Vision
IS - 2
ER -