KERNEL-BASED UNSUPERVISED CHANGE DETECTION OF AGRICULTURAL LANDS USING MULTI-TEMPORAL POLARIMETRIC SAR DATA
Bibliographic record
Abstract
Abstract. Unsupervised change detection of agricultural lands in seasonal and annual periods is necessary for farming activities and yield estimation. Polarimetric Synthetic Aperture Radar (PolSAR) data due to their special characteristics are a powerful source to study temporal behaviour of land cover types. PolSAR data allows building up the powerful observations sensitive to the shape, orientation and dielectric properties of scatterers and allows the development of physical models for identification and separation of scattering mechanisms occurring inside the same region of observed lands. In this paper an unsupervised kernel-based method is introduced for agricultural change detection by PolSAR data. This method works by transforming data into higher dimensional space by kernel functions and clustering them in this space. Kernel based c-means clustering algorithm is employed to separate the changes classes from the no-changes. This method is a non-linear algorithm which considers the contextual information of observations. Using the kernel functions helps to make the non-linear features more separable in a linear space. In addition, use of eigenvectors' parameters as a polarimetric target decomposition technique helps us to consider and benefit physical properties of targets in the PolSAR change detection. Using kernel based c-means clustering with proper initialization of the algorithm makes this approach lead to great results in change detection paradigm.
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.002 | 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.000 | 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".