CIOMP OpenIR  > 中科院长春光机所知识产出
Ellipticity pivot star method for autonomous star identification
Sun, Z. P.; X. D. Qi; G. Jin and T. C. Wang
2017
发表期刊Optik
卷号137
摘要A new fast algorithm for autonomous star identification in the general lost-in-space case is developed based on optimized catalog. The proposed method takes advantage of singular value decomposition method and the accuracy angular separation information. The central idea is that a unique pattern is created for each of guide star so that the pattern recognition is simple and straightforward and the index entry reaches minimum. The unique pattern is comprised of ellipticity and angular separations between pivot star and adjacent stars. The method for selecting adjacent stars of pivot star and how to rank them is presented. Three series of simulations each of which included more than ten thousand star tracker orientations were performed by dividing the entire celestial sphere into small regions. The results support the validity of the proposed method that achieves higher identification rate with 99.999%. (C) 2017 Elsevier GmbH. All rights reserved.
收录类别sci ; ei
语种英语
文献类型期刊论文
条目标识符http://ir.ciomp.ac.cn/handle/181722/59208
专题中科院长春光机所知识产出
推荐引用方式
GB/T 7714
Sun, Z. P.,X. D. Qi,G. Jin and T. C. Wang. Ellipticity pivot star method for autonomous star identification[J]. Optik,2017,137.
APA Sun, Z. P.,X. D. Qi,&G. Jin and T. C. Wang.(2017).Ellipticity pivot star method for autonomous star identification.Optik,137.
MLA Sun, Z. P.,et al."Ellipticity pivot star method for autonomous star identification".Optik 137(2017).
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Ellipticity pivot st(830KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Sun, Z. P.]的文章
[X. D. Qi]的文章
[G. Jin and T. C. Wang]的文章
百度学术
百度学术中相似的文章
[Sun, Z. P.]的文章
[X. D. Qi]的文章
[G. Jin and T. C. Wang]的文章
必应学术
必应学术中相似的文章
[Sun, Z. P.]的文章
[X. D. Qi]的文章
[G. Jin and T. C. Wang]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Ellipticity pivot star method.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。