2006/09/25 by Andras Pal, András Pál, G. Á. Bakos +1 · 4 citations
Engineering · Mathematics · Physics and Astronomy · #Algorithm #Astrometry #Astronomical Observations and Instrumentation #Computer science #Computer vision #Delaunay triangulation #Field (mathematics) #Geometry #Matching (statistics) #Mathematics #Nonlinear system #Physics #Point (geometry) #Robotics and Sensor-Based Localization #Software #Stars #Statistics #Stellar, planetary, and galactic studies #Triangulation #astro-ph
paper · pdf · doi:10.1086/508573
Comments: accepted for publication in PASP (9 pages, 5 figures); see http://www.hatnet.hu/software (www.hatnet.hu/software) for software
arxiv created 2006/09/25 · openalex publication_date 2006/10/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present a robust and fast algorithm for performing astrometry and source cross‐identification on lists of two‐dimensional points, such as between a catalog and an astronomical image, or between two images. The method is based on minimal assumptions: the lists can be rotated, magnified, and inverted with respect to each other in an arbitrary way. The algorithm is tailored to work efficiently on wide fields with a large number of sources and significant nonlinear distortions, as long as the distortions can be approximated with linear transformations locally over the scale length of the average distance between the points. The procedure is based on symmetric point matching in a newly defined continuous triangle space that consists of triangles generated by extended Delaunay triangulation. Our software implementation performed at the 99.995% success rate on ∼260,000 frames taken by the HATNet project.