Accurate Despeckling and Estimation of Polarimetric Features by Means of a Spatial Decorrelation of the Noise in Complex PolSAR Data
Bibliographic record
Abstract
In this work, we extended a procedure for the spatial decorrelation of fully-developed speckle, originally developed for single-polarization SAR data, to fully-polarimetric SAR data. The spatial correlation of the noise depends on the tapering window in the Fourier domain used by the SAR processor to avoid defocusing of targets caused by Gibbs effects. Since each polarimetric channel is focused independently of the others, the noise-whitening procedure can be performed applying the decorrelation stage to each channel separately. Equivalently, the noise-whitening stage is applied to each element of the scattering matrix before any multilooking operation, either coherent or not, is performed. In order to evaluate the impact of a spatial decorrelation of the noise on the performance of polarimetric despeckling filters, we make use of simulated PolSAR data, having user-defined polarimetric features. We optionally introduce a spatial correlation of the noise in the simulated complex data by means of a 2D separable Hamming window in the Fourier domain. Then, we remove such a correlation by using the whitening procedure and compare the accuracy of both despeckling and polarimetric features estimation for the three following cases: uncorrelated, correlated, and decorrelated images. Simulation results showed a steady improvement of performance scores, most notably the equivalent number of looks (ENL), which increased after decorrelation and closely attained the value of the uncorrelated case. Besides ENL, the benefits of the noise decorrelation hold also for polarimetric features, whose estimation accuracy is diminished by the correlation. Also, the trends of simulations were confirmed by qualitative results of experiments carried out on a true Radarsat-2 image.
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.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.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".