Improved Lightweight Rebar Detection Network Based on YOLOv8s Algorithm
Bibliographic record
Abstract
This paper introduces an improved YOLOv8-based algorithm, Yolo-Rebar, designed to address the challenges of intelligent rebar counting in construction engineering. By integrating SPDConv to replace traditional convolution for downsampling, and combining bi-directional feature pyramid networks (Bi-PAN-FPN), internal intersection over union (Inner-IoU) evaluation strategy, and Dynamic Head component, Yolo-Rebar optimizes the network structure and inference process, significantly reducing computational load and parameter count while maintaining a high detection accuracy (mAP of 0.985). Maintaining a low computational demand (29.9 GFLOPs) and a moderate model size (27.1 MB), Yolo-Rebar outperforms Yolov5s and Yolov8s models in detection accuracy by 1.5% and 0.8% respectively, and compared to Yolov3-app and Yolov8m models, it requires lower computational resources while maintaining high accuracy. Empirical results demonstrate that Yolo-Rebar exhibits remarkable robustness and precision in complex construction environments, such as varying lighting conditions, rebar stacking, and occlusions. This research not only enhances the efficiency and accuracy of material acceptance in construction engineering but also provides a new direction for the further development of deep learning technology in industrial applications.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".