Array shape estimation and tracking using active sonar reverberation
Bibliographic record
Abstract
This paper concerns the problem of array shape estimation and tracking for towed active sonar arrays, using received reverberation returns from a single transmitted CW pulse. Uniform linear arrays (ULAs) deviate from their nominal geometry while being towed due to ship maneuvers as well as ocean currents. In such scenarios, conventional beamforming performed under the assumption of a ULA can sometimes lead to unacceptably high spatial sidelobes. The reverberation leaking through the sidelobes can potentially mask weak targets in Doppler, especially when the target Doppler is close to that of the mainlobe reverberation and the reverberation-to-target ratio (RTR) is very high. Although heading sensors located along the array can be used to provide shape estimates, they may not be sufficiently available or accurate to provide the required sidelobe levels. We propose an array shape calibration algorithm using multipath reverberation returns from each ping as a distributed source of opportunity. More specifically, a maximum likelihood (ML) array shape calibration algorithm is developed, which exploits a deterministic relationship between the reverberation spatial and Doppler frequencies causing it to be low rank in the space-time vector space formed across a single coherent processing interval (CPI). In this application, a sequence of overlapped CPI length snapshots of duration less than the CW pulse is used. The ML estimates obtained for each snapshot are tracked using a Kalman filter with a state equation corresponding to the water pulley model for array dynamics. Simulations performed using real heading sensor data in conjunction with simulated reverberation suggest that 8-10 dB improvement in sidelobe level may be possible using the proposed array shape tracking algorithm versus an algorithm that uses only the available heading information.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".