Entropy Metrics of Radar Signatures of Sea Surface Scattering for Distinguishing Targets
Bibliographic record
Abstract
This paper analyzes sea clutter by a random series without assuming the scattering being independent. We quantitated the complexity of sea clutter by applying multiscale sample entropy. We found that above certain wave heights or wind speeds, and for HH or VV polarization, the target can be distinguished from sea clutter by regarding (i) the sample entropy at large scale factors or (ii) the complexity index (CI) as entropy metrics. This is because the backscattering amplitudes of range bins with the primary target were found equipped with the lowest sample entropy at large scale factors or the lowest CI compared to that of range bins with sea clutter only. To further cover low-to-moderate sea states, we constructed a polarized complexity index (PCI) based on the polarization signatures of the multiscale sample entropy of sea clutter. We demonstrated that the PCI is yet another alternative entropy metric and can achieve a superb performance on distinguishing targets within 1993’s IPIX radar data sets. In each data set, the range bins with the primary target turned to have the lowest PCI compared to that of range bins with sea clutter alone. Moreover, in our experiment using 1993’s IPIX radar data sets, the PCIs of range bins with sea clutter only were almost the same and stable in each data set, further suggesting that the proposed PCI metric can be applied in the presence of no or multiple targets through proper fitting curves.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".