Plot Association for Multi-Sensor Based on Hungary Algorithm

Abstract In order to solve the problem of plot association for multi-sensor in sea clutter environment, a method is presented based on Hungary algorithm, which is translated into an assignment problem. Plots from the same target are associated by constituting association matrix which describes global nearest neighbor similarity among plots, and the optimum association sequence is calculated by Hungary algorithm. Simulations show that the algorithm can efficiently identify and associate targets in complex state with sea clutter, such as targets with parallel movement, targets with intersecting movement, and target with turning movement. Its facile realization could offer some references to study on plot fusion.