首页> 外文会议>Asian conference on computer vision >Spatio-Temporal Clustering Model for Multi-object Tracking through Occlusions
【24h】

Spatio-Temporal Clustering Model for Multi-object Tracking through Occlusions

机译:遮挡的多目标跟踪时空聚类模型

获取原文

摘要

The occlusion in dynamic or clutter scene is a critical issue in multi-object tracking. Using latent variable to formulate this problem, some methods achieved state-of-the-art performance, while making an exact solution computationally intractable. In this paper, we present a hierarchical association framework to address the problem of occlusion in a complex scene taken by a single camera. At the first stage, reliable tracklets are obtained by frame-to-frame association of detection responses in a flow network. After that, we propose to formulate track-lets association problem in a spatio-temporal clustering model which presents the problem as faithfully as possible. Due to the important role that affinity model plays in our formulation, we then construct a sparsity induced affinity model under the assumption that a detection sample in a tracklet can be efficiently represented by another tracklet belonging to the same object. Furthermore, we give a near-optimal algorithm based on globally greedy strategy to deal with spatio-temporal clustering, which runs linearly with the number of tracklets. We quantitatively evaluate the performance of our method on three challenging data sets and achieve a significant improvement compared to state-of-the-art tracking systems.
机译:动态或杂乱场景中的遮挡是多对象跟踪中的关键问题。使用潜在变量来表达此问题,一些方法可以实现最先进的性能,同时使精确的解决方案在计算上难以解决。在本文中,我们提出了一种层次化的关联框架,以解决由单个摄像机拍摄的复杂场景中的遮挡问题。在第一阶段,通过流网络中检测响应的帧到帧关联来获得可靠的小轨迹。之后,我们建议在时空聚类模型中拟定轨道-小子关联问题,以尽可能忠实地提出该问题。由于亲和力模型在我们的公式中起着重要的作用,因此我们假设一个小轨迹中的检测样本可以由属于同一对象的另一个小轨迹有效地表示,然后构造一个稀疏性诱导的亲和力模型。此外,我们给出了一种基于全局贪婪策略的近似最优算法来处理时空聚类,该聚类与小轨道的数量成线性关系。我们在三个具有挑战性的数据集上定量评估了我们的方法的性能,并且与最新的跟踪系统相比,取得了显着改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号