VoteFlow: Enforcing Local Rigidity in Self-Supervised Scene Flow

Conference Paper (2025)
Author(s)

Y. Lin (ETH Zürich, TU Delft - Intelligent Vehicles)

S. Wang (TU Delft - Intelligent Vehicles)

L. Nan (TU Delft - Urban Data Science)

J.F.P. Kooij (TU Delft - Intelligent Vehicles)

Holger Caesar (TU Delft - Intelligent Vehicles)

Research Group
Intelligent Vehicles
DOI related publication
https://doi.org/10.1109/CVPR52734.2025.01599
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Intelligent Vehicles
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/publishing/publisher-deals Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Pages (from-to)
17155-17164
ISBN (electronic)
979-8-3315-4364-8
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Scene flow estimation aims to recover per-point motion from two adjacent LiDAR scans. However, in real-world applications such as autonomous driving, points rarely move independently of others, especially for nearby points belonging to the same object, which often share the same motion. Incorporating this locally rigid motion constraint has been a key challenge in self-supervised scene flow estimation, which is often addressed by post-processing or appending extra regularization. While these approaches are able to improve the rigidity of predicted flows, they lack an architectural inductive bias for local rigidity within the model structure, leading to suboptimal learning efficiency and inferior performance. In contrast, we enforce local rigidity with a lightweight add-on module in neural network design, enabling end-to-end learning. We design a discretized voting space that accommodates all possible translations and then identify the one shared by nearby points by differentiable voting. Additionally, to ensure computational efficiency, we operate on pillars rather than points and learn representative features for voting per pillar. We plug the Voting Module into popular model designs and evaluate its benefit on Argoverse 2 and Waymo datasets. We outperform baseline works with only marginal compute overhead. Code is available at https://github.com/tudelft-iv/VoteFlow.

Files

License info not available
warning

File under embargo until 13-02-2026