SSCV-GANs: Semi-Supervised Complex-Valued GANs for PolSAR Image Classification
Bibliographic record
Abstract
Polarimetric synthetic aperture radar (PolSAR) image classification has been widely applied in many fields, such as agriculture, meteorology and military. However, some problems, such as the deficiency of labeled data and the underutilization of data information, are always the challenges that can not be ignored in PolSAR image classification. In this paper, a semi-supervised complex-valued generative adversarial networks (SSCV-GANs) is proposed for the first time to address the two issues mentioned above simultaneously. On the one hand, the complex-valued model conforms with the physical mechanism of PolSAR data and it plays an important role for retaining and utilizing amplitude and phase information of PolSAR data. On the other hand, we also present a new complex-valued GANs together with semi-supervised learning to alleviate the problem of insufficient labeled data. Specifically, our complex-valued GANs expands the training data set by generating fake data. Flevoland data and San Francisco data are used to validate the effectiveness of our model. Experimental results show that our model outperforms existing state-of-the-art models in terms of classification accuracy, especially for conditions with fewer labeled data. In particular, the analysis of the statistical distribution of the generated fake data and the real data further demonstrate the effectiveness of the proposed SSCV-GANs.
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.002 |
| 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.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".