P向量实现快速星图识别的方法

 提出了一种快速的星图识别方法。该方法识别时提取出描述观测三角形的一维特征量P，根据该值快速检索到对应的导航三角形，减少了计算过程。由于获得星点位置的时候存在误差，所以将一定误差范围内的三角形均作为待选三角形考虑。上述识别后引入了验证识别环节，保证识别的准确性。随机实验统计表明，同等星点位置噪声方差下，该方法和栅格算法相比识别率提高约1%，识别时间约为后者的1/5。

Fast Star Identification Algorithm Using P Vector

This article proposed one kind of fast celestial chart recognition method.This method extracts the one-dimensional feature P which marks the triangle uniquely.Computation of P value from the observed star map speeds up the get of the correspondence navigational triangle.This method reduces the computation process.Because of the star position error,more triangles within some scope should be selected.Then verification process is introduced to confirm the identification results.The stochastic experiment indicates that the identification rate of this method can be enhanced approximately 1% as compared to that of the grid algorithm at the same position noise level.The identification time of proposed algorithm reduces to 1/5.