Probabilistic Data Association Techniques for Target Tracking in Clutter
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.
Bibliographic record
Abstract
In tracking targets with less-than-unity probability of detection in the presence of false alarms (FAs), data association-deciding which of the received multiple measurements to use to update each track-is crucial. Most algorithms that make a hard decision on the origin of the true measurement begin to fail as the FA rate increases or with low observable (low probability of target detection) maneuvering targets. Instead of using only one measurement among the received ones and discarding the others, an alternative approach is to use all of the validated measurements with different weights (probabilities), known as probabilistic data association (PDA). This paper presents an overview of the PDA technique and its application for different target tracking scenarios. First, it describes the use of the PDA technique for tracking low observable targets with passive sonar measurements. This target motion analysis is an application of the PDA technique, in conjunction with the maximum-likelihood approach, for target motion parameter estimation via a batch procedure. Then, the PDA technique for tracking highly maneuvering targets and for radar resource management is illustrated with recursive state estimation using the interacting multiple model estimator combined with PDA. Finally, a sliding window (which can also expand and contract) parameter estimator using the PDA approach for tracking the state of a maneuvering target using measurements from an electrooptical sensor is 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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it