Robust Visual Tracking Using Structurally Random Projection and Weighted Least Squares

被引:113
作者
Zhang, Shengping [1 ]
Zhou, Huiyu [2 ]
Jiang, Feng [3 ]
Li, Xuelong [4 ]
机构
[1] Harbin Inst Technol Weihai, Sch Comp Sci & Technol, Weihai 264209, Peoples R China
[2] Queens Univ Belfast, Inst Elect Commun & Informat Technol, Belfast BT3 9DT, Antrim, North Ireland
[3] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China
[4] Chinese Acad Sci, Xian Inst Opt & Precis Mech, Ctr Opt Imagery Anal & Learning, State Key Lab Transient Opt & Photon, Xian 710119, Peoples R China
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会; 高等学校博士学科点专项科研基金;
关键词
Sparse representation; structural random projection (RP); visual tracking; weighted least squares (WLS); OBJECT TRACKING; SPARSE REPRESENTATION; DISCRIMINANT-ANALYSIS; APPEARANCE MODEL;
D O I
10.1109/TCSVT.2015.2406194
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sparse representation-based visual tracking approaches have attracted increasing interests in the community in recent years. The main idea is to linearly represent each target candidate using a set of target and trivial templates, while imposing a sparsity constraint onto the representation coefficients. After we obtain the coefficients using l(1)-norm minimization methods, the candidate with the lowest error, when it is reconstructed using only the target templates and the associated coefficients, is considered as the tracking result. In spite of promising system performance widely reported, it is unclear if the performance of these trackers can be maximized. In addition, computational complexity caused by the dimensionality of the feature space limits these algorithms in real-time applications. In this paper, we propose a real-time visual tracking method based on structurally random projection (RP) and weighted least squares (WLS) techniques. In particular, to enhance the discriminative capability of the tracker, we introduce background templates to the linear representation framework. To handle appearance variations over time, we relax the sparsity constraint using a WLS method to obtain the representation coefficients. To further reduce the computational complexity, structurally RP is used to reduce the dimensionality of the feature space, while preserving the pairwise distances between the data points in the feature space. Experimental results show that the proposed approach outperforms several state-of-the-art tracking methods.
引用
收藏
页码:1749 / 1760
页数:12
相关论文
共 60 条
[1]   Database-friendly random projections: Johnson-Lindenstrauss with binary coins [J].
Achlioptas, D .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) :671-687
[2]  
Ailon N., 2006, STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, P557, DOI 10.1145/1132516.1132597
[3]  
[Anonymous], 2001, Sequential Monte Carlo Methods in PracticeM
[4]  
[Anonymous], 2006, 2006 IEEE COMP SOC C, DOI [DOI 10.1109/CVPR.2006.215, 10.1109/CVPR.2006.215]
[5]   Robust Object Tracking with Online Multiple Instance Learning [J].
Babenko, Boris ;
Yang, Ming-Hsuan ;
Belongie, Serge .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1619-1632
[6]   Robust visual tracking with structured sparse representation appearance model [J].
Bai, Tianxiang ;
Li, Y. F. .
PATTERN RECOGNITION, 2012, 45 (06) :2390-2404
[7]  
Bao CL, 2012, PROC CVPR IEEE, P1830, DOI 10.1109/CVPR.2012.6247881
[8]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[9]  
Biresaw TA, 2012, IEEE IMAGE PROC, P429, DOI 10.1109/ICIP.2012.6466888
[10]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215