华中科技大学学报（自然科学版）2017，Vol.42Issue(2)：95-100,6.DOI:10.13245/j.hust.170218
基于二分图最优完备匹配的目标关联算法
Target association method based on bipartite graph optimal complete matching
摘要
Abstract
In order to resolve the problem of dense flying targets association,a new method based on bipartite graph optimal complete matching was proposed.In the method,the bipartite graph of target association was generated by grid clustering,and the weights of edges were defined.The target asso-ciation model was introduced by the bipartite graph optimal complete matching with restrict condi-tions.By solving the proposed model,the target relationship can be achieved properly.The proposed association method was verified by Monte-Carlo simulation experiment in different systematic errors and targets flying interval situation.Experimental results indicate that the algorithm can restrain the influence of the sensor system errors,reduce the uncertainty of denseness multi-target association problem,and satisfy the computational complexity of data fusion engineering application,which show good performance with validity and robustness.关键词
群目标/系统偏差/二分图/目标关联/最优匹配Key words
dense targets/systematic errors/bipartite graph/target association/optimal matching分类
信息技术与安全科学引用本文复制引用
吴汉宝,李伦,张志云..基于二分图最优完备匹配的目标关联算法[J].华中科技大学学报（自然科学版）,2017,42(2):95-100,6.基金项目
国防预研基金资助项目 （）
