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

August 27, 2018 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Glenn Galvizo, Lipyeow Lim arXiv ID 1808.08686 Category cs.DS: Data Structures & Algorithms Citations 1 Venue arXiv.org Last Checked 4 months ago
Abstract
The process of identifying stars is integral toward stellar based orientation determination in spacecraft. Star identification involves matching points in an image of the sky with stars in an astronomical catalog. A unified framework for identification was created and used to analyze six variations of methods based on their approach to star set identification, obtaining a single image to catalog star set match, and uniquely mapping each star in a image star set to a catalog star set. Each method was presented an artificial image, and aspects that were interchangeable among each process were normalized. Given an image with false stars, the Pyramid method has the highest average accuracy and is the fastest of the six. Given an image where each star's true position is distributed randomly (Gaussian noise), the Spherical Triangle method's accuracy is the least sensitive.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted