Voting for Voting in Online Point Cloud Object Detection

Abstract

This paper proposes an efficient and effective scheme to applying the sliding window approach popular in computer vision to 3D data.Specifically, the sparse nature of the problem is exploited via a voting scheme to enable a search through all putative object locations at any orientation.We prove that this voting scheme is mathematically equivalent to a convolution on a sparse feature grid and thus enables the processing, in full 3D, of any point cloud irrespective of the number of vantage points required to construct it.As such it is versatile enough to operate on data from popular 3D laser scanners such as a Velodyne as well as on 3D data obtained from increasingly popular push-broom configurations.Our approach is "embarrassingly parallelisable" and capable of processing a point cloud containing over 100K points at eight orientations in less than 0.5s.For the object classes car, pedestrian and bicyclist the resulting detector achieves best-in-class detection and timing performance relative to prior art on the KITTI dataset as well as compared to another existing 3D object detection approach.

Keywords

Affiliated Institutions

• University of Oxford GB
• Oxford Research Group GB

Related Publications