arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.14550cs.CVcs.DM
收藏

提升不相交路径及其在多目标跟踪中的应用

Lifted Disjoint Paths with Application in Multiple Object Tracking

Max Planck Institute for Informatics(马克斯·普朗克信息学研究所);Leibniz University Hannover(汉诺威莱布尼茨大学)

Andrea Hornakova, Roberto Henschel, Bodo Rosenhahn, Paul Swoboda

摘要:

我们提出了一个扩展的不相交的路径问题,其中额外的\emph{lifted}边缘被引入到提供路径连接先验。我们称由此产生的优化问题的提升不相交路径问题。我们证明了这个问题是NP-困难的减少从整数多商品流和3-SAT。为了实现实际的全局优化,我们提出了几类线性不等式,产生高质量的LP松弛。此外,我们提出了有效的切割平面算法分离提出的线性不等式。提升的不相交路径问题是多目标跟踪的自然模型,并且允许用于长距离时间交互的优雅的数学公式。提升的边缘有助于防止身份转换和重新识别人员。我们的提升不相交路径跟踪器实现了输入检测方面的近最佳分配。因此,它在MOT挑战的所有三个主要基准上都处于领先地位,比最先进的技术有了显着改进。

英文摘要:

We present an extension to the disjoint paths problem in which additional \emph{lifted} edges are introduced to provide path connectivity priors. We call the resulting optimization problem the lifted disjoint paths problem. We show that this problem is NP-hard by reduction from integer multicommodity flow and 3-SAT. To enable practical global optimization, we propose several classes of linear inequalities that produce a high-quality LP-relaxation. Additionally, we propose efficient cutting plane algorithms for separating the proposed linear inequalities. The lifted disjoint path problem is a natural model for multiple object tracking and allows an elegant mathematical formulation for long range temporal interactions. Lifted edges help to prevent id switches and to re-identify persons. Our lifted disjoint paths tracker achieves nearly optimal assignments with respect to input detections. As a consequence, it leads on all three main benchmarks of the MOT challenge, improving significantly over state-of-the-art.

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

↑