Joint Pedestrian Detection and Attribute Recognition Feature Learning

Author(s):  
Ye Li ◽  
Zhaoqian Jia ◽  
Yiyin Ding ◽  
Fangyan Shi ◽  
Guangqiang Yin
2020 ◽  
Vol 29 ◽  
pp. 3820-3834 ◽  
Author(s):  
Chunze Lin ◽  
Jiwen Lu ◽  
Gang Wang ◽  
Jie Zhou

2020 ◽  
Vol 34 (07) ◽  
pp. 12394-12401 ◽  
Author(s):  
Mingda Wu ◽  
Di Huang ◽  
Yuanfang Guo ◽  
Yunhong Wang

Recently, Human Attribute Recognition (HAR) has become a hot topic due to its scientific challenges and application potentials, where localizing attributes is a crucial stage but not well handled. In this paper, we propose a novel deep learning approach to HAR, namely Distraction-aware HAR (Da-HAR). It enhances deep CNN feature learning by improving attribute localization through a coarse-to-fine attention mechanism. At the coarse step, a self-mask block is built to roughly discriminate and reduce distractions, while at the fine step, a masked attention branch is applied to further eliminate irrelevant regions. Thanks to this mechanism, feature learning is more accurate, especially when heavy occlusions and complex backgrounds exist. Extensive experiments are conducted on the WIDER-Attribute and RAP databases, and state-of-the-art results are achieved, demonstrating the effectiveness of the proposed approach.


2020 ◽  
Vol 34 (07) ◽  
pp. 10518-10525
Author(s):  
Di Chen ◽  
Shanshan Zhang ◽  
Wanli Ouyang ◽  
Jian Yang ◽  
Bernt Schiele

Person Search is a challenging task which requires to retrieve a person's image and the corresponding position from an image dataset. It consists of two sub-tasks: pedestrian detection and person re-identification (re-ID). One of the key challenges is to properly combine the two sub-tasks into a unified framework. Existing works usually adopt a straightforward strategy by concatenating a detector and a re-ID model directly, either into an integrated model or into separated models. We argue that simply concatenating detection and re-ID is a sub-optimal solution, and we propose a Hierarchical Online Instance Matching (HOIM) loss which exploits the hierarchical relationship between detection and re-ID to guide the learning of our network. Our novel HOIM loss function harmonizes the objectives of the two sub-tasks and encourages better feature learning. In addition, we improve the loss update policy by introducing Selective Memory Refreshment (SMR) for unlabeled persons, which takes advantage of the potential discrimination power of unlabeled data. From the experiments on two standard person search benchmarks, i.e. CUHK-SYSU and PRW, we achieve state-of-the-art performance, which justifies the effectiveness of our proposed HOIM loss on learning robust features.


2019 ◽  
Vol 46 ◽  
pp. 206-217 ◽  
Author(s):  
Yanpeng Cao ◽  
Dayan Guan ◽  
Weilin Huang ◽  
Jiangxin Yang ◽  
Yanlong Cao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document