Dandelion center detection in perennial ryegrass with Heat maps using Convolutional Neural Networks
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
Industrial agricultural practices largely involve automated weed control processes and techniques. This phenomenon can also be seen in horticulture and landscaping. Generally, dandelion weeds (Taraxacum officinale) are a common pest and their detection is necessary for any type of removal. To address this detection issue, a cost-effective and intuitive labeling method using Heat maps is proposed for marking dandelion plant centers within perennial rye-grass. This method relies on approximate localization as opposed to pinpoint accuracy. An expandable lightweight Convolutional Neural Network (CNN) is built on a base network to generate detection output maps at two resolutions. Multiple loss functions are expanded to multi-instance predictions and their combinations are examined through ablation to assess and rank their performance. Different methods of computing standard performance metrics are also explored. Also, different backbone networks are also shown to reveal varying performance advantages. Through these methods, dandelion weed centers can consistently be located with robustness to noise and erroneous labels and with good precision. Furthermore, our method is almost entirely end-to-end. The experimental results demonstrate that our methods outperform Semantic Segmentation models in the precision of output maps while avoiding the need of intensive labeling costs. In addition, when applying Hierarchical Clustering to the segmentation maps for a complete comparison in center detection, our methods double the accuracy and do not require the manual tuning of cluster parameters. Our proposed application of soft computing can be used in the landscaping industry and adapted to other fields with relative ease. The binary classification and object detection tasks of locating dandelion plants can be extended to multi-class problems with other plants. • Dandelion centers are detected in grass with Heat maps in largely end-to-end manner. • An alternative labeling method is proposed and it proves precise and robust. • An ablation study of different loss functions’ performance is carried out. • Multiple resolution prediction outputs are tested and compared.
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.001 |
| 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