Papers › V2F-Net: Explicit Decomposition of Occluded Pedestrian Detection
V2F-Net: Explicit Decomposition of Occluded Pedestrian Detection
Mingyang Shang, Dawei Xiang, Zhicheng Wang, Erjin Zhou
Occlusion is very challenging in pedestrian detection. In this paper, we propose a simple yet effective method named V2F-Net, which explicitly decomposes occluded pedestrian detection into visible region detection and full body estimation. V2F-Net consists of two sub-networks: Visible region Detection Network (VDN) and Full body Estimation Network (FEN). VDN tries to localize visible regions and FEN estimates full-body box on the basis of the visible box. Moreover, to further improve the estimation of full body, we propose a novel Embedding-based Part-aware Module (EPM). By supervising the visibility for each part, the network is encouraged to extract features with essential part information. We experimentally show the effectiveness of V2F-Net by conducting several experiments on two challenging datasets. V2F-Net achieves 5.85% AP gains on CrowdHuman and 2.24% MR-2 improvements on CityPersons compared to FPN baseline. Besides, the consistent gain on both one-stage and two-stage detector validates the generalizability of our method.
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Object Detection | CityPersons | V2F-Net | mMR | 10.08 | #1 of 1 | Archive leaderboard | report |
| Object Detection | CrowdHuman (full body) | V2F-Net | AP | 91.03 | #10 of 19 | Archive leaderboard | report |
| Object Detection | CrowdHuman (full body) | V2F-Net | Recall | 84.2 | #10 of 19 | Archive leaderboard | report |
| Object Detection | CrowdHuman (full body) | V2F-Net | mMR | 42.28 | #10 of 19 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections