论文部分内容阅读
讨论了一种新的无须任何先验知识的星图识别算法。通过对导航星座数据库进行调整和最大限度地利用了已识别基元所提供的匹配信息，使得算法的计算量和存储容量与传统的三角形匹配算法相当。ＭｏｎｔｅＣａｒｌｏ 模拟表明，在星等误差０．５ 星等（３σ） ，位置误差１０ 角秒（１σ） 时，算法的识别成功率接近１００％ 。
A new star-map recognition algorithm without any prior knowledge is discussed. By adjusting the navigation constellation database and making maximum use of matching information provided by the identified primitives, the computation and storage capacity of the algorithm are comparable to those of the traditional triangle matching algorithm. MonteCarlo simulation shows that the recognition rate of the algorithm is close to 100% when the magnitude error is equal to 0.5 (3σ) and the position error is 10 arcsec (1σ).