2009
DOI: 10.1117/1.3269686
|View full text |Cite
|
Sign up to set email alerts
|

Flower algorithm for star pattern recognition in space surveillance with star trackers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…Two sets of simulations were devised and executed to validate the performance of the recognition approach. Because of the influence of the space environment and the star sensor system itself [28,30], background noise in a star sensor is inevitable. It is difficult to construct a precise model that accounts for background noise because a variety of sources contribute to this noise.…”
Section: Simulation Of Target Recognition and Discussionmentioning
confidence: 99%
“…Two sets of simulations were devised and executed to validate the performance of the recognition approach. Because of the influence of the space environment and the star sensor system itself [28,30], background noise in a star sensor is inevitable. It is difficult to construct a precise model that accounts for background noise because a variety of sources contribute to this noise.…”
Section: Simulation Of Target Recognition and Discussionmentioning
confidence: 99%
“…This identification strategy requires additional checking to preserve integrity. A log-polar transforming-based star pattern was introduced in [15], while a star pattern called flower code was presented in [16]. These patterns are less efficient than others because of their cyclic dynamic match step.…”
Section: Index Termsmentioning
confidence: 99%
“…In addition, the star sensor's sensitivity calibration error may bring in star magnitude noise. Most algorithms [6,[22][23][24][25][26] test their robustness by adding pixel and magnitude noise on the star image. In this paper, we still adopt this way to test the robustness of our algorithm.…”
Section: Simulation and Analysismentioning
confidence: 99%