Advanced Sun-Sensor Processing and Design for Super-Resolution Performance
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We analyze the performance of conventional and parametric super-resolution algorithms for estimating sun position in a spacecraft sun-sensor. Widely employed in other applications, we examine whether parametric algorithms can increase sensor performance without affecting the cost of the sensor system. Using a simplified model of detector illumination our simulations provide quantitative comparisons of algorithm performance and assess how simple sensor redesigns will further improve the net system performance. The first set of tests evaluates the effect of increased noise on the performance of each algorithm for both narrow-or wide-pattern, and one- or two-slit detector illumination patterns. Our findings show that parametric algorithms display very good performance throughout the test regime, particularly when using wide-pattern illumination. Better than two-fold resolution improvements over high-accuracy traditional algorithms are observed in the presence of realistic system noise. Further tests establish that multiple-peak illumination patterns enhance resolution, while wide peaks generally are impairment. These mask-dependent improvements are observed in both of the parametric algorithms and one of the traditional algorithms
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it