Enhanced Detection of Straw Coverage Using a Refined AdaBoost Algorithm and Improved Otsu Method
Bibliographic record
Abstract
Straw coverage in wheat fields serves multiple purposes, encompassing insulation, moisture preservation, soil conservation, root stimulation, weed suppression, and fertilization.Despite these benefits, automatic recognition of straw coverage remains a challenge due to the difficulty in identifying fine straw accurately, leading to lower accuracy rates.A novel method has been developed to calculate field straw coverage rates, leveraging an improved AdaBoost algorithm and an enhanced Otsu algorithm.Initially, a nonlinear adjustment strategy utilizing the Sine wave is implemented, improving the weak classifier selection strategy.A new weighting coefficient calculation method is also introduced to enhance the classification performance of the AdaBoost algorithm.This improved AdaBoost algorithm then auto-determines whether the no-tillage seeder's working environment constitutes notillage land.The collected images of straw cover on non-arable land undergo median filtering denoising preprocessing.Subsequently, these images undergo a contrast enhancement process via grayscale and logarithmic transformations to highlight identifiable features of straw.Lastly, an enhanced Otsu algorithm is presented, which combines the merits of the maximum inter-class variance method (Otsu method) and the minimum Cross entropy segmentation algorithm.This leads to significant improvements in the classification and detection of straw coverage, verified by experimental results.The improved AdaBoost algorithm effectively recognizes the no-tillage seeder's working environment.Using the image processing algorithm developed, the calculation of field straw coverage is refined.When compared to the Otsu and K-means methods, the average error was reduced by approximately 49.3% and 33.8%, respectively, with the least misjudgment rate noted to be 5%.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".