Temporal Lidar Depth Completion

Pietari Kaskela, Philipp Fischer, Timo Roman
6/17/2024
cs.CVcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Given the lidar measurements from an autonomous vehicle, we can project the points and generate a sparse depth image. Depth completion aims at increasing the resolution of such a depth image by infilling and interpolating the sparse depth values. Like most existing approaches, we make use of camera images as guidance in very sparse or occluded regions. In addition, we propose a temporal algorithm that utilizes information from previous timesteps using recurrence. In this work, we show how a state-of-the-art method PENet can be modified to benefit from recurrency. Our algorithm achieves state-of-the-art results on the KITTI depth completion dataset while adding only less than one percent of additional overhead in terms of both neural network parameters and floating point operations. The accuracy is especially improved for faraway objects and regions containing a low amount of lidar depth samples. Even in regions without any ground truth (like sky and rooftops) we observe large improvements which are not captured by the existing evaluation metrics.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kaskela2024temporal,
  title  = {Temporal Lidar Depth Completion},
  author = {Pietari Kaskela and Philipp Fischer and Timo Roman},
  year   = {2024},
  eprint = {2406.11315},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.11315v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.11315.svg)](https://codeofpaper.com/paper/2406.11315)

Discussion