mlsanityData to 7 Oct 2026

Deep Multi-Task Networks For Occluded Pedestrian Pose Estimation

arXiv 2206.07510 ↗First posted 15 Jun 2022cs.CV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Most of the existing works on pedestrian pose estimation do not consider estimating the pose of an occluded pedestrian, as the annotations of the occluded parts are not available in relevant automotive datasets. For example, CityPersons, a well-known dataset for pedestrian detection in automotive scenes does not provide pose annotations, whereas MS-COCO, a non-automotive dataset, contains human pose estimation. In this work, we propose a multi-task framework to extract pedestrian features through detection and instance segmentation tasks performed separately on these two distributions. Thereafter, an encoder learns pose specific features using an unsupervised instance-level domain adaptation method for the pedestrian instances from both distributions. The proposed framework has improved state-of-the-art performances of pose estimation, pedestrian detection, and instance segmentation.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 8 of its 13 references that are in the map. First posted on arXiv 15 Jun 2022.

Builds on

8 of 13 references.

References · 8

  1. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  2. 2018Path Aggregation Network for Instance Segmentationcited by 796
  3. 2017CityPersons: A Diverse Dataset for Pedestrian Detectioncited by 171
  4. 2020Monocular Human Pose Estimation: A Survey of Deep Learning-based Methodscited by 59
  5. 2018Occlusion-aware R-CNN: Detecting Pedestrians in a Crowdcited by 58
  6. 2018MultiPoseNet: Fast Multi-Person Pose Estimation using Pose Residual Networkcited by 47
  7. 2021Spatio-Contextual Deep Network Based Multimodal Pedestrian Detection For Autonomous Drivingcited by 25
  8. 2019Design of Real-time Semantic Segmentation Decoder for Automated Drivingcited by 5

Built on by

Cited by year

Citing papers per year: 2023: 4.

4 papers.