VoteFlow: Enforcing Local Rigidity in Self-Supervised Scene Flow
Yancong Lin, Shiming Wang, Liangliang Nan, Julian Kooij, Holger Caesar
TL;DR
VoteFlow tackles self-supervised scene flow estimation by embedding local rigidity as an architectural inductive bias through a differentiable Voting Module. Operating on pillar-based feature maps, it discretizes a translation space and aggregates votes from neighboring pillars to identify shared motion, producing a per-pillar voting feature for end-to-end learning. Empirical results on Argoverse 2 and Waymo Open show VoteFlow achieving state-of-the-art performance among self-supervised methods and strong cross-dataset generalization, with fast inference (~25 ms per sample on an A100). By enforcing local rigidity directly in the network, VoteFlow reduces reliance on post-processing or heavy regularizers, advancing robust scene flow estimation for autonomous driving.
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.
