Enhanced Multi-Threshold Otsu Algorithm for Corn Seedling Band Centerline Extraction in Straw Row Grouping
Yuanyuan Liu, Yuxin Du, Kaipeng Zhang and 9 more
Agronomy · 2025
doi:10.3390/agronomy15071575 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Straw row grouping is vital in conservation tillage for precision seeding, and accurate centerline extraction of the seedling bands enhances agricultural spraying efficiency. However, the traditional single-threshold Otsu segmentation struggles with adaptability and accuracy under complex field conditions. To overcome these issues, this study proposes an adaptive multi-threshold Otsu algorithm optimized by a Simulated Annealing-Enhanced Differential Evolution–Whale Optimization Algorithm (SADE-WOA). The method avoids premature convergence and improves population diversity by embedding the crossover mechanism of Differential Evolution (DE) into the Whale Optimization Algorithm (WOA) and introducing a vector disturbance strategy. It adaptively selects thresholds based on straw-covered image features. Combined with least-squares fitting, it suppresses noise and improves centerline continuity. The experimental results show that SADE-WOA accurately separates soil regions while preserving straw texture, achieving higher between-class variance and significantly faster convergence than the other tested algorithms. It runs at just one-tenth of the time of the Grey Wolf Optimizer and one-ninth of that of DE and requires only one-sixth to one-seventh of the time needed by DE-GWO. During centerline fitting, the mean yaw angle error (MEA) ranged from 0.34° to 0.67°, remaining well within the 5° tolerance required for agricultural navigation. The root-mean-square error (RMSE) fell between 0.37° and 0.73°, while the mean relative error (MRE) stayed below 0.2%, effectively reducing the influence of noise and improving both accuracy and robustness.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.