TransU-Net++: Rethinking attention gated TransU-Net for deforestation mapping
Bibliographic record
Abstract
Deforestation has become a major cause of climate change, and as a result, both characterizing the drivers and estimating segmentation maps of deforestation have piqued the interest of researchers. In the computer vision domain, Vision Transformers (ViTs) have shown their superiority compared to extensively utilized convolutional neural networks (CNNs) over the last couple of years. Although, ViTs has several challenges, specifically in remote sensing image processing, including their significant complexity that increases the computation costs and their need for much higher reference data than that of CNNs. As such, in this paper, we introduce an attention gates aided TransU-Net, called TransU-Net++ for semantic segmentation with an application of deforestation mapping in two South American forest biomes, i.e., the Atlantic Forest and the Amazon Rainforest. The heterogeneous kernel convolution (HetConv), U-Net, attention gates, and ViTs are all utilized in the proposed TransU-Net++ to their advantage. The TransU-Net++ significantly increased the performance of TransU-Net’s over the Atlantic Forest dataset by about 4%, 6%, and 16%, respectively, in terms of overall accuracy, F1-score, and recall, respectively.Moreover, the results show that the developed TrasnU-Net++ model (0.921) achieves the highest Area under the ROC Curve value in the 3-band Amazon forest dataset as compared to other segmentation models, including ICNet (0.667), ENet (0.69), SegNet (0.788), U-Net (0.871), Attention U-Net-2 (0.886), R2U-Net (0.888), TransU-Net (0.889), Swin U-Net (0.893), ResU-Net (0.896), U-Net+++ (0.9), and Attention U-Net (0.908), respectively. The code will be made publicly available at https://github.com/aj1365/TransUNetplus2.
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.002 | 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.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".