MétaCan
Menu
Back to cohort
Record W2543883930 · doi:10.1109/iecon.2002.1182812

Consistent fusion of correlated data sources

2003· article· en· W2543883930 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsCovariance intersectionKalman filterSensor fusionFusionIntersection (aeronautics)CovarianceComputer scienceEllipsoidFilter (signal processing)Extended Kalman filterTracking (education)AlgorithmFast Kalman filterArtificial intelligenceMathematicsComputer visionEngineeringStatistics

Abstract

fetched live from OpenAlex

The selection of the appropriate fusion algorithm depends on the underlying data fusion architecture. In the centralized scheme, the sources are known to be independent and the Kalman filter provides an optimal solution. Unfortunately, in the decentralized architecture, the sources become correlated and the Kalman filter cannot be applied. The covariance intersection method has been proposed as a solution to the problem of decentralized data fusion. However, it results in a decrease in performance. A new fusion algorithm (largest ellipsoid approach) that avoids both of the inconsistency of the Kalman filter and the lack of performance of the covariance intersection is proposed. The superiority of the proposed approach is illustrated using the target's tracking problem.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.873
Threshold uncertainty score0.243

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.044
GPT teacher head0.252
Teacher spread0.208 · 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