The fast co-adding algorithm of QCT
文献类型:期刊论文
作者 | Ping, Yiding1,2![]() |
刊名 | ADVANCES IN SPACE RESEARCH
![]() |
出版日期 | 2017-09-01 |
卷号 | 60期号:5页码:907-914 |
关键词 | Image-processing Instrumentation Space debris |
ISSN号 | 0273-1177 |
DOI | 10.1016/j.asr.2017.05.018 |
英文摘要 | This paper presents a fast co-adding algorithm designed to stack the images coming from different channels of QCT in real-time. The algorithm calculates the transformation coefficients for every single exposure to eliminate the effects of the possible shifts of the lenses. The way of reprojection and co-adding applied here is a linear method similar to Drizzle, and a reasonable simplification is applied to accelerate the computation. All the calculation can be finished in about 100 ms on a 3.4 GHz CPU with 4 cores, which matches the needs for the observation of space debris perfectly, while the limiting magnitude is improved by about 0.8. The co-adding results of our algorithm are very close to SWarp's, even slightly better in terms of SNRs. (C) 2017 COSPAR. Published by Elsevier Ltd. All rights reserved. |
WOS研究方向 | Astronomy & Astrophysics ; Geology ; Meteorology & Atmospheric Sciences |
语种 | 英语 |
WOS记录号 | WOS:000407410500003 |
出版者 | ELSEVIER SCI LTD |
源URL | [http://libir.pmo.ac.cn/handle/332002/22613] ![]() |
专题 | 中国科学院紫金山天文台 |
通讯作者 | Ping, Yiding |
作者单位 | 1.Chinese Acad Sci, Purple Mt Observ, 2 West Beijing Rd, Nanjing 210008, Jiangsu, Peoples R China 2.Chinese Acad Sci, Purple Mt Observ, Key Lab Space Object & Debris Observat, Nanjing 210008, Jiangsu, Peoples R China 3.Univ Sci & Technol China, Sch Astron & Space Sci, Hefei 230026, Anhui, Peoples R China |
推荐引用方式 GB/T 7714 | Ping, Yiding,Zhang, Chen. The fast co-adding algorithm of QCT[J]. ADVANCES IN SPACE RESEARCH,2017,60(5):907-914. |
APA | Ping, Yiding,&Zhang, Chen.(2017).The fast co-adding algorithm of QCT.ADVANCES IN SPACE RESEARCH,60(5),907-914. |
MLA | Ping, Yiding,et al."The fast co-adding algorithm of QCT".ADVANCES IN SPACE RESEARCH 60.5(2017):907-914. |
入库方式: OAI收割
来源:紫金山天文台
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。