检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陆敬辉[1] 王宏力[1] 孙渊[1] 崔祥祥[1]
出 处:《红外与激光工程》2011年第4期752-756,共5页Infrared and Laser Engineering
基 金:国家自然科学基金(60874093)
摘 要:在三角形三条边长之比及其内切圆半径已知的情况下可以确定唯一的三角形,由此提出了一种基于三角形内切圆的星图识别算法。构建了导航星表,每个导航三角形按照导航星之间的角距升序来存储,构造了能够反映导航三角形三边之间关系的特征量T为索引,存储三角形内切圆半径R为识别量;在星图识别过程中,利用特征量T进行搜索、三角形内切圆半径R进行识别,若识别结果不唯一,则进一步采用三角形角距的方法进行识别。仿真结果表明:该方法对位置误差和星等误差均有较好的鲁棒性;当存在2像元的位置噪声时,识别成功率大于97.48%,平均识别时间为22.64 ms。Based on the fact that any triangle is determined by its side ratio and incircle radius,a new star pattern identification algorithm was proposed.In this algorithm,guide star catalogue was constructed,every guide star triangle was stored according to the angular distance among guide stars,a variable T that describes the relation of the three sides of guide star triangle was constructed and indexed,the triangle incircle radius was also stored for identification.In the process of star pattern identification,the variable was used for indexing and the triangle incircle radius was used for identifying.If there was more than one identification result,the triangle distance algorithm was used.The simulation results show that the proposed algorithm has better robustness for position and magnitude error,when the Gauss noise of position error is two pixels,the identification rate is greater than 97.48% and the average identification time is 22.64 ms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.128.205.62