SUBOPTIMAL DATA ASSOCIATION TECHNIQUE FOR MULTIPLE-TARGET TRACKING IN DENSE CLUTTER ENVIRONMENT
Bibliographic record
Abstract
In multiple target tracking (MTT) systems that track targets with less-than-unity probabilityof detection in the presence of false alarms (FA), data association is very important. Dataassociation is responsible for deciding which of the received multiple measurements shouldupdate which track. Some data association techniques use a unique pairing to update a track;i.e. at most one observation is used to update a track. An alternative approach is to use all ofthe validated measurements with different weights (probabilities), known as probabilistic dataassociation (PDA). Due to the increase in the FA rate or low probability of target detection,most of the data association algorithms begin to fail. In this paper, we introduce a newsuboptimal PDA technique for MTT in dense clutter environment. The proposed technique isbased on merging the probabilistic nearest-neighbor filter (PNNF) with the PDA algorithm.The main idea is based on high-weighting the measurements that has minimum statisticaldistance from the predicted position of the target. The state updating equation in Kalman filteruses the combined innovation as in Joint Probabilistic Data Association method which isdefined as the weighted sum of the residuals associated with many observations. Due to itssimplicity in calculations and robustness, this technique can be used for real-time applicationseven though in dense clutter environments. We applied the proposed algorithm in trackingmultiple targets in presence of various clutter densities. Results showed better performancewhen compared to Nearest-Neighbor and All-Neighbors approaches in different clutterdensities and noise measurements.
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 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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".