Abstract
Bayesian filters are often used in statistical inference and consist of recursively alternating between two steps: prediction and correction. Most commonly the Gaussian distribution is used within the Bayes filtering framework, but other distributions, which could model better the nature of the estimated phenomenon like the von Mises-Fisher distribution on the unit sphere, have also been subject of research interest. However, the von Mises-Fisher filter requires approximations since the prediction step does not yield an another von Mises-Fisher distribution. Furthermore, other advanced filtering methods require approximating a mixture of distributions with just a single component. In this paper we propose to use the score matching within the context of Bayesian assumed density filtering inlieu of the more common moment matching. Moment matching functions by assuming the type of the resulting distribution and then matching its moments with the prior distribution, which in the end minimizes the Kullback-Leibler divergence. Score matching also assumes the resulting distribution type, but finds optimal parameters by minimizing the relative Fisher information. In the paper we show that the score matching procedure results with identical performance, but with simpler equations that, unlike moment matching, do not require tedious numerical methods. In the end, we corroborate theoretical results by running the moment and score matching based filters for single and multiple object tracking on a large number of randomly generated trajectories on the unit sphere.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.