Evaluation of subpixel tracking algorithms

Authors:
Johan Skoglund;Michael Felsberg
Affiliations:
Computer Vision Laboratory, Department of Electrical Engineering, Linköping University, Linköping, Sweden;Computer Vision Laboratory, Department of Electrical Engineering, Linköping University, Linköping, Sweden
Venue:
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Year:
2006

Citing 2
Cited 1

On the unification of line processes, outlier rejection, and robust statistics with applications in early vision

International Journal of Computer Vision
An iterative image registration technique with an application to stereo vision

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2

Covariance estimation for SAD block matching

SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evaluation of tracking algorithms can be done in several different ways, either using real or synthetic images. The main benefit with the second alternative is that the environment is completely controlled, there is no problem to get the ground truth and the noise is well known. This paper contains the results from an evaluation of subpixel tracking algorithms. The main focus of the evaluation is to compare the performance of subpixel methods with different computation complexity, in order to see whether the tracking performance justifies more complex algorithms.