Non-dimensional Star-Identification

03/30/2020
by   Carl Leake, et al.
0

This study introduces a new "Non-Dimensional" star identification algorithm to reliably identify the stars observed by a wide field-of-view star tracker when the focal length and optical axis offset values are known with poor accuracy. This algorithm is particularly suited to complement nominal lost-in-space algorithms when they fail the star identification due to focal length and/or optical axis offset deviations from their nominal operational ranges. These deviations may be caused, for example, by launch vibrations or thermal variations in orbit. The algorithm performance is compared in terms of accuracy, speed, and robustness to the Pyramid algorithm. These comparisons highlight the clear advantages that a combined approach of these methodologies provides.

READ FULL TEXT

page 9

page 10

page 11

research
08/27/2018

Empirical Analysis of Common Subgraph Isomorphism Approaches to the Lost-in-Space Star Identification Problem

The process of identifying stars is integral toward stellar based orient...
research
12/03/2019

Approximating Star Cover Problems

Given a metric space (F ∪ C, d), we consider star covers of C with balan...
research
06/27/2019

Remark on Algorithm 680: evaluation of the complex error function: Cause and Remedy for the Loss of Accuracy Near the Real Axis

In this remark we identify the cause of the loss of accuracy in the comp...
research
12/07/2018

Star Tracking using an Event Camera

Star trackers are primarily optical devices that are used to estimate th...
research
05/04/2018

Coloring even-hole-free graphs with no star cutset

A hole is a chordless cycle of length at least 4. A graph is even-hole-f...
research
10/02/2022

ROSIA: Rotation-Search-Based Star Identification Algorithm

Solving the star identification (Star-ID) problem with a rotation-search...

Please sign up or login with your details

Forgot password? Click here to reset