A Star Identification Graph Algorithm Based on Angular Distance Matching Score Transfer

The successful identification of stars is a fundamental prerequisite for satellite attitude determination by star sensors. Conventional star identification algorithms typically construct specific subgraphs using a set of bright stars or generate patterns based on angular distances between stars and their neighboring stars. However, these methods often fail when insufficient detectable stars or bright non-cooperative space objects are in the field of view. Seldom studies use angular distance matching among all stars for direct identification as it is complex to calculate and store. To solve the problem, we proposed a graph algorithm based on angular distance matching score transfer, which utilizes a graph data structure where nodes store angular distance matching scores between stars and transfer scores through graph edge weights, overcoming the limitations of incomplete utilization of angular distance matching results. We also established a math model for edge weights based on the probabilities of star pair occurrences. Simulation tests and night sky image experiments demonstrate the robustness of this algorithm against position errors, brightness errors, and fake stars. By equally using information from all sensor stars, even in cases with multiple missing stars, numerous fake stars, and extremely bright interfering stars, the identification rate remains consistently above 99.53%. This algorithm represents a highly robust star identification method and lays the foundation for future research in intelligent sensing of space environmental objects using star sensors.