arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.01124cs.CV
收藏

基于互补图的多目标识别标签传播算法

Discriminative and Efficient Label Propagation on Complementary Graphs for Multi-Object Tracking

Université catholique de Louvain(鲁汶天主教大学)

Amit Kumar K. C., Laurent Jacques, Christophe De Vleeschouwer

摘要:

给定一组在每个时刻独立检测到的检测,我们研究如何将它们跨时间关联起来。这是通过在一组图上传播标签来完成的,每个图捕捉时空或外观线索如何促进将相同或不同的标签分配给一对检测。图的构造是由局部线性嵌入的检测功能的动机。有趣的是,外观图中节点的邻域被定义为包括外观特征可用的所有节点(即使它们在时间上是遥远的)。这给了我们的框架不寻常的能力,利用外观功能,只有零星可用。一旦图被定义,多目标跟踪被公式化为找到与每个图捕获的约束一致的标签分配的问题,这导致凸(DC)程序的差异。我们建议将全局目标函数分解为节点子问题。这不仅允许计算高效的解决方案,而且还支持图的增量和可扩展的构造,从而使框架适用于大型图和实际跟踪场景。此外,它还提供了并行执行的可能性。

英文摘要:

Given a set of detections, detected at each time instant independently, we investigate how to associate them across time. This is done by propagating labels on a set of graphs, each graph capturing how either the spatio-temporal or the appearance cues promote the assignment of identical or distinct labels to a pair of detections. The graph construction is motivated by a locally linear embedding of the detection features. Interestingly, the neighborhood of a node in appearance graph is defined to include all the nodes for which the appearance feature is available (even if they are temporally distant). This gives our framework the uncommon ability to exploit the appearance features that are available only sporadically. Once the graphs have been defined, multi-object tracking is formulated as the problem of finding a label assignment that is consistent with the constraints captured each graph, which results into a difference of convex (DC) program. We propose to decompose the global objective function into node-wise sub-problems. This not only allows a computationally efficient solution, but also supports an incremental and scalable construction of the graph, thereby making the framework applicable to large graphs and practical tracking scenarios. Moreover, it opens the possibility of parallel implementation.

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

↑