Multispectral Image Super-Resolution Burned-Area Mapping Based on Space-Temperature Information
Bibliographic record
Abstract
Multispectral imaging (MI) provides important information for burned-area mapping. Due to the severe conditions of burned areas and the limitations of sensors, the resolution of collected multispectral images is sometimes very rough, hindering the accurate determination of burned areas. Super-resolution mapping (SRM) has been proposed for mapping burned areas in rough images to solve this problem, allowing super-resolution burned-area mapping (SRBAM). However, the existing SRBAM methods do not use sufficiently accurate space information and detailed temperature information. To improve the mapping accuracy of burned areas, an improved SRBAM method utilizing space–temperature information (STI) is proposed here. STI contains two elements, a space element and a temperature element. We utilized the random-walker algorithm (RWA) to characterize the space element, which encompassed accurate object space information, while the temperature element with rich temperature information was derived by calculating the normalized burn ratio (NBR). The two elements were then merged to produce an objective function with space–temperature information. The particle swarm optimization algorithm (PSOA) was employed to handle the objective function and derive the burned-area mapping results. The dataset of the Landsat-8 Operational Land Imager (OLI) from Denali National Park, Alaska, was used for testing and showed that the STI method is superior to the traditional SRBAM method.
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.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".