针对斜坡读出(up-the-ramp)探测器的基于似然的跳变检测与宇宙线剔除
Likelihood-Based Jump Detection and Cosmic Ray Rejection for Detectors Read Out Up-the-Ramp
AI总结:
针对斜坡读出探测器的跳变与宇宙线检测问题,提出基于全读数似然与$χ^2$比较的跳变检测方法,灵敏度更高且计算线性复杂度,提供高效Python实现并通过JWST数据验证。
摘要:
本文针对斜坡读出(up-the-ramp)探测器实现了基于似然的跳变检测方法,利用全部读数集合计算似然值。该方法对每个可能的跳变位置,比较包含跳变与不包含跳变的拟合结果的$χ^2$值。研究表明,该方法的灵敏度远高于仅使用连续读数组间差值的方法,尤其适用于长斜坡以及发生在读数组中间的跳变场景。该方法的计算成本与合成结果(resultant)的数量呈线性关系。本文提供并介绍了一个纯Python实现版本,在2020款MacBook Air的单核CPU上,处理$4096 \times 4096$探测器的10个合成结果的斜坡数据仅需约20秒,其中包含迭代式宇宙线检测与去除步骤。该Python实现连同测试代码与教程笔记本已发布于https://github.com/t-brandt/fitramp。此外,本文还利用JWST的观测数据,对完整的斜坡拟合与宇宙线剔除方法进行了测试与演示。
英文摘要:
This paper implements likelihood-based jump detection for detectors read out up-the-ramp, using the entire set of reads to compute likelihoods. The approach compares the $χ^2$ value of a fit with and without a jump for every possible jump location. I show that this approach can be substantially more sensitive than one that only uses the difference between sequential groups of reads, especially for long ramps and for jumps that occur in the middle of a group of reads. It can also be implemented for a computational cost that is linear in the number of resultants. I provide and describe a pure Python implementation that can process a 10-resultant ramp on a $4096 \times 4096$ detector in $\approx$20 seconds, including iterative cosmic ray detection and removal, on a single core of a 2020 Macbook Air. This Python implementation, together with tests and a tutorial notebook, are available at \url{https://github.com/t-brandt/fitramp}. I also provide tests and demonstrations of the full ramp fitting and cosmic ray rejection approach on data from JWST.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。