首页> 外文会议>Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on >Discrete-continuous optimization for multi-target tracking
【24h】

Discrete-continuous optimization for multi-target tracking

机译:离散连续优化的多目标跟踪

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image observations to the appropriate target; (ii) the naturally continuous problem of trajectory estimation, i.e. recovering the trajectories of all targets. To go beyond simple greedy solutions for data association, recent approaches often perform multi-target tracking using discrete optimization. This has the disadvantage that trajectories need to be pre-computed or represented discretely, thus limiting accuracy. In this paper we instead formulate multi-target tracking as a discrete-continuous optimization problem that handles each aspect in its natural domain and allows leveraging powerful methods for multi-model fitting. Data association is performed using discrete optimization with label costs, yielding near optimality. Trajectory estimation is posed as a continuous fitting problem with a simple closed-form solution, which is used in turn to update the label costs. We demonstrate the accuracy and robustness of our approach with state-of-the-art performance on several standard datasets.
机译:多目标跟踪问题包括两个截然不同但紧密耦合的挑战:(i)数据关联的自然离散问题,即将图像观测值分配给适当的目标; (ii)轨迹估计的自然连续问题,即恢复所有目标的轨迹。为了超越用于数据关联的简单贪婪解决方案,最近的方法通常使用离散优化来执行多目标跟踪。这样做的缺点是轨迹需要预先计算或离散地表示,从而限制了精度。在本文中,我们改为将多目标跟踪公式化为离散连续优化问题,该问题可处理其自然域中的每个方面,并允许利用强大的方法进行多模型拟合。使用具有标签成本的离散优化来执行数据关联,从而产生接近最优的效果。轨迹估计被认为是具有简单封闭形式解决方案的连续拟合问题,该解决方案又用于更新标签成本。我们在几个标准数据集上以最先进的性能展示了我们方法的准确性和鲁棒性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号