%0 Journal Article
%J IEEE Transactions on Pattern Analysis and Machine Intelligence
%D 2010
%T Online Empirical Evaluation of Tracking Algorithms
%A Wu,Hao
%A Sankaranarayanan,A. C
%A Chellapa, Rama
%K Back
%K Biomedical imaging
%K Computer vision
%K Filtering
%K formal model validation techniques
%K formal verification
%K ground truth
%K Kanade Lucas Tomasi feature tracker
%K Karhunen-Loeve transforms
%K lighting
%K Markov processes
%K mean shift tracker
%K model validation.
%K online empirical evaluation
%K particle filtering (numerical methods)
%K Particle filters
%K Particle tracking
%K performance evaluation
%K receiver operating characteristic curves
%K Robustness
%K SNR
%K Statistics
%K Surveillance
%K time reversed Markov chain
%K tracking
%K tracking algorithms
%K visual tracking
%X Evaluation of tracking algorithms in the absence of ground truth is a challenging problem. There exist a variety of approaches for this problem, ranging from formal model validation techniques to heuristics that look for mismatches between track properties and the observed data. However, few of these methods scale up to the task of visual tracking, where the models are usually nonlinear and complex and typically lie in a high-dimensional space. Further, scenarios that cause track failures and/or poor tracking performance are also quite diverse for the visual tracking problem. In this paper, we propose an online performance evaluation strategy for tracking systems based on particle filters using a time-reversed Markov chain. The key intuition of our proposed methodology relies on the time-reversible nature of physical motion exhibited by most objects, which in turn should be possessed by a good tracker. In the presence of tracking failures due to occlusion, low SNR, or modeling errors, this reversible nature of the tracker is violated. We use this property for detection of track failures. To evaluate the performance of the tracker at time instant t, we use the posterior of the tracking algorithm to initialize a time-reversed Markov chain. We compute the posterior density of track parameters at the starting time t = 0 by filtering back in time to the initial time instant. The distance between the posterior density of the time-reversed chain (at t = 0) and the prior density used to initialize the tracking algorithm forms the decision statistic for evaluation. It is observed that when the data are generated by the underlying models, the decision statistic takes a low value. We provide a thorough experimental analysis of the evaluation methodology. Specifically, we demonstrate the effectiveness of our approach for tackling common challenges such as occlusion, pose, and illumination changes and provide the Receiver Operating Characteristic (ROC) curves. Finally, we also s how the applicability of the core ideas of the paper to other tracking algorithms such as the Kanade-Lucas-Tomasi (KLT) feature tracker and the mean-shift tracker.
%B IEEE Transactions on Pattern Analysis and Machine Intelligence
%V 32
%P 1443 - 1458
%8 2010/08//
%@ 0162-8828
%G eng
%N 8
%R 10.1109/TPAMI.2009.135