Accelerating Robust-Object-Tracking via Level-3 BLAS-Based Sparse Learning
Zhaoshui He, Hao Liang, Senquan Yang, Wenqing Su, Peitao Wang, Zhijie Lin, Beihai Tan, Shengli Xie
Abstract
The sparse collaborative tracking (SCT) method has been developed for object tracking recently, and it is very efficient and robust to various occlusions. In SCT, sparse representation (SR) plays an essential role because it needs to perform several manipulations of sparse matrix representation (SMR) or nonnegative SMR in each iteration. So one of the most challenging problems in SCT is how to efficiently solve the SMR. However, existing SR algorithms are solely developed for the vectors-based SR. They partition SMR into a set of vector-based SR problems and solve them in the level-2 BLAS (Basic Linear Algebra Subprograms) manner, i.e., matrix-vector operations, which is computationally much less efficient than the direct level-3 BLAS (direct matrix-matrix operations). To solve this problem, by extending the standard SR algorithm from the vector version to the matrix for SMR and nonnegative SMR, BLAS3-based Sparse Learning (BLAS3-SpaL) is first developed, and then the corresponding BLAS3-SpaL-based SCT method (FastSCT-BLAS3SpaL) is further developed for fast robust-object-tracking in this paper. The experiments verified that it achieves robust object tracking by reducing accumulation errors and speeds up tracking with more than double speed.