Computational complexity analysis for multiple hypothesis tracking
Shuang Cong, L. Hong · 2002
This paper presents a detailed analysis of the computational complexity of multiple hypothesis tracking (MHT). The result shows that the computational complexity of MHT is dominated by the number of hypotheses. Track merging and pruning are also analyzed. The results of this paper provide a new efficient tool for selecting parameters for an MHT tracker and predicting its complexity.