Early Detection of Bark Beetle Attack Using Remote Sensing and Machine Learning: A Review
Bibliographic record
Abstract
Bark beetle outbreaks can have serious consequences on forest ecosystem processes, biodiversity, forest structure and function, and economies. Thus, accurate and timely detection of bark beetle infestations in the early stage (known as green-attack detection) is crucial to mitigate the further impact, develop proactive forest management activities, and minimize economic losses. Incorporating remote sensing (RS) data with machine learning (ML) (or deep learning (DL)) can provide a great alternative to the current approaches that primarily rely on aerial surveys and field surveys, which can be impractical over vast areas. Existing approaches that exploit RS and ML/DL exhibit substantial diversity due to the wide range of factors involved. This article provides a comprehensive review of past and current advances in green-attack detection from three primary perspectives: bark beetle and host interactions, RS, and ML/DL. In contrast to prior efforts, this review encompasses all RS systems and emphasizes ML/DL methods to investigate their strengths and weaknesses. We parse existing literature based on multi- or hyperspectral analyses and distill their knowledge based on bark beetle species and attack phases with a primary emphasis on early stages of attacks, host trees, study regions, RS platforms and sensors, spectral/spatial/temporal resolutions, spectral signatures, spectral vegetation indices, ML approaches, learning schemes, task categories, models, algorithms, classes/clusters, features, and DL networks and architectures. Although DL-based methods and the random forest algorithm showed promising results, highlighting their potential to detect subtle changes across visible, thermal, and short-wave infrared spectral regions, their effectiveness remains limited, and high uncertainties persist due to the subtle distinctions between healthy and attacked trees. To inspire novel solutions to these shortcomings, we delve into the principal challenges and opportunities from different perspectives, enabling a deeper understanding of the current state of research and guiding future research directions.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| 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".