RVLoss: Runoff Vote Loss for Self-Supervised LiDAR Scene Flow Estimation
LiDAR scene flow estimates point-wise motion between two consecutive scans, referred to as the source and target. Leading self-supervised methods typically minimize the Chamfer loss, the nearest neighbor distance between the flow-compensated source and the target. However, nearest-neighbor search does not enforce motion rigidity, often leading to inconsistent flows within object instances. Existing approaches address this issue with additional regularization terms, but flow consistency among points remains limited, especially for large objects. We propose RVLoss, a self-supervised loss that incorporates motion rigidity by design through a runoff vote mechanism. Our key observation is that the point-wise motion, calculated from nearest neighbor search, can often be grouped into a small set of dominant flow candidates by voting (top-k voting). Furthermore, when compensating the source by these candidates, the flow that best represents the underlying rigid motion often yields the highest consensus after a second voting (top-1 voting). Based on this insight, we incorporate the two-stage runoff vote into loss design and create cluster-wise rigid flows and free-form flows as pseudo-labels for self-supervised learning. RVLoss can be seamlessly integrated into existing feedforward architectures. Experiments on the Argoverse2 2026 Challenge show that models trained with RVLoss achieve state-of-the-art performance among self-supervised approaches, outperforming baseline models trained with alternative loss designs by 20%. Moreover, cross-dataset evaluations demonstrate consistent performance improvements across four additional datasets. Code will be released upon acceptance.
Code (0)
등록된 구현이 없습니다.
Tasks
Self-Supervised LearningScene Flow EstimationSimilar Papers 제목 키워드 기반
Candidate Incentive Distributions: How voting methods shape electoral incentives
We evaluate the tendency for different voting methods to promote political compromise and reduce tensions in a society by using computer simulations to determine which voters candidates are incentivized to appeal to. We …
CuVLER: Enhanced Unsupervised Object Discoveries through Exhaustive Self-Supervised Transformers
In this paper, we introduce VoteCut, an innovative method for unsupervised object discovery that leverages feature representations from multiple self-supervised models. VoteCut employs normalized-cut based graph partitio…
Clusteringgraph partitioningImage SegmentationObject Discovery+2An Empirical Analysis of the Effect of Ballot Truncation on Ranked-Choice Electoral Outcomes
In ranked-choice elections voters cast preference ballots which provide a voter's ranking of the candidates. The method of ranked-choice voting (RCV) chooses a winner by using voter preferences to simulate a series of ru…
A Majority Rule Philosophy for Instant Runoff Voting
We present the core support criterion, a voting criterion satisfied by Instant Runoff Voting (IRV) that is analogous to the Condorcet criterion but reflective of a different majority rule philosophy. Condorcet methods ca…
PhilosophyYou can do RLAs for IRV
The City and County of San Francisco, CA, has used Instant Runoff Voting (IRV) for some elections since 2004. This report describes the first ever process pilot of Risk Limiting Audits for IRV, for the San Francisco Dist…