An Efficient Implementation of Track-Oriented Multiple Hypothesis Tracker Using Graphical Model Approaches

The multiple hypothesis tracker (MHT) is currently the preferred method for addressing data association problem in multitarget tracking (MTT) application. MHTseeks themost likely global hypothesis by enumerating all possible associations over time, which is equal to calculating maximum a posteriori (MAP) estimate over the report data. Despite being a well-studied method, MHT remains challenging mostly because of the computational complexity of data association. In this paper, we describe an efficient method for solving the data association problem using graphical model approaches. The proposed method uses the graph representation to model the global hypothesis formation and subsequently applies an efficient message passing algorithm to obtain the MAP solution. Specifically, the graph representation of data association problem is formulated as a maximum weight independent set problem (MWISP), which translates the best global hypothesis formation into finding the maximum weight independent set on the graph. Then, a max-product belief propagation (MPBP) inference algorithmis applied to seek themost likely global hypotheses with the purpose of avoiding a brute force hypothesis enumeration procedure. The simulation results show that the proposed MPBP-MHT method can achieve better tracking performance than other algorithms in challenging tracking situations.