arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.3471cs.LGcs.AIstat.ML
收藏

基于在线学习的跟踪框架

An Online Learning-based Framework for Tracking

University of California, San Diego(加利福尼亚大学圣迭戈分校)

Kamalika Chaudhuri, Yoav Freund, Daniel Hsu

摘要:

我们研究的跟踪问题,即,估计隐藏状态的对象随着时间的推移,从不可靠的和嘈杂的测量。跟踪问题的标准框架是生成框架,这是解决方案的基础,如贝叶斯算法及其近似,粒子滤波器。然而,这些解决方案可能对模型失配非常敏感。在本文中,动机的在线学习,我们介绍了一个新的框架跟踪。我们为这个框架提供了一个有效的跟踪算法。我们提供的实验结果比较我们的算法模拟数据的贝叶斯算法。实验结果表明,当模型存在轻微的不匹配时,该算法的性能优于贝叶斯算法。

英文摘要:

We study the tracking problem, namely, estimating the hidden state of an object over time, from unreliable and noisy measurements. The standard framework for the tracking problem is the generative framework, which is the basis of solutions such as the Bayesian algorithm and its approximation, the particle filters. However, these solutions can be very sensitive to model mismatches. In this paper, motivated by online learning, we introduce a new framework for tracking. We provide an efficient tracking algorithm for this framework. We provide experimental results comparing our algorithm to the Bayesian algorithm on simulated data. Our experiments show that when there are slight model mismatches, our algorithm outperforms the Bayesian algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑