Synthetic aperture radar phase unwrapping using region-growing with polynomial-based phase prediction
Bibliographic record
Abstract
Phase unwrapping for interferometric synthetic aperture radar (InSAR) remains a challenge due to the presence of speckle noise and temporal decorrelation in many interferograms. This paper proposes a polynomial-based region-growing phase unwrapping (PBRGPU) approach that is built on the region-growing phase unwrapping (RGPU) approach in Xu and Cumming (Xu and Cumming. 1996. A region growing algorithm for insar phase unwrapping. IGARSS 96. International Geoscience and Remote Sensing Symposium. 31–31 May 1996. Lincoln, NE, USA. doi:https://doi.org/10.1109/igarss.1996.516883). The proposed approach iteratively performs phase unwrapping at the edges of multiple seeded regions using a least-squares polynomial phase prediction, which allows for the use of statistically rigorous quality assurance to remove low quality pixels from further processing. Here, a user-specified statistical confidence interval is more intuitive to users than the threshold parameters used by other algorithms. The proposed approach is currently the only phase unwrapping approach to take this strategy with its quality assurance. The proposed approach was found to improve upon the solution quality of the RGPU approach, in some cases achieving a tenfold decrease in root-mean-square error for simulated data. The PBRGPU approach performed well when applied to RADARSAT-2 data collected over Polar Bear Provincial Park (Ontario, Canada). The PBRGPU solutions were consistently on par with or superior to those generated by SNAPHU in terms of accuracy. While the PBRGPU approach does lag behind SNAPHU in terms of the domain of the solution, with SNAPHU unwrapping a significantly larger portion of the interferogram in all test cases, this issue could readily be mitigated through post-processing of the unwrapped interferogram. The proposed approach provides a solid foundation for region-growing algorithms that adapt to local noise levels and integrate all available information rather than relying on preprocessing strategies.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 |
| 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".