Detection of Forest Fires through Deep Unsupervised Learning Modeling of Sentinel-1 Time Series
Bibliographic record
Abstract
With an increase in the amount of natural disasters, the combined use of cloud-penetrating Synthetic Aperture Radar and deep learning becomes unavoidable for their monitoring. This article proposes a methodology for forest fire detection using unsupervised location-expert autoencoders and Sentinel-1 SAR time series. The models are trained on SAR multitemporal images over a specific area using a reference period and extract any deviating time series over that same area for the test period. We present three variations of the autoencoder, incorporating either temporal features or spatiotemporal features, and we compare it against a state-of-the-art supervised autoencoder. Despite their limitations, we show that unsupervised approaches are on par with supervised techniques, performance-wise. A specific architecture, the fully temporal autoencoder, stands out as the best-performing unsupervised approach by leveraging temporal information of Sentinel-1 time series using one-dimensional convolutional layers. The approach is generic and can be applied to many applications, though we focus here on forest fire detection in Canadian boreal forests as a successful use case.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".