Computation-time reduction of track oriented multiple hypothesis tracking

In recent years MHT (multiple hypothesis tracking) attracts much attention because of its tracking performance. MHT has heavy computation load problem and an approach for computation time reduction by applying N-best algorithm was reported. We have improved the function of MHT and named the improved algorithm as track oriented MHT. It has different data structure from original Reid´s MHT d(1984), so N-best algorithm can not be applied to it straightforwardly. We show the applying method of N-best algorithm to track oriented MHT. And also we show the efficiency of the method by comparing the computation time in a simulation