Sectoring Approach for Performance Enhancement of MTT and Its Application on JPDA Algorithm
Bibliographic record
Abstract
Recent advancements in multi-target tracking (MTT) technologies and algorithms have led to improved accuracy and efficiency in tracking multiple objects in dynamic environments. However, as the number of targets increases, MTT methods often struggle with computational demands and tracking capacity. This paper presents a novel sectoring approach on the Joint Probabilistic Data Association (JPDA) algorithm to enhance its tracking performance in MTT scenarios. The sectoring method divides the tracking area into distinct sectors and assigns a separate JPDA tracker for each sector, yielding two primary benefits in environments with large numbers of targets. First, it increases the capacity of the JPDA tracker to handle a larger number of targets. Second, it reduces computational complexity when tracking a high number of targets. On the other hand, the approach introduces a trade-off by slightly increasing computational complexity in scenarios with fewer targets. Experimental results were obtained through simulations of 10 different scenarios, each with 37 varying numbers of targets and three different sector configurations, amounting to a total of 1110 simulations. The findings demonstrate that the sectoring approach achieves up to a 95% reduction in computational complexity and increases the number of tracked targets from 24 to 40 in randomly generated scenarios. Results also revealed that the effects of the sectoring approach become more pronounced as the number of sectors increases.
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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".