Vehicle Detection in Congested Traffic Based on Simplified Weighted Dual-Path Feature Pyramid Network With Guided Anchoring
Jingqing Luo, Husheng Fang, Faming Shao and 2 more
IEEE Access · 2021
doi:10.1109/access.2021.3069216 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In modern life, traffic congestion is widespread in large and medium-sized cities in various countries. Multi-scale vehicle targets are densely distributed and occluded from each other in the images of crowded scenes. Vehicle detection in such scenarios is of great significance to urban traffic control, safety management and criminal investigation, but also has great challenges. Facing the special application in congested traffic, we propose Simplified Weighted Dual-path Network with Guided Anchoring framework to realize real-time vehicle detection. Firstly, a simplified weighted Dual-path Feature Pyramid Network (SWD-FPN) is used to improve the robustness of the model for multi-scale and partially occluded objects. Secondly, in order to improve the detection capability for vehicles with wide range of scale changes, the Guided Anchoring (GA) is applied to generate anchors of corresponding positions and scales according to the feature maps. Finally, for the challenge of vehicles intensive distribution, DIoU-soft NMS post-processing mechanism is introduced to reduce the missing alarm. Considering the class imbalance of vehicle detection in real-time traffic scenarios and the above improvements, multi-task loss is proposed for training. Ablation experiments are performed on UA-DETRAC dataset to further analyze the effect of different strategies on performance improvement. In addition, comparisons experiments on UA-DETRAC dataset and handcrafted Vehicles of Traffic (VOF) dataset are conducted to demonstrate the superiority of the proposed method over other state-of-the-art methods.
Abstract licence: CC BY-NC-ND
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.