A new algorithm for the small-field astrometric point-pattern matching problem
- 144 Downloads
The small-field astrometric point-pattern matching problem is a fundamental problem in astronomy, that although considered a long time ago still lacks a formal definition. It can be textually stated as: given two lists of positions of stars, find the common stars between these lists, taking into account rotation, translation, reflection and scaling operations. It is expected that there might be missing stars between the lists. In this work, we give the astronomical context, review some heuristic methods adopted in the literature, present distance matrix formulations for the problem and propose a new algorithm to solve it.
KeywordsDistance matrix Astronomy Astrometry Point-pattern matching
This work was performed under the auspices of the US Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. We also thank the support of the Brazilian Agencies CNPq, FAPESP, and FAPERJ. We would like to thank the anonymous reviewers for the helpful comments provided on earlier drafts of the manuscript.
- 1.Groombridge, S., Airy, G.B.: A Catalogue of Circumpolar Stars. BiblioBazaar, Charleston (2009)Google Scholar
- 9.Stetson, P.B.: The techniques of least squares and stellar photometry with CCDs. Vth IAG-USP Advanced School of Astrophysics (1989). http://nedwww.ipac.caltech.edu/level5/Stetson/Stetson5_2.html. Accessed Feb 2017