Star identification is one of the most important stages in attitude determination with star trackers. This can be performed using matching algorithms between observed stars and a master star catalogue. The main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the space. In this article, an identification algorithm based on a geometric voting scheme is presented. In this algorithm a pair of stars in the catalogue votes for a pair of stars in the image if angular distance between the stars of both pairs is similar. As angular distance is a symmetric relationship, each of the two catalogue stars votes for each of the image stars. The identity of each star in the image is set to the identity of the catalogue star which cast the most votes. Applying the algorithm in different attitudes and with different optical system parameters shows its high performance in star identification in our simulations.
Hamidi,M. and Samadzadegan,F. (2019). A star identification algorithm based on a voting scheme for star trackers. Iranian Journal of Physics Research, 14(1), 89-105.
MLA
Hamidi,M. , and Samadzadegan,F. . "A star identification algorithm based on a voting scheme for star trackers", Iranian Journal of Physics Research, 14, 1, 2019, 89-105.
HARVARD
Hamidi M., Samadzadegan F. (2019). 'A star identification algorithm based on a voting scheme for star trackers', Iranian Journal of Physics Research, 14(1), pp. 89-105.
CHICAGO
M. Hamidi and F. Samadzadegan, "A star identification algorithm based on a voting scheme for star trackers," Iranian Journal of Physics Research, 14 1 (2019): 89-105,
VANCOUVER
Hamidi M., Samadzadegan F. A star identification algorithm based on a voting scheme for star trackers. Dear user; Recently we have changed our software to Sinaweb. If you had already registered with the old site, you may use the same USERNAME but you need to change your password. To do so at the first use, please choose, 2019; 14(1): 89-105.
