An autonomous star identification algorithm is described in this study. This algorithm iteratively determines a catalog star, the distances of which to its neighbors are similar to those of a given sensor star and its neighboring stars, until a unique match is found. In each iteration, only the catalog stars that receive sufficient votes are used in the subsequent steps. We also develop a useful probabilistic model for performance prediction and evaluation. Analysis indicates that spurious star pairings are decreased exponentially after each iteration. The simulation and real sky image results show that the proposed approach is more robust than conventional algorithms and requires fewer resources.
Iterative algorithm for autonomous star identification
IEEE Transactions on Aerospace and Electronic Systems ; 51 , 1 ; 536-547
2015-01-01
982163 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A Grid Algorithm for Autonomous Star Identification
Online Contents | 1997
|A grid algorithm for autonomous star identification
IEEE | 1997
|An All-Sky Autonomous Star Map Identification Algorithm
Online Contents | 2004
|An all-sky autonomous star map identification algorithm
IEEE | 2004
|