MétaCan
Menu
Back to cohort
Record W2006060813 · doi:10.1117/12.542272

<title>Multisensor-multitarget bias estimation of asynchronous sensors</title>

2004· article· en· W2006060813 on OpenAlexaff
Xiangdong Lin, Yaakov Bar‐Shalom, Thiagalingam Kirubarajan

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2004
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcMaster University
Fundersnot available
KeywordsCramér–Rao boundComputer scienceAsynchronous communicationCovarianceAlgorithmMonte Carlo methodUpper and lower boundsOffset (computer science)Estimation theoryStatisticsMathematicsTelecommunications

Abstract

fetched live from OpenAlex

This paper provides the exact solution for the bias estimation problem in multiple asynchronous sensors using common targets of opportunity. The target data reported by the sensors are usually not time-coincident or synchronous due to the different sampling times. We consider here the case when the sensors obtain the measurements at the same rate but with a phase difference. 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 biases in addition to the usual additive (offset) 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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.002

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.

Opus teacher head0.014
GPT teacher head0.230
Teacher spread0.216 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations14
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207