Track Quality Based Multitarget Tracking Approach for Global Nearest-Neighbor Association
Bibliographic record
Abstract
In multitarget tracking, in addition to the problem of measurement-to-track association, there are decision problems related to track confirmation and termination. In general, such decisions are taken based on the total number of measurement associations, length of no association sequence, and total lifetime of the track in question. For a better utilization of available information, confidence of the tracker on a particular track can be used. This quantity can be computed using the measurement-to-track association likelihoods corresponding to the particular track, target detection probability for the sensor-target geometry, and false alarm density. A track quality measure is proposed here for assignment-based global nearest neighbor (GNN) trackers. It can be noted that to compute track quality measure for assignment-based data association one needs to consider different detection events than those considered for computation of the track quality measures available in the literature, which are designed for probabilistic data association (PDA) based trackers. In addition to the proposed track quality measure, a multitarget tracker based on it is developed, which is particularly suitable in scenarios with temporarily undetectable targets. In this work, tracks are divided into three sets based on their quality and measurement association history: initial tracks, confirmed tracks, and unobservable tracks. Details of the update procedures of the three track sets are provided. The results show that discriminating tracks on the basis of their track quality can lead to longer track life while decreasing the average false track length.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".