k-d匹配:一种剪切恒星样本的快速匹配算法
k-d Match: A Fast Matching Algorithm for Sheared Stellar Samples
摘要:
本文提出了一种新的有效的恒星星表匹配算法,其中两个catalagoues的坐标系之间的转换是未知的,可能包括剪切。在第二个目录中从第一个目录中找到一个给定的对象,无论是恒星还是天体,在时间上都是对数的,而不是多项式的,相对于简单的实现,这产生了显着的速度。匹配算法的加速和解决任意仿射变换的能力不仅将允许现在不可能使用的恒星目录和图像的配准,而且还将在机器视觉和其他成像应用中找到应用。
英文摘要:
This paper presents new and efficient algorithms for matching stellar catalogues where the transformation between the coordinate systems of the two catalagoues is unknown and may include shearing. Finding a given object whether a star or asterism from the first catalogue in the second is logarithmic in time rather than polynomial, yielding a dramatic speed up relative to a naive implementation. Both acceleration of the matching algorithm and the ability to solve for arbitrary affine transformations not only will allow the registration of stellar catalogues and images that are now impossible to use but also will find applications in machine vision and other imaging applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。