Cross-Domain Submesoscale Eddy Detection Neural Network for HF Radar
Bibliographic record
Abstract
With the rapid development of deep learning, the neural network becomes an efficient approach for eddy detection. However, previous work employs a traditional neural network with a focus on improving the detecting accuracy only using limited data under a single scenario. Meanwhile, the experience of detecting eddies from one experiment is not directly inherited from the detection model for other experiments. Therefore, a cross-domain submesoscale eddy detection neural network (CDEDNet) based on the high-frequency radar (HFR) data of the Nansan and Xuwen region is proposed in this paper. Firstly, a fundamental deep eddy detection architecture CDEDNet-0 is constructed with a fully convolutional network (FCN). Secondly, for solving the problem of insufficient labeled eddy data, an instance-based domain adaption method is adopted in CDEDNet-1 to increase training samples. Thirdly, for tackling the problem of unable to inherit previous detection experience, parameter-based transfer learning is incorporated in CDEDNet-2 for multi-scene eddy detection. The experiment results demonstrate CDEDNet-1 and CDEDNet-2 perform better than CDEDNet-0 in terms of accuracy. Meanwhile, eddy characteristics including eddy type, radius, occurring time, merger, and dynamic trajectory are analyzed for the Nansan and Xuwen regions.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".