Multisensor-multitarget bias estimation for general asynchronous sensors
Bibliographic record
Abstract
A novel solution is provided for the bias estimation problem in multiple asynchronous sensors using common targets of opportunity. The decoupling between the target state estimation and the sensor bias estimation is achieved without ignoring or approximating the crosscovariance between the state estimate and the bias estimate. The target data reported by the sensors are usually not time-coincident or synchronous due to the different data rates. Since the bias estimation requires time-coincident target data from different sensors, a novel scheme is used to transform the measurements from the different times of the sensors into pseudomeasurements of the sensor biases with additive noises that are zero-mean, white, and with easily calculated covariances. These results allow bias estimation as well as the evaluation of the Cramer-Rao lower bound (CRLB) on the covariance of the bias estimate, i.e., the quantification of the available information about the biases in any scenario. Monte Carlo simulation results show that the new method is statistically efficient, i.e., it meets the CRLB. The use of this technique for scale and sensor location biases in addition to the usual additive biases is also presented.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".