.png){kind=icon}
.png){kind=icon}
Return
Adaptive LiDAR Sampling and Depth Completion Using Ensemble Variance
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2021.3120042.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work considers the problem of depth completion, with or without image data, where an algorithm may measure the depth of a prescribed limited number of pixels. The algorithmic challenge is to choose pixel positions strategically and dynamically to maximally reduce overall depth estimation error. This setting is realized in daytime or nighttime depth completion for autonomous vehicles with a programmable LiDAR. Our method uses an ensemble of predictors to define a sampling probability over pixels. This probability is proportional to the variance of the predictions of ensemble members, thus highlighting pixels that are difficult to predict. By additionally proceeding in several prediction phases, we effectively reduce redundant sampling of similar pixels. Our ensemble-based method may be implemented using any depth-completion learning algorithm, such as a state-of-the-art neural network, treated as a black box. In particular, we also present a simple and effective Random Forest-based algorithm, and similarly use its internal ensemble in our design. We conduct experiments on the KITTI dataset, using the neural network algorithm of Ma et al. and our Random Forest-based learner for implementing our method. The accuracy of both implementations exceeds the state of the art. Compared with a random or grid sampling pattern, our method allows a reduction by a factor of 4-10 in the number of measurements required to attain the same accuracy.
Keywords:
Laser radar
Heuristic algorithms
Estimation
Prediction algorithms
Image reconstruction
Noise measurement
Measurement uncertainty
Adaptive sampling
depth completion
LiDAR
active learning
ensemble methods
Random Forest
probability matching
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W