Unconstrained underwater multi-target tracking in passive sonar systems using two-stage PF-based technique
Bibliographic record
Abstract
A robust particle filter (PF)-based multi-target tracking solution for passive sonar systems able to track an unknown time-varying number of multiple targets, while keeping continuous tracks of such targets, is presented in this article. PF is a nonlinear filtering technique that can accommodate arbitrary sensor characteristics, motion dynamics and noise distributions. An enhanced version of PF is employed and is called Mixture PF. The commonly used sampling/importance resampling PF samples from the prior importance density, while Mixture PF samples from both the prior and the observation likelihood. In order to be able to track an unknown time-varying number of multiple targets, two Mixture PFs are used, one for target detection and the other for tracking multiple targets, and a density-based clustering technique is used after the first filter. This article demonstrates the applicability of the proposed technique for the passive problem, which suffers from the lack of measurements and the small detection range of the buoys, especially for weak signals. A contact-level simulation was used to generate different scenarios and the performance of the proposed technique called Clustered-Mixture PF was examined with either bearing measurement only or bearing and Doppler measurements, and it demonstrated its high performance.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".