MétaCan
Menu
Back to cohort
Record W2083468814 · doi:10.1109/acssc.2001.987696

IMM-JVC and IMM-JPDA for closely maneuvering targets

2001· article· en· W2083468814 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 institutionsLockheed Martin (Canada)McGill University
Fundersnot available
KeywordsComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

Efficient and reliable multiple target tracking methods require the use of sophisticated data association as well as positional estimation algorithms. Two different approaches can be employed in the development of an assignment strategy for data association. This paper presents a comparative study of two assignment alternatives, namely the JVC (unique association of a measurement to an existing track) and JPDA (nonunique association of a measurement to an existing track) algorithms. The above assignment strategies are then both combined with an interacting multiple model (IMM) positional estimator, and the respective tracking performance of the IMM-JVC and IMM-JPDA algorithms is evaluated using two critical scenarios involving a pair of closely maneuvering targets.. An analysis of the simulation results is carried out, permitting for a comparison of the JVC and JPDA association algorithms, which ultimately demonstrates the superiority of the IMM-JVC algorithm.

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.723
Threshold uncertainty score0.531

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.0000.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.016
GPT teacher head0.239
Teacher spread0.223 · 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