Kernel-Based Bayesian Filtering for Object Tracking
Abstract
Particle filtering provides a general framework for propagating probability density functions in nonlinear and non-Gaussian systems. However, the algorithm is based on a Monte Carlo approach and sampling is a problematic issue, especially for high dimensional problems. This paper presents a new kernel-based Bayesian filtering framework, which adopts an analytic approach to better approximate and propagate density functions. In this framework, the techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities by Gaussian mixtures, where all parameters such as the number of mixands, their weight, mean, and covariance are automatically determined. The proposed analytic approach is shown to perform sampling more efficiently in high dimensional space. We apply our algorithm to real-time tracking problems, and demonstrate its performance on real video sequences as well as synthetic examples.
Cite
Text
Han et al. "Kernel-Based Bayesian Filtering for Object Tracking." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.199Markdown
[Han et al. "Kernel-Based Bayesian Filtering for Object Tracking." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/han2005cvpr-kernel/) doi:10.1109/CVPR.2005.199BibTeX
@inproceedings{han2005cvpr-kernel,
title = {{Kernel-Based Bayesian Filtering for Object Tracking}},
author = {Han, Bohyung and Zhu, Ying and Comaniciu, Dorin and Davis, Larry S.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2005},
pages = {227-234},
doi = {10.1109/CVPR.2005.199},
url = {https://mlanthology.org/cvpr/2005/han2005cvpr-kernel/}
}