Estimating trajectories of meteors: an observational Monte Carlo approach – I. Theory
Bibliographic record
Abstract
ABSTRACT It has recently been shown by Egal et al. that some types of existing meteor in-atmosphere trajectory estimation methods may be less accurate than others, particularly when applied to high-precision optical measurements. The comparative performance of trajectory solution methods has previously only been examined for a small number of cases. Besides the radiant, orbital accuracy depends on the estimation of pre-atmosphere velocities, which have both random and systematic biases. Thus, it is critical to understand the uncertainty in velocity measurement inherent to each trajectory estimation method. In this first of a series of two papers, we introduce a novel meteor trajectory estimation method that uses the observed dynamics of meteors across stations as a global optimization function and that does not require either a theoretical or an empirical flight model to solve for velocity. We also develop a 3D observational meteor trajectory simulator that uses a meteor ablation model to replicate the dynamics of meteoroid flight, as a means to validate different trajectory solvers. We both test this new method and compare it to other methods, using synthetic meteors from three major showers spanning a wide range of velocities and geometries (Draconids, Geminids, and Perseids). We determine which meteor trajectory solving algorithm performs better for all-sky, moderate field-of-view, and high-precision narrow-field optical meteor detection systems. The results are presented in the second paper in this series. Finally, we give detailed equations for estimating meteor trajectories and analytically computing meteoroid orbits, and provide the python code of the methodology as open-source software.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".