Improved multiframe association for tracking maneuvering targets
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
Data association is the crucial part of any multitarget tracking algorithm in a scenario with multiple closely spaced targets, low probability of detection and high false alarm rate. Multiframe assignment, which solves the data association problem as a constrained optimization, is one of the widely accepted methods to handle the measurement origin uncertainty. If the targets do not maneuver, then multiframe assignment with one or two frames will be enough to find the correct data association. However, more frames must be considered in the data association for maneuvering targets. Also, a target maneuver might be hard to detect when maneuvering index, which is the function of sampling time, is small. In this paper, we propose an improved multiframe data association with better cost calculation using backward multiple model recursion, which increases the maneuvering index. The effectiveness of the proposed algorithm is demonstrated with simulated data.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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