pith. sign in

arxiv: 1905.05618 · v1 · pith:NYLGMFJ7new · submitted 2019-05-14 · 💻 cs.CV

Monocular 3D Object Detection via Geometric Reasoning on Keypoints

classification 💻 cs.CV
keywords detectiondepthmonocularobjectchallenginggeometrickeypointsloss
0
0 comments X
read the original abstract

Monocular 3D object detection is well-known to be a challenging vision task due to the loss of depth information; attempts to recover depth using separate image-only approaches lead to unstable and noisy depth estimates, harming 3D detections. In this paper, we propose a novel keypoint-based approach for 3D object detection and localization from a single RGB image. We build our multi-branch model around 2D keypoint detection in images and complement it with a conceptually simple geometric reasoning method. Our network performs in an end-to-end manner, simultaneously and interdependently estimating 2D characteristics, such as 2D bounding boxes, keypoints, and orientation, along with full 3D pose in the scene. We fuse the outputs of distinct branches, applying a reprojection consistency loss during training. The experimental evaluation on the challenging KITTI dataset benchmark demonstrates that our network achieves state-of-the-art results among other monocular 3D detectors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning to Approximate Directional Fields Defined over 2D Planes

    cs.CV 2019-07 unverdicted novelty 4.0

    A deep network is shown to approximate directional fields on 2D planes with measurable expressive power and cross-application generalization.