An Efficient and Robust Star Identification Algorithm Based on Neural Networks
A lost-in-space star identification algorithm based on a one-dimensional Convolutional Neural Network (1D CNN) is proposed. The lost-in-space star identification aims to identify stars observed with corresponding catalog stars when there is no prior attitude information. With the help of neural netw...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/efd8c16042194ebcb92e56406e4c12ee |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | A lost-in-space star identification algorithm based on a one-dimensional Convolutional Neural Network (1D CNN) is proposed. The lost-in-space star identification aims to identify stars observed with corresponding catalog stars when there is no prior attitude information. With the help of neural networks, the robustness and the speed of the star identification are improved greatly. In this paper, a modified log-Polar mapping is used to constructed rotation-invariant star patterns. Then a 1D CNN is utilized to classify the star patterns associated with guide stars. In the 1D CNN model, a global average pooling layer is used to replace fully-connected layers to reduce the number of parameters and the risk of overfitting. Experiments show that the proposed algorithm is highly robust to position noise, magnitude noise, and false stars. The identification accuracy is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>98.1</mn><mo>%</mo></mrow></semantics></math></inline-formula> with 5 pixels position noise, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>97.4</mn><mo>%</mo></mrow></semantics></math></inline-formula> with 5 false stars, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>97.7</mn><mo>%</mo></mrow></semantics></math></inline-formula> with 0.5 Mv magnitude noise, respectively, which is significantly higher than the identification rate of the pyramid, optimized grid and modified log-polar algorithms. Moreover, the proposed algorithm guarantees a reliable star identification under dynamic conditions. The identification accuracy is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>82.1</mn><mo>%</mo></mrow></semantics></math></inline-formula> with angular velocity of 10 degrees per second. Furthermore, its identification time is as short as 32.7 miliseconds and the memory required is about 1920 kilobytes. The algorithm proposed is suitable for current embedded systems. |
|---|