www.mdpi.com/journal/remotesensing Article A Merging Algorithm for Regional Snow Mapping over Eastern Canada from AVHRR and SSM/I Data
Bibliographic record
Abstract
Abstract: We present an algorithm for regional snow mapping that combines snow maps derived from Advanced Very High Resolution Radiometer (AVHRR) and Special Sensor Microwave/Imager (SSM/I) data. This merging algorithm combines AVHRR’s moderate spatial resolution with SSM/I’s ability to penetrate clouds and, thus, benefits from the advantages of the two sensors while minimizing their limitations. First, each of the two detection algorithms were upgraded before developing the methodology to merge the snow mapping results obtained using both algorithms. The merging methodology is based on a membership function calculated over a temporal running window of ±4 days from the actual date. The studied algorithms were developed and tested over Eastern Canada for the period from 1988 to 1999. The snow mapping algorithm focused on the spring melt season (1 April to 31 May). The snow maps were validated using snow depth observations from meteorological stations. The overall accuracy of the merging algorithm is about 86%, which is between that of the new versions of the two individual algorithms: AVHRR (90%) and SSM/I (83%). Furthermore, the algorithm was able to locate the end date of the snowmelt season with reasonable accuracy (bias = 0 days; SD = 11 days). Comparison of
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".