基于Delaunay三角剖分的全天自主星图识别算法

All-sky autonomous star map identification algorithm based on Delaunay triangulation cutting algorithm

在地球物理建模中 ,Delaunay三角剖分因其对给定点集进行三角剖分具有剖分结果唯一性这一重要特点而得到广泛应用 .采用Delaunay剖分这一性质 ,首次将Delaunay剖分算法应用到星图识别中 .利用全天球星图的剖分不变性 ,采用有界曲面剖分的边界递归法 ,生成有序且容量小的完备导航星库 ;利用二维Delaunay三角剖分对视场内恒星星图进行剖分 ,将其结果进行快速匹配识别 .仿真实验结果表明与现有的星图识别算法相比 ,此算法具有高的识别率 ,良好的实时性和鲁棒性 ,且所需导航星库的容量小 。

In the field of geophysical model building, Delaunay triangulation cutting algorithm has been widely used because of having a very important characteristic which is the result of this triangulation cutting method being unique in a specifically set of points. This character was adopted, the algorithm to identify star map for the first time was used. Making use of the invariability of cutting in all-sky star atlas and adopting the boundary recursive method for constrained triangulation of surfaces, the guidance stars database which was arranged under specific rules and whose size was comparatively small was constructed; the recognition algorithm utilized the result generated by Delaunay cutting star map in a specified field of view to match and identify quickly. The simulation results show that compared with the current star map identification algorithms, this algorithm has a high rate of discrimination, the advantages of real-time properties and robust; and it only needs a small content database and searches more rapidly.