Multi Frequency Analysis of Scattering Matrix and Scattering Power Matrix for Marine Vessels Detection
Bibliographic record
Abstract
Independence of Synthetic Aperture Radar (SAR) images from weather and sun illumination helps us in maritime surveillance like an oil spill, to identify the illegal fishery activity and unauthorized marine vessels. Detection of marine vessels is like a point target detection in coarse to moderate resolution images. Detection of point targets is adversely affects by speckle noise. Object detection in SAR images, without explicitly reducing the speckle noise is one of the challenging task. In this paper two algorithms are presented, which show how improvement in the power of point target lead us to reduced number of false alarms. The first algorithm has three parts. First part uses Grave matrix, which is a ( 2×2) Hermitian power matrix, generated by the multiplication of Sinclair matrix and conjugate of Sinclair matrix. Second part uses discrimination criteria to discriminate between clutter and vessels based on eigenvalue of the Grave matrix (G). The third part, fill the gaps by using morphological dilation. The only difference between the first and the second algorithms is that, in the second algorithm we uses Sinclair matrix (S2) instead of Grave matrix. Both the algorithms tested on two full-polarization (HH, HV, VH, VV) datasets and the results show the importance of scattering power matrix (G) as compared to scattering matrix (S2) for point target detection. The first data set is of size 498*498 captured by AlOS-1 PALSAR L-band data, covering the coastal region of Singapore. The second data set is of size 472*472, covering the coast of Vancouver acquired in C-band by Radarsat-2.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".