CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.04 - April
Issue No.04 - April (2009 vol.31)
Karel Zimmermann , Czech Technical University, Prague
Jiří Matas , Czech Technical University, Prague
Thomáš Svoboda , Czech Technical University, Prague
We propose a learning approach to tracking explicitly minimizing the computational complexity of the tracking process subject to user-defined probability of failure (loss-of-lock) and precision. The tracker is formed by a Number of Sequences of Learned Linear Predictors (NoSLLiP). Robustness of NoSLLiP is achieved by modeling the object as a collection of local motion predictors - object motion is estimated by the outlier-tolerant Ransac algorithm from local predictions. Efficiency of the NoSLLiP tracker stems from (i) the simplicity of the local predictors and (ii) from the fact that all design decisions - the number of local predictors used by the tracker, their computational complexity (i.e. the number of observations the prediction is based on), locations as well as the number of Ransac iterations are all subject to the optimization (learning) process. All time-consuming operations are performed during the learning stage - tracking is reduced to only a few hundreds integer multiplications in each step. On PC with 1xK8 3200+, a predictor evaluation requires about 30 microseconds. The proposed approach is verified on publicly-available sequences with approximately 12000 frames with ground-truth. Experiments demonstrates, superiority in frame rates and robustness with respect to the SIFT detector, Lucas-Kanade tracker and other trackers.
Image Processing and Computer Vision, Tracking
Karel Zimmermann, Jiří Matas, Thomáš Svoboda, "Tracking by an Optimal Sequence of Linear Predictors", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 4, pp. 677-692, April 2009, doi:10.1109/TPAMI.2008.119