Benchmarking of wildland fire colour segmentation algorithms
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Recently, computer vision‐based methods have started to replace conventional sensor‐based fire detection technologies. In general, visible band image sequences are used to automatically detect suspicious fire events in indoor or outdoor environments. There are several methods which aim to achieve automatic fire detection on visible band images, however, it is difficult to identify which method is the best performing as there is no fire image dataset which can be used to test the different methods. This study presents a benchmarking of state of the art wildland fire colour segmentation algorithms using a new fire dataset introduced for the first time. The dataset contains images of wildland fire in different contexts (fuel, background, luminosity, smoke etc.). All images of the dataset are characterised according to the principal colour of the fire, the luminosity, and the presence of smoke in the fire area. With this characterisation, it has been possible to determine on which kind of images each algorithm is efficient. Also a new probabilistic fire segmentation algorithm is introduced and compared to the other techniques. Benchmarking is performed in order to assess performances of 12 algorithms that can be used for the segmentation of wildland fire images.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| 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 it