A New Method for Land Cover Characterization and Classification of Polarimetric SAR Data Using Polarimetric Signatures
Bibliographic record
Abstract
Conventional methods for analyzing polarimetric synthetic aperture RADAR (PolSAR) data such as scattering matrix show polarimetric information just in a restricted number of polarization bases, whereas backscattering of the targets has information on wide range of polarizations. In order to solve this problem, polarimetric signatures have been investigated to have a better illustration of the target responses. Polarimetric signatures depict more details of physical information from target backscattering in various polarization bases. This paper presents a new method for generating polarimetric signatures for different features in PolSAR data by changing the polarization basis in the covariance matrix. Furthermore, various land cover classes were evaluated using their polarimetric signatures and the pattern recognition matching methods. On the basis of this background, an object-oriented and knowledge-based classification algorithm is proposed. The main idea of this method is to apply polarimetric signatures of various PolSAR features in the land cover classification. A Radarsat-2 image, acquired in leaf-off season of the forest areas, was chosen for this study. The backscattering from different classes, including six land cover classes: 1) red oak (Or); 2) white pine (Pw); 3) black spruce (Sb); 4) urban (Ur); 5) water (Wa); and 6) ground vegetation (GV) was analyzed by the proposed method. The results reported that the polarimetric signatures of PolSAR features introduce new concepts for the various targets which are different from the polarimetric power signatures. Also, the proposed classification was compared with the object-based form of the supervised Wishart classification as the baseline method. The mean accuracy of the proposed method is 6% better than the supervised Wishart classification.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".