|
Server : Apache/2.4.62 System : FreeBSD fbsdweb2.web.rcn.net 14.1-RELEASE FreeBSD 14.1-RELEASE releng/14.1-n267679-10e31f0946d8 GENERIC amd64 User : www ( 80) PHP Version : 8.3.8 Disable Function : NONE Directory : /domains/astrosfm/AAS_meetings/1999_winter/abstracts/ |
Upload File : |
<h2>AAS 99-181</h2> <h2>A New Algorithm for Star Pattern Recognition </h2> <h4>D. Mortari </h4> Universita' degli Studi "La Sapienza" di Roma <h2> Abstract </h2> A new star identification, based on the fact that any star direction C can be expressed as a linear combination of two given directions (A and B) and their cross product (AxB), is presented. Stars observed are expressed as a function of two reference stars, A and B. This relationship, within the instrument precision, can also be written in the inertial reference system. Using the K-vector technique, a subset of inertial star pair matching the observed A and B, is selected. For each entry two inertial directions (V' and V") for C are evaluated. The problem becomes to identify the inertial star closest to V' (and V"), which is solved again using the K-vector technique applied to the star components. The Star is identified if there is only one star which satisfies the requirements. This procedure, which is then repeated for any other star observed, yields the complete star pattern recognition. The described method is able toidentify and discard spikes and it is compared with the Search-Less Algorithm. Plots show both the algorithm speed and robustness.