Binary Information Press
An improved optimal point-track data association algorithm is proposed. Firstly, the algorithm gets several effective 3-tuple of measurement by using the optimal association results of 3-Dimensional (3- D) assignment problem of data association. Then, the marginal association probability between the valid 3-tuple of measurement and target track is calculated according to multiple-to-multiple feasible rule. Finally, the association matches between the effective 3-tuple of measurement and target track are got by solving a 2-D assignment problem whose benefit matrix is consisted of the above point-track marginal association probability and they are further used to update the state of target.