.png){kind=icon}
.png){kind=icon}
Return
Research on Partitioning Algorithm Based on Dynamic Star Simulator Guide Star Catalog
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3070408.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The simulated star map generated by the dynamic star simulator cannot meet the current demand for calibration of the star map recognition rate of the star sensor due to the huge amount of guide star catalog data and the slow retrieval process. This paper proposes the guide star equipartition method, which makes the constant number of each sub-region of the guide star catalog basically the same. This method first divides the declination at equal intervals through the field of view of the dynamic star simulator, and then determines the interval of the right ascension by the average number of stars with magnitude Mv that can be photographed in the field of view of the star sensor. The SAO (Smithsonian Astrophysical Observatory) catalog containing 5103 stars in the whole celestial sphere is divided into 452 sub-areas by the average number of guide stars. After the division, the guide star retrieval time is about 8ms, and the refresh rate of the simulated star map is increased by more than three times. The real-time requirements of the dynamic star simulator have been improved. Based on this, a star map simulation software is designed, which can realize the division of star catalogs with different fields of view and different magnitude thresholds.
Keywords:
Heuristic algorithms
Partitioning algorithms
Aerodynamics
Space vehicles
Brightness
Space missions
Sensitivity
Aerospace simulation
image sensor
algorithms
optical sensor
high-resolution imaging
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W