MétaCan
Menu
Back to cohort
Record W2100004375 · doi:10.1109/radar.2006.1631801

A Real-Time Multiple Target Tracking Algorithm using Merged Probabilistic Data Association Technique and Smoothing Particle Filter

2006· article· en· W2100004375 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 institutionsUniversity of Calgary
Fundersnot available
KeywordsClutterSmoothingProbabilistic logicTracking (education)Computer scienceParticle filterAlgorithmFilter (signal processing)Data associationRadar trackerArtificial intelligenceComputer visionRadarTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we present a tracking system that combines the merged probabilistic data association (MPDA) technique together with the smoothing particle filter to track multiple targets. The MPDA approach combines the probabilistic nearest-neighbor filter (PNNF) together with the probabilistic data association (PDA) approach, in the data association step, to track multiple targets in dense clutter environment. Due to the high uncertainty when applying a particle filter to track a maneuverable target, the smoothing particle filter is used. Results show that combining MPDA together with smoothing particle filter can achieve a robust and real-time tracking system for tracking multiple targets even in dense clutter environment.

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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.952
Threshold uncertainty score0.711

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0010.001
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.028
GPT teacher head0.255
Teacher spread0.227 · 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