Thursday, April 4, 2013

1304.0838 (Jeremy S. Heyl)

k-d Match: A Fast Matching Algorithm for Stellar Samples    [PDF]

Jeremy S. Heyl
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. Both acceleration of the matching algorithm and the ability to solve for arbitrary affine transformation not only will allow the registeration of stellar catalogues and images that are now impossible to use but also will find applications in machine vision and other imaging applications.
View original:

No comments:

Post a Comment