Bearing-crossing localization oriented data association algorithm for two-hierarchic elimination

In view of existing data association algorithms′ deficiency in real time,a two-hierarchic elimination based data association(TEDA) algorithm was proposed.Firstly a series of candidate association sets was generated,whose number was equal to the number of targets,according to an association criterion.Then the unmerited bearing lines were eliminated from the candidate association sets by rough association process and refined association process.The proposed algorithms is not necessary to deal with all the possible association sets,thus it can cut down the computation complexity greatly.Moreover,it can restrain the influence of clutter effectively.Simulations demonstrate the merits of TEDA in terms of efficiency and preciseness.