Dynamic Compressive Tracking

Abstract

Real-Time Compressive Tracking utilizes a very spare measurement matrix to extract the features for the appearance model. Such model performs well when the tracked objects are well defined. However, when the objects are low-grain, low-resolution, or small, a fixed size sparse measurement matrix is not sufficient enough to preserve the image structure of the object. In this work, we propose a Dynamic Compressive Tracking algorithm that employs adaptive random projections that preserve the image structure of the objects during tracking. The proposed tracker uses a dynamic importance ranking weight to evaluate the classification results obtained by each of the sparse measurement matrices and complete the tracking with the optimal sparse matrix. Extensive experimental results, on challenging publicly available data sets, shows that the proposed dynamic compressible tracking algorithm outperforms conventional compressive tracker.