摘要
查找导航星表是星模式识别的重要组成部分,当导航星表数据量大时,导航星表的查找速度直接影响星图识别的速度。因此,设计快速的星表查找算法是非常必要的。通过对导航星角距分布的研究,提出了一种分块子星表查找算法。该方法减小了查找算法的平均查找长度。以6星等导航星库为例,给出了分块子星表的具体建立方法。实验验证了该方法提高了查找速度。
The searching of star list plays an important role in star pattern recognition.When the numberof star list is huge,it is necessary to develop an fast searching algorithm for star tracker.The distribution of agnular distance of star pairs is investegated in this paper.A fast searching algorithm based on the distribution of angular distance is provided.This algorithm decreases the average search length.In order to prove the performance of this algorithm,a specific example with6visual magnitude star catalog is given.The result has proved the improvement of searching speeed.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第9期16-17,54,共3页
Computer Engineering and Applications
基金
航天关键技术支撑项目基金
关键词
星对角距
折半查找
概率分布
star pair angular distance,binary searching,probability distribution
