arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.01202astro-ph.IM
收藏

在大数据集中跨年度链接短弧轨迹

Linking tracklets over the years in large datasets

Óscar Rodríguez, Giovanni F. Gronchi, Giulio Baù, Robert Jedicke

AI总结:

提出一种基于Keplerian积分和图论的新程序,通过链接相隔数年的短弧轨迹并计算最小二乘轨道,成功在小行星中心ITF数据集中识别出数万个新天体。

摘要:

我们提出了一种新程序,用于在未链接检测的大型数据集中识别已知天体的观测数据。该程序首先采用一种Keplerian积分方法,即使短弧轨迹在时间上相隔数年,也能将两条短弧轨迹链接起来并计算出初步轨道。第二步,我们将结果表示为一个“图”,其中短弧轨迹作为节点,初步轨道作为边。接着,识别出可接受的“3-循环”并为每个循环计算最小二乘轨道。最后,我们通过搜索邻近3-循环的轨道并尝试归属剩余的短弧轨迹,构建包含 $n \geq 4$ 条短弧轨迹的序列。我们使用模拟小行星中心Isolated Tracklet File (ITF)关键参数的真实检测数据,评估了该技术在识别未知天体方面的效率,随后将该程序应用于ITF,成功识别出数万个新天体。

英文摘要:

We present a new procedure to identify observations of known objects in large data sets of unlinked detections. It begins with a Keplerian integrals method that allows us to link two tracklets, computing preliminary orbits, even when the tracklets are separated in time by a few years. In the second step, we represent the results in a `graph' where the tracklets are the nodes and the preliminary orbits are the edges. Then, acceptable `3-cycles' are identified and a least squares orbit is computed for each of them. Finally, we construct sequences of $n \geq 4$ tracklets by searching through the orbits of nearby 3-cycles and attempting to attribute the remaining tracklets. We calculate the technique's efficiency at identifying unknown objects using real detections that attempt to mimic key parameters of the Minor Planet Center's Isolated Tracklet File (ITF) and then apply the procedure to the ITF to identify tens of thousands of new objects.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑