Multiple Detection-Aided Low-Observable Track Initialization Using ML-PDA
Bibliographic record
Abstract
In low signal-to-noise ratio or heavy clutter environments, target track initialization is a challenging task. The maximum likelihood probabilistic data association (ML-PDA) algorithm has been demonstrated to be effective in dealing with this issue. In practical scenarios, multiple signals from one target via different propagation paths can be detected in a scan. Signals from different propagation paths convey useful information and can improve track initialization performance. However, the conventional ML-PDA algorithm assumes that a target can generate at most one detection per scan. That is, it cannot handle multiple target-originated measurements per scan correctly, nor take full advantage of the additional information contained in those seemingly extraneous returns. In this paper, a multiple-detection ML-PDA (MD-ML-PDA) estimator is proposed to rectify this shortcoming. The proposed estimator exploits the additional information available in all measurements by considering the combinatorial events of association that are formed from MD patterns. It is capable of handling the possibility of multiple target-originated measurements per scan with less-than-unity detection probability for various paths in the presence of clutter. The proposed MD-ML-PDA estimator is applied to a simulated sonar target tracking scenario. The same algorithm can be used on other angle-only tracking problems as well. Results show that MD-ML-PDA can effectively handle multiple target-originated measurements and yield improved track initialization performance over the traditional single detection ML-PDA. The Cramer-Rao lower bound for MD track initialization is also derived.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 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".