Likelihood-Based Jump Detection and Cosmic Ray Rejection for Detectors Read Out Up-the-Ramp

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 $\chi^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.
Comment: 17 pages, 10 figures, PASP accepted. Code available at https://github.com/t-brandt/fitramp. This submission supersedes Sections 6 and 7 and Appendix C of arXiv:2309.08753v1. arXiv admin note: substantial text overlap with arXiv:2309.08753