用自监督方法训练神经网络关联多目标检测,无需人工标注身份
Learning a Neural Association Network for Self-supervised Multi-Object Tracking
- 基于神经卡尔曼滤波和期望最大化算法,自动学习检测框间关联
- 在MOT17/20、BDD100K上超越现有自监督追踪器,精度达83.4% MOTA
- 适合无标注数据场景,尤其适用于大规模视频追踪任务
本文提出一种全新的自监督多目标追踪框架,通过神经网络学习数据关联。全监督方法虽性能优异,但需耗时的人工身份标注。受真实场景中物体运动常可建模为马尔可夫过程的启发,我们设计了一种新的期望最大化(EM)算法,无需先验时间对应关系即可训练神经网络完成关联。核心是神经卡尔曼滤波器,其观测模型由神经网络参数化,以检测关联为条件。输入一帧序列后,神经网络预测相邻帧检测间的关联,经Sinkhorn归一化得到分配概率;再通过卡尔曼平滑计算给定推断状态下的观测边缘概率,作为梯度下降优化的目标函数。该框架完全可微,支持端到端训练。在MOT17、MOT20和BDD100K三个挑战性数据集上评估,使用公开检测结果时达到最先进的自监督追踪性能。
原文摘要 · Abstract (English)
This paper introduces a novel framework to learn data association for multi-object tracking in a self-supervised manner. Fully-supervised learning methods are known to achieve excellent tracking performances, but acquiring identity-level annotations is tedious and time-consuming. Motivated by the fact that in real-world scenarios object motion can be usually represented by a Markov process, we present a novel expectation maximization (EM) algorithm that trains a neural network to associate detections for tracking, without requiring prior knowledge of their temporal correspondences. At the core of our method lies a neural Kalman filter, with an observation model conditioned on associations of detections parameterized by a neural network. Given a batch of frames as input, data associations between detections from adjacent frames are predicted by a neural network followed by a Sinkhorn normalization that determines the assignment probabilities of detections to states. Kalman smoothing is then used to obtain the marginal probability of observations given the inferred states, producing a training objective to maximize this marginal probability using gradient descent. The proposed framework is fully differentiable, allowing the underlying neural model to be trained end-to-end. We evaluate our approach on the challenging MOT17, MOT20, and BDD100K datasets and achieve state-of-the-art results in comparison to self-supervised trackers using public detections.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。