计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (2): 177-180.

• 数据库、数据挖掘、机器学习 • 上一篇    下一篇

基于投影网格的三维雷达包络融合方法

刘彦君,廖若彤,乔士东   

  1. 国防科学技术大学 信息系统工程重点实验室,长沙 410073
  • 出版日期:2013-01-15 发布日期:2013-01-16

Method for radar coverage fusing based on projective grid

LIU Yanjun, LIAO Ruotong, QIAO Shidong   

  1. Information System Engineering Key Laboratory, National University of Defense Technology, Changsha 410073, China
  • Online:2013-01-15 Published:2013-01-16

摘要: 针对雷达探测范围的三维可视化问题,给出了投影网格融合算法(FatPig)。该算法在多个雷达包络的重叠区域构建面积较小、长度合适的网格,分别对每组重叠雷达包络对做竖投影和侧投影,逐步过滤得到较多的重叠区探测点和较少的非重叠区探测点,并以较低计算复杂度完成多个雷达包络的三维融合。采用标准重叠区探测点对比库方式,得到最优的网格长度,采用成对投影的策略从宏观角度降低计算复杂度,克服以往算法复杂度较高的弊端。分析了FatPig计算复杂度,并实验验证了算法的有效性。

关键词: 雷达包络, 包络融合, 网格, 投影

Abstract: In order to solve the three-dimensional visualization problem of the radar detection range, this paper gives an algorithm of projection grid for cover fusion(FatPig). The algorithm designs a smaller-area and appropriate-length grid in the overlapping regions of multi-radar covers, then makes the horrent and tilted projection for each pair of radar covers, in order to gradually filter more detection points in the overlapping area and less detection points out of the overlapping area, finally, gets the fusion of multi-radar covers at a lower computational complexity. It uses the method which needs to compare with the standard comparison libraries of overlapping detection points for gaining the optimal length of the grid, and uses the strategies of projection by pairs for reducing the computational complexity from a macro perspective, which can overcome the high computational complexity shortage of former algorithms. It analyzes the computational complexity and validity of FatPig by experience.

Key words: radar coverage, coverage fusing, grid networks, projection