IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v72y2018i1d10.1007_s10898-018-0653-y.html
   My bibliography  Save this article

A new algorithm for the small-field astrometric point-pattern matching problem

Author

Listed:
  • Cláudio P. Santiago

    (Lawrence Livermore National Laboratory)

  • Carlile Lavor

    (University of Campinas (IMECC - UNICAMP))

  • Sérgio Assunção Monteiro

    (UFRJ - Federal University of Rio de Janeiro)

  • Alberto Kroner-Martins

    (SIM - Universidade de Lisboa)

Abstract

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.

Suggested Citation

  • Cláudio P. Santiago & Carlile Lavor & Sérgio Assunção Monteiro & Alberto Kroner-Martins, 2018. "A new algorithm for the small-field astrometric point-pattern matching problem," Journal of Global Optimization, Springer, vol. 72(1), pages 55-70, September.
    • Handle: RePEc:spr:jglopt:v:72:y:2018:i:1:d:10.1007_s10898-018-0653-y
    DOI: 10.1007/s10898-018-0653-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0653-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-018-0653-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Phil Duxbury & Carlile Lavor & Leo Liberti & Luiz Leduino Salles-Neto, 2022. "Unassigned distance geometry and molecular conformation problems," Journal of Global Optimization, Springer, vol. 83(1), pages 73-82, May.
    2. Simon J. L. Billinge & Phillip M. Duxbury & Douglas S. Gonçalves & Carlile Lavor & Antonio Mucherino, 2018. "Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures," Annals of Operations Research, Springer, vol. 271(1), pages 161-203, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:72:y:2018:i:1:d:10.1007_s10898-018-0653-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.