Graininess-Aware Deep Feature Learning for Robust Pedestrian Detection

被引:72
作者
Lin, Chunze [1 ,2 ,3 ]
Lu, Jiwen [1 ,2 ,3 ]
Wang, Gang [4 ]
Zhou, Jie [1 ,2 ,3 ]
机构
[1] Tsinghua Univ, State Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Beijing Res Ctr Informat Sci & Technol BNRIST, Beijing 100084, Peoples R China
[3] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
[4] Alibaba Grp, AI Labs, Hangzhou 310052, Peoples R China
基金
中国国家自然科学基金;
关键词
Pedestrian detection; attention; deep learning; graininess; OCCLUSION; NETWORK;
D O I
10.1109/TIP.2020.2966371
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a graininess-aware deep feature learning method for pedestrian detection. Unlike most existing methods which utilize the convolutional features without explicit distinction, we appropriately exploit multiple convolutional layers and dynamically select most informative features. Specifically, we train a multi-scale pedestrian attention via pixel-wise segmentation supervision to efficiently identify the pedestrian of particular scales. We encodes the fine-grained attention map into the feature maps of the detection layers to guide them to highlight the pedestrians of specific scale and avoid the background interference. The graininess-aware feature maps generated with our attention mechanism are more focused on pedestrians, and in particular on the small-scale and occluded targets. We further introduce a zoom-in-zoom-out module to enhances the features by incorporating local details and context information. Extensive experimental results on five challenging pedestrian detection benchmarks show that our method achieves very competitive or even better performance with the state-of-the-arts and is faster than most existing approaches.
引用
收藏
页码:3820 / 3834
页数:15
相关论文
共 82 条
[1]  
[Anonymous], 2015, BANC
[2]  
[Anonymous], 2019, ARXIV190913245
[3]  
[Anonymous], 2005 IEEE COMPUTER S, DOI 10.1109/CVPR.2005.177
[4]  
[Anonymous], 2015, P INT C LEARN REPR
[5]  
[Anonymous], 2019, IEEE T PATTERN ANAL
[6]  
[Anonymous], 2018, P 32 AAAI C ART INT
[7]  
[Anonymous], 2015, PROC CVPR IEEE
[8]  
[Anonymous], 2016, ASIAN C COMP VIS
[9]  
[Anonymous], IEEE T PATTERN ANAL
[10]  
[Anonymous], 2010, P BMVC