19 November 2018 in IEEE Transactions on Circuits and Systems for Video Technology
Tracking-by-detection is one of the most popular approaches for tracking multiple objects in which the detector plays an important role. Sometimes detector failures caused by occlusions or various poses are unavoidable and lead to tracking failure. To cope with this problem, we construct a heterogeneous association graph that fuses high-level detections and low-level image evidence for target association. Compared with other methods of using low-level information, our proposed Heterogeneous Association Fusion(HAF) tracker is less sensitive to particular parameters and is easier to extend and implement. We use the fused association graph to build track trees for HAF and solve them by the multiple hypotheses tracking (MHT) framework, which has been proven competitive by introducing efficient pruning strategies. In addition, a novel idea of adaptive weights is proposed to analyze the contribution between motion and appearance. We also evaluate our results on the MOT challenge benchmarks and achieve state-of-the-art results on the MOT Challenge 2017.
13 November 2018 in IEEE Transactions on Circuits and Systems for Video Technology
This paper proposes a novel iterative maximum weighted independent set(MWIS) algorithm for multiple hypothesis tracking(MHT) in a tracking-by-detection framework. MHT converts the tracking problem into a series of MWIS problems across the tracking time. Previous works solve these NP-hard MWIS problems independently without the use of any prior information from each frame, and they ignore the relevance between adjacent frames. In this work, we iteratively solve the MWIS problems by using the MWIS solution from the previous frame rather than solving the problem from scratch each time. First, we define five hypothesis categories and hypothesis transfer model, which explicitly describes the hypothesis relationship between adjacent frames. We also propose a polynomial-time approximation algorithm for the MWIS problem in MHT. In addition to that, we present a confident short tracklet generation method and incorporate tracklet-level association into MHT, which further improve the computational efficiency. Our experiments on both MOT16 and MOT17 benchmarks show that our tracker outperforms all the previously published tracking algorithms on both MOT16 and MOT17 benchmarks. Lastly, we demonstrate that the polynomial-time approximate tracker reaches nearly the same tracking performance.