针对上斜坡读出探测器的最优拟合与去偏
Optimal Fitting and Debiasing for Detectors Read Out Up-the-Ramp
AI总结:
本文提出了适用于任意读出方案的理想探测器像素计数率最优斜坡拟合与一阶去偏方法,给出解析表达式与Python实现,处理效率高且代码开源,相关算法可结合跳变检测用于JWST数据处理。
摘要:
本文推导了在存在读出噪声和光子噪声的情况下,对以非破坏性方式读出的理想探测器的像素计数率的最优拟合方法。该方法适用于任意读出方案,可给出所有物理量的解析表达式,且计算成本与合成帧(即多组读出的组合)的数量呈线性关系。本文还推导了由协方差矩阵估计引入的拟合偏差,并说明了如何对其进行一阶消除。本文提出的斜坡拟合算法可给出累积计数的直线拟合的$χ^2$值,该值可作为拟合优度指标。本文提供并介绍了这些算法的纯Python实现,在2020款Macbook Air的单核上开启去偏功能时,该实现处理$4096 \times 4096$探测器的10个合成帧的斜坡数据仅需约8秒。该Python实现、配套测试及教程笔记本可在https://github.com/t-brandt/fitramp 获取。一篇配套论文介绍了基于斜坡拟合假设检验的跳变检测算法,并利用JWST(詹姆斯·韦布空间望远镜)的数据验证了所有算法的有效性。
英文摘要:
This paper derives the optimal fit to a pixel's count rate in the case of an ideal detector read out nondestructively in the presence of both read and photon noise. The approach is general for any readout scheme, provides closed-form expressions for all quantities, and has a computational cost that is linear in the number of resultants (groups of reads). I also derive the bias of the fit from estimating the covariance matrix and show how to remove it to first order. The ramp-fitting algorithm I describe provides the $χ^2$ value of the fit of a line to the accumulated counts, which can be interpreted as a goodness-of-fit metric. I provide and describe a pure Python implementation of these algorithms that can process a 10-resultant ramp on a $4096 \times 4096$ detector in $\approx$8 seconds with bias 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}. A companion paper describes a jump detection algorithm based on hypothesis testing of ramp fits and demonstrates all algorithms on data from JWST.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。