CCD图像与星表匹配的快速算法
Fast algorithms for matching CCD images to a stellar catalogue
摘要:
本文提出了两种新的点源二维坐标表匹配算法,其速度明显快于以往的方法。通过匹配两个列表中很少出现的三角形(或更复杂的形状),并通过降低成功概率来排序搜索,证明了只需考虑很少的候选人就可以找到成功的匹配。此外,通过使用有效的机制立即测试潜在匹配的适用性,避免了处理整个候选集的需要,从而产生相当大的性能改进。三角形由余弦度量描述,该度量降低了三角形空间的密度,从而允许高效的搜索。另一种形状表征方法,减少了计算开销的建设阶段进行了讨论。该算法进行了测试的一组10 063宽视场的调查图像,视野高达4.8 × 3.6度,成功匹配100%的图像,平均经过时间为6毫秒(2.4 GHz速龙CPU)。搜索阶段所用的时间被示出为变化小于1毫秒的列表大小在10和200点之间,表明快速,强大的搜索可以在几乎恒定的时间内完成,独立于列表大小。
英文摘要:
Two new algorithms are described for matching two dimensional coordinate lists of point sources that are signifcantly faster than previous methods. By matching rarely occurring triangles (or more complex shapes) in the two lists, and by ordering searches by decreasing probability of success, it is demonstrated that very few candidates need be considered to find a successful match. Moreover, by immediately testing the suitability of a potential match using an efficient mechanism, the need to process the entire candidate set is avoided, yielding considerable performance improvements. Triangles are described by a cosine metric that reduces the density of triangle space, permitting efficient searches. An alternative shape characterization method that reduces computational overhead in the construction phase is discussed. The algorithms are tested on a set of 10 063 wide-field survey images, with fields-of-view up to 4.8 x 3.6 deg, successfully matching 100% of the images in a mean elapsed time of 6 ms (2.4 GHz Athlon CPU). The elapsed time of the searching phase is shown to vary by less than 1 ms for list sizes between 10 and 200 points, demonstrating that fast, robust searches may be completed in nearly constant time, independent of list size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。