CSA-Net: Complex Scenarios Adaptive Network for Building Extraction for Remote Sensing Images
Bibliographic record
Abstract
Building extraction is significant for the intelligent interpretation of high-resolution remote sensing images (HRSIs). However, in some complex scenarios where the features of the building and its adjacent ground objects are similar, the current segmentation model cannot distinguish them effectively. Therefore, we propose a complex scenarios adaptive network (CSA-Net) for building extraction. CSA-Net is comprised of the hierarchical-context feature extraction (HFE) module, the global-local feature interaction (GFI) module, and the multiscale-adaptive feature fusion (MFF) structure. The HFE obtains high-level semantic information at different levels and fuses it with low-level detailed information by skipping connections to enhance the reasoning and perception ability of building structure in complex scenes. Then, the GFI acquires global-local features of buildings and their surrounding environment via dense multiscale dilated convolution. The information can be shared through efficient interaction among features, and irrelevant backgrounds can be suppressed. Then, in the up-sampling process, the MFF alleviates the feature loss and enhances the robustness of the network by using feature fusion after layer-by-layer adaptive weight allocation. Experiments show that CSA-Net outperforms other comparable methods, with intersection over union values of 79.99%, 89.75%, and 73.59%, respectively, on the Google Arlinton, WHU, and Massachusetts building datasets. The visual comparison results demonstrate that our method can enhance the accuracy of building extraction in complex scenes. Meanwhile, the efficiency results indicate our approach strikes a balance between calculation parameters and time and achieves high levels of efficiency.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 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.002 | 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".