pith. sign in

arxiv: 1701.01909 · v2 · pith:P4SBAOQYnew · submitted 2017-01-08 · 💻 cs.CV

Tracking The Untrackable: Learning To Track Multiple Cues with Long-Term Dependencies

classification 💻 cs.CV
keywords multiplecuestrackingappearancechallengedependencieslong-termmethod
0
0 comments X
read the original abstract

The majority of existing solutions to the Multi-Target Tracking (MTT) problem do not combine cues in a coherent end-to-end fashion over a long period of time. However, we present an online method that encodes long-term temporal dependencies across multiple cues. One key challenge of tracking methods is to accurately track occluded targets or those which share similar appearance properties with surrounding objects. To address this challenge, we present a structure of Recurrent Neural Networks (RNN) that jointly reasons on multiple cues over a temporal window. We are able to correct many data association errors and recover observations from an occluded state. We demonstrate the robustness of our data-driven approach by tracking multiple targets using their appearance, motion, and even interactions. Our method outperforms previous works on multiple publicly available datasets including the challenging MOT benchmark.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph Neural Based End-to-end Data Association Framework for Online Multiple-Object Tracking

    cs.CV 2019-07 unverdicted novelty 6.0

    A graph neural network framework learns affinities from appearance and motion then solves bipartite matching for online multiple-object tracking.