A modified Murty algorithm for multiple hypothesis tracking

In this paper, we present two practical modifications of the original Murty algorithm. First, the algorithm is modified to handle rectangular association matrix. The original Murty algorithm was developed for a square matrix. It is found that the expanding rules should be changed so that the cross-over pair within an assignment can be extended to the last column and can be repeated for the last column upon certain conditions. The second modification is the allowance of an "infeasible" assignment, where some tracks are not assigned with any measurements, therefore, good "infeasible" hypotheses are maintained and clutter seduced hypotheses are suppressed when the information evidence becomes stronger. Examples are used to demonstrate the modifications of the existing Murty algorithm for a practical implementation of an N-best Multiple Hypothesis Tracker.