An Adaptive Contextual SEM Algorithm for Urban Land Cover Mapping Using Multitemporal High-Resolution Polarimetric SAR Data
Bibliographic record
Abstract
This paper presents a semi-supervised Stochastic Expectation-Maximization (SEM) algorithm for detailed urban land cover mapping using multitemporal high-resolution polarimetric SAR (PolSAR) data. By applying an adaptive Markov Random Field (MRF) with the spatially variant Finite Mixture Model (SVFMM), spatial-temporal contextual information could be effectively explored to improve the mapping accuracy with homogenous results and preserved shape details. Further, a learning control scheme was proposed to ensure a robust semi-supervised mapping process thus avoiding the undesired class merges. Four-date RADARSAT-2 polarimetric SAR data over the Greater Toronto Area were used to evaluate the proposed method. Common PolSAR distribution models such as Wishart, G0p, Kp and KummerU were compared through this contextual SEM algorithm for detailed urban land cover mapping. Comparisons with Support Vector Machine (SVM) were also conducted to assess the potential of our parametric approach. The results show that the Kp, G0p and KummerU models could generate better urban land cover mapping results than the Wishart model and SVM.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".