Fast Algorithms for Slow Moving Asteroids: Constraints on the Distribution of Kuiper Belt Objects
Fast Algorithms for Slow Moving Asteroids: Constraints on the Distribution of Kuiper Belt Objects
复制标题
DOI：
10.3847/1538-3881/aafd2d
复制
发表时间：
2019-01
期刊：
影响因子：
--
通讯作者：
Peter J. Whidden;J. Kalmbach;A. Connolly;R. L. Jones;H. Smotherman;D. Bektešević;C. Slater;A. Becker;Ž. Ivezić;Mario Juri'c;B. Bolin;Joachim Moeyens;F. Förster;V. Golkhou
中科院分区：
文献类型：
--
作者：
Peter J. Whidden;J. Kalmbach;A. Connolly;R. L. Jones;H. Smotherman;D. Bektešević;C. Slater;A. Becker;Ž. Ivezić;Mario Juri'c;B. Bolin;Joachim Moeyens;F. Förster;V. Golkhou
本文介绍了一种新的计算技术，用于在天文图像中寻找微弱的运动源。从最大似然估计的一系列图像内的源的检测的概率开始，我们开发了一个大规模的并行算法，通过候选小行星的轨迹，利用图形处理单元（GPU）搜索。这项技术可以在一分钟内使用单个消费级GPU搜索10-15个4K × 4K图像堆栈中的1010多个可能的小行星轨迹。我们将该算法应用于2015年高节奏瞬态调查（HiTS）活动的数据，这些数据是通过暗能量相机（DECam）获得的。我们发现39个以前未知的柯伊伯带天体（KBO）在150平方度的调查。将这些小行星与柯伊伯带倾角分布的现有模型进行比较，我们证明了我们恢复的KBO人口高于我们的检测限与以前的研究一致。分析中使用的软件作为开放源码软件包提供。
We introduce a new computational technique for searching for faint moving sources in astronomical images. Starting from a maximum-likelihood estimate for the probability of the detection of a source within a series of images, we develop a massively parallel algorithm for searching through candidate asteroid trajectories that utilizes graphics processing units (GPU). This technique can search over 1010 possible asteroid trajectories in stacks of the order of 10–15 4K × 4K images in under a minute using a single consumer grade GPU. We apply this algorithm to data from the 2015 campaign of the High Cadence Transient Survey (HiTS) obtained with the Dark Energy Camera (DECam). We find 39 previously unknown Kuiper belt objects (KBOs) in the 150 square degrees of the survey. Comparing these asteroids to an existing model for the inclination distribution of the Kuiper belt we demonstrate that we recover a KBO population above our detection limit consistent with previous studies. Software used in this analysis is made available as an open source package.