arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.08482cs.CV
收藏

用于多目标跟踪的深度网络流

Deep Network Flow for Multi-Object Tracking

NEC Laboratories America(美国NEC实验室)

Samuel Schulter, Paul Vernaza, Wongun Choi, Manmohan Chandraker

摘要:

数据关联问题是许多计算机视觉应用的重要组成部分,多目标跟踪是最突出的例子之一。数据关联的一种典型方法是找到一个图匹配或网络流,使成对关联成本之和最小化,这些成本通常是手工制作的,或者是作为固定特征的线性函数学习的。在这项工作中,我们证明了它是可以学习功能的网络流为基础的数据关联通过反向传播,通过表达的最佳平滑网络流问题作为一个可微函数的成对关联成本。我们将这种方法应用于多目标跟踪与网络流配方。我们的实验表明,我们能够以端到端的方式成功地学习关联问题的所有成本函数,在所有设置中都优于手工制作的成本。各种输入源的集成和组合变得容易,成本函数可以完全从数据中学习,减轻了繁琐的手工成本设计。

英文摘要:

Data association problems are an important component of many computer vision applications, with multi-object tracking being one of the most prominent examples. A typical approach to data association involves finding a graph matching or network flow that minimizes a sum of pairwise association costs, which are often either hand-crafted or learned as linear functions of fixed features. In this work, we demonstrate that it is possible to learn features for network-flow-based data association via backpropagation, by expressing the optimum of a smoothed network flow problem as a differentiable function of the pairwise association costs. We apply this approach to multi-object tracking with a network flow formulation. Our experiments demonstrate that we are able to successfully learn all cost functions for the association problem in an end-to-end fashion, which outperform hand-crafted costs in all settings. The integration and combination of various sources of inputs becomes easy and the cost functions can be learned entirely from data, alleviating tedious hand-designing of costs.

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

↑