<title>Data association combined with the probability hypothesis density filter for multitarget tracking</title>
Bibliographic record
Abstract
Multiple target tracking requires data association that operates in conjunction with filtering. When multiple targets are closely spaced, the conventional approach (MHT/assignment) may not give satisfactory results. This is mainly because of the difficulty in deciding what the number of targets is. Recently, the probability hypothesis density (PHD) filter, which propagates the PHD or the first moment instead of the full multitarget posterior density, was proposed. In this approach, the integral of the PHD over a region in the state space is the expected number of targets within this region and the peaks in the PHD can be regarded as the estimated locations of the targets at a given time step. In this approach the data association problem is not considered, i.e., the PHD is obtained only for a frame at a time. In our paper, a data association method combined with the PHD approach is proposed for multitarget tracking, i.e., we keep a separate tracker for each target, use the PHD filter to get the estimated number and locations of the targets at each time step, and then perform the "peak-to-track" association, whose results can provide information for PHD peak extraction at the next time step. Besides, by keeping a separate tracker for each target, our approach provides more information than the standard PHD filter. Using our approach, the multitarget tracking can be performed with automatic track initiation, maintenance, spawning, merging and termination. Simulation results demonstrate that our approach is computationally feasible and effective.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.094 | 0.066 |
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".