Hybrid SAR Speckle Reduction Using Complex Wavelet Shrinkage and Non-Local PCA-Based Filtering
Bibliographic record
Abstract
In this paper, a new hybrid despeckling method, based on Undecimated Dual-Tree Complex Wavelet Transform (UDT-CWT) using maximum a posteriori (MAP) estimator and non-local Principal Component Analysis (PCA)-based filtering with local pixel grouping (LPG-PCA), was proposed. To achieve a heterogeneous-adaptive speckle reduction, SAR image is classified into three classes of point targets, details, or homogeneous areas. The despeckling is done for each pixel based on its class of information. Logarithm transform was applied to the SAR image to convert the multiplicative speckle into additive noise. Our proposed method contains two principal steps. In the first step, denoising was done in the complex wavelet domain via MAP estimator. After performing UDT-CWT, the noise-free complex wavelet coefficients of the log-transformed SAR image were modeled as a two-state Gaussian mixture model. Furthermore, the additive noise in the complex wavelet domain was considered as a zero-mean Gaussian distribution. In the second step, after applying inverse UDT-CWT, an iterative LPG-PCA method was used to smooth the homogeneous areas and enhance the details. The proposed method was compared with some state-of-the-art despeckling methods. The experimental results showed that the proposed method leads to a better speckle reduction in homogeneous areas while preserving details.
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.001 | 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.001 | 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".