This paper proposes a general Kernel-Bayesian framework for object tracking. In this framework, the kernel based method—mean shift algorithm is embedded into the Bayesian framework seamlessly to provide a heuristic prior information to the state transition model, aiming at effectively alleviating the heavy computational load and avoiding sample degeneracy suffered by the conventional Bayesian trackers. Moreover, the tracked object is characterized by a spatial-constraint MOG (Mixture of Gaussians) based appearance model, which is shown more discriminative than the traditional MOG based appearance model. Meantime, a novel selective updating technique for the appearance model is developed to accommodate the changes in both appearance and illumination. Experimental results demonstrate that, compared with Bayesian and kernel based tracking frameworks, the proposed algorithm is more efficient and effective.
Kernel-Bayesian Framework for Object Tracking
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
11 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Tracking Algorithm , Object Tracking , Appearance Model , Multiple Object Tracking , Shift Algorithm Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence , Biometrics , Algorithm Analysis and Problem Complexity
Kernel-based Bayesian filtering for object tracking
IEEE | 2005
|Approximate Bayesian methods for kernel-based object tracking
British Library Online Contents | 2009
|Incremental Density Approximation and Kernel-Based Bayesian Filtering for Object Tracking
British Library Conference Proceedings | 2004
|Multiple object tracking with kernel particle filter
IEEE | 2005
|