Please use this identifier to cite or link to this item:
Title: An autonomous star recognition algorithm with optimized database
Authors: Chen, Shoushun
Pham, Minh Duc
Low, Kay-Soon
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2013
Source: Pham, M. D., Low, K.-S., & Chen, S. (2013). An autonomous star recognition algorithm with optimized database. IEEE transactions on aerospace and electronic systems, 49(3), 1467-1475.
Series/Report no.: IEEE transactions on aerospace and electronic systems
Abstract: A novel star pattern recognition algorithm is presented for satellite attitude determination in the "lost in space" mode. The proposed method improves the speed in searching a large star catalogue by arranging it using a search tree data structure. The algorithm also processes the star image at grid level instead of pixel level to further improve the processing time. The experimental results show that the proposed approach significantly reduces the average run-time by 50% as compared with the conventional methods while still achieving slightly better star recognition accuracy at 95.07%.
ISSN: 0018-9251
DOI: 10.1109/TAES.2013.6557999
Rights: © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
Autonomous star recognition-.pdf330.98 kBAdobe PDFThumbnail

Citations 10

Updated on Nov 28, 2022

Web of ScienceTM
Citations 10

Updated on Dec 3, 2022

Page view(s) 10

Updated on Dec 6, 2022

Download(s) 5

Updated on Dec 6, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.