Bias estimation for practical distributed multiradar-multitarget tracking systems
Bibliographic record
Abstract
Bias estimation or sensor registration is an essential step in ensuring the accuracy of global tracks in multisensor-multitarget tracking. Most algorithms previously proposed for bias estimation rely on local measurements in centralized systems or tracks in distributed systems, along with additional information like covariances, filter gains or targets of opportunity. In addition, it is generally assumed that such data are made available to the fusion center at every sampling time. In real distributed multisensor tracking systems, where each platform sends locals tracks to the fusion center, only state estimates and, perhaps, their covariances are sent to the fusion center at non-consecutive sampling instants or scans. That is, not all the information required for exact bias estimation, at the fusion center is available in practical distributed tracking systems. In this paper, a new algorithm that is capable of accurate bias estimation even in the absence of filter gain information from local platforms, is proposed for distributed tracking systems with irregular track transmission rates. It is shown that the performance of the new algorithm, which uses the tracklet idea and does not require track transmission at every sampling time or exchange of filter gains, can approach the performance of the exact bias estimation algorithm that requires local filter gains.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".