检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学信息系统工程重点实验室,长沙410073
出 处:《计算机工程与应用》2013年第2期177-180,共4页Computer Engineering and Applications
基 金:国家自然科学基金(No.71031007)
摘 要:针对雷达探测范围的三维可视化问题,给出了投影网格融合算法(FatPig)。该算法在多个雷达包络的重叠区域构建面积较小、长度合适的网格,分别对每组重叠雷达包络对做竖投影和侧投影,逐步过滤得到较多的重叠区探测点和较少的非重叠区探测点,并以较低计算复杂度完成多个雷达包络的三维融合。采用标准重叠区探测点对比库方式,得到最优的网格长度,采用成对投影的策略从宏观角度降低计算复杂度,克服以往算法复杂度较高的弊端。分析了FatPig计算复杂度,并实验验证了算法的有效性。In order to solve the three-dimensional visualization problem of the radar detection range, this paper gives an algo- rithm of projection grid for cover fusion(FatPig). The algorithm designs a smaller-area and appropriate-length grid in the over- lapping regions of multi-radar covers, then makes the horrent and tilted projection for each pair of radar covers, in order to gradu- ally filter more detection points in the overlapping area and less detection points out of the overlapping area, finally, gets the fu- sion 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 projec- tion 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.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.148.202