Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Kernel-based tracking from a probabilistic viewpoint|
|Citation:||Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR'07), 17-22 June, 2007; pp.1-8|
|Conference Name:||Computer Vision and Pattern Recognition (2007 : Minneapolis, MN, USA)|
|Quang Anh Nguyen, Robles-Kelly, A. and Chunhua Shen|
|Abstract:||In this paper, we present a probabilistic formulation of kernel-based tracking methods based upon maximum likelihood estimation. To this end, we view the coordinates for the pixels in both, the target model and its candidate as random variables and make use of a generative model so as to cast the tracking task into a maximum likelihood framework. This, in turn, permits the use of the EM-algorithm to estimate a set of latent variables that can be used to update the target-center position. Once the latent variables have been estimated, we use the Kullback-Leibler divergence so as to minimise the mutual information between the target model and candidate distributions in order to develop a target-center update rule and a kernel bandwidth adjustment scheme. The method is very general in nature. We illustrate the utility of our approach for purposes of tracking on real-world video sequences using two alternative kernel functions.|
|Rights:||© Copyright 2011 IEEE – All Rights Reserved|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.