Fast Kernel Scene Flow

Xueqian Li, Simon Lucey
3/9/2024
cs.CV

No official code found. Best implementation: Lilac-Lee/FastKernelSF (12 stars, MIT, last commit 2024-03-12).

Abstract

In contrast to current state-of-the-art methods, such as NSFP [25], which employ deep implicit neural functions for modeling scene flow, we present a novel approach that utilizes classical kernel representations. This representation enables our approach to effectively handle dense lidar points while demonstrating exceptional computational efficiency -- compared to recent deep approaches -- achieved through the solution of a linear system. As a runtime optimization-based method, our model exhibits impressive generalizability across various out-of-distribution scenarios, achieving competitive performance on large-scale lidar datasets. We propose a new positional encoding-based kernel that demonstrates state-of-the-art performance in efficient lidar scene flow estimation on large-scale point clouds. An important highlight of our method is its near real-time performance (~150-170 ms) with dense lidar data (~8k-144k points), enabling a variety of practical applications in robotics and autonomous driving scenarios.

View on arXivView PDF

Code Implementations(1)

MIT

Fast per-point embedding kernel for scene flow estimation

120Shell, PythonMar 9, 20242 years agoMIT
3d-visionautonomous-drivingkernel-methodpoint-cloudscene-flow-estimation

Similar Papers

Cite this paper

@article{li2024fast,
  title  = {Fast Kernel Scene Flow},
  author = {Xueqian Li and Simon Lucey},
  year   = {2024},
  eprint = {2403.05896},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.05896v1}
}

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/2403.05896.svg)](https://codeofpaper.com/paper/2403.05896)

Discussion