TL;DR
This paper introduces a non-learning, geometry-based LiDAR depth completion method that leverages local surface geometry and outlier removal to accurately estimate dense depth maps from sparse LiDAR data.
Contribution
It presents a novel non-learning approach utilizing surface geometry and an outlier removal algorithm, achieving state-of-the-art results among non-learning methods.
Findings
Achieves best error performance among non-learning methods on KITTI
Comparable to top self-supervised and some supervised learning methods
Outlier removal improves robustness in occluded regions
Abstract
LiDAR depth completion is a task that predicts depth values for every pixel on the corresponding camera frame, although only sparse LiDAR points are available. Most of the existing state-of-the-art solutions are based on deep neural networks, which need a large amount of data and heavy computations for training the models. In this letter, a novel non-learning depth completion method is proposed by exploiting the local surface geometry that is enhanced by an outlier removal algorithm. The proposed surface geometry model is inspired by the observation that most pixels with unknown depth have a nearby LiDAR point. Therefore, it is assumed those pixels share the same surface with the nearest LiDAR point, and their respective depth can be estimated as the nearest LiDAR depth value plus a residual error. The residual error is calculated by using a derived equation with several physical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
