Lightweight road foreign object detection algorithm based on improved YOLOv8
D. Mu,
Z. Wei, Z. Li, D. Wang
Pages: 3-18
Abstract:
In recent
years, traffic accidents caused by foreign objects on expressways have been
on the rise year by year, which have brought serious damage to vehicles or
cargo. In view of the unsatisfactory detection accuracy of current road
object detection algorithms, and the difficulty of deploying detection models
in practical application scenarios with limited computing resources due to
the large number of model parameters and high computational complexity, this
paper proposes a lightweight road foreign object detection algorithm based on
improved YOLOv8n. First, to enhance the detection model's accuracy for small
road debris, a generalized building module CONTAINER integrated with multiple
contexts was introduced to enhance the detection model's ability to extract
local features of small-scale road foreign objects and accelerate
convergence. Secondly, the C2f-Faster module is integrated into the detection
model's backbone and neck to enhance accuracy with fewer parameters and lower
complexity. Finally, in view of the limitations of immutability of border
scale and weak generalization ability of CloU, Inner-IoU is used to improve
the detection layer, and the scale factor ratio is added to boost boundary
box regression accuracy and accelerate convergence. Through the experimental
verification of ablation experiment and comparison experiment, the results
indicate the proposed algorithm's average accuracy surpasses the traditional
method, the enhanced algorithm model boasts an average accuracy improvement of
3%, rising from 96.0% to 99.0%, the calculation amount of the model is
reduced by 1.8 from 8.2 to 6.4, and the parameter count has been decreased by
0.7, from 3.0 to 2.3. The algorithm enhances road debris detection accuracy
and streamlines the calculation model, which can provide certain reference
value for highway inspection and maintenance management.
Keywords: road
foreign body; context aggregation; C2f-Faster; inner-IoU
2026 ISSUES
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES
