PrFu-YOLO: A Lightweight Network Model for UAV-Assisted Real-Time Vehicle Detection Toward an IoT Underlayer
Bibliographic record
Abstract
With the rapid development of Internet of Things (IoT) and UAV technology, for the whole IoT system of vehicle detection, the middle and high level of information transmission and server processing has made a breakthrough, so at the bottom of the real-time detection of the vehicle by the UAV is the key to the whole system. However, UAV vehicle detection faces the challenges of too many small targets in the image leading to low detection accuracy, limited hardware platform resources requiring control of model size, and real-time detection requiring high inference speed. Aiming at the above problems, we propose a lightweight model PrFu-YOLO based on YOLOv8 improvement, which achieves a good balance between the accuracy, inference speed, and model size. And it realizes real-time vehicle detection embedded in an UAV platform. To solve the problem of low vehicle detection accuracy, we design a new structure PrFuFPN based on adding a small target detection layer to achieve more advanced feature fusion. To address the limited resources of the platform and the problem of real-time vehicle detection, we add GhostConv to the structure and constantly try to adjust the parameters of the network. Finally, extensive experiments were conducted on the VisDrone2019 and CARPK data sets to fully evaluate the model. Compared to YOLOv8s on the VisDrone2019 test set, mAP50 was improved by 10.05%, mA95 by 14.54%, the number of parameters was reduced by 8.13%, and the model size was reduced by 12.5%, while the FPS of 67.13 fully met the needs of real-time detection.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".