不依赖训练,用几何方法解决激光雷达场景流估计问题。
CorrelationFlow: A Training-Free Geometric Approach for LiDAR Scene Flow Estimation

- 基于鸟瞰图占据图的连通域与相关性最大化,实现无训练估计。
- 在多数据集上优于多数无监督方法,远距离表现更稳定。
- 适合追求轻量、鲁棒且不依赖大规模数据的场景流应用。
激光雷达场景流估计已形成单一范式:几乎所有近期方法采用相同的前馈架构和自监督损失,继承彼此假设与盲点。当这些假设失效(如稀疏、远距离或高速运动目标),所有基于此的方法同时失败,增加参数或模拟数据无法修复根本性缺陷。本文提出CorrelationFlow,一种无训练的几何框架,将场景流简化为两个经典操作:连通域标记与鸟瞰图占据图的相关性最大化。物体以时空连通组件形式分离,运动通过相关性峰值恢复,并传播至所有成员点。尽管密集相关性需评估每簇所有候选位移并依赖历史扫描,我们进一步设计稀疏版本,仅在单对扫描中匹配边界关键点的轻量占据描述符。由于无任何训练,无继承偏差:在包含五个异构传感器与平台的Argoverse 2 2026场景流挑战多领域测试集上,CorrelationFlow在无监督方法中排名第二,长距离退化最平缓,表明大量场景流问题可通过经典计算机视觉解决,进展可能需要质疑范式而非扩大规模。
原文摘要 · Abstract (English)
LiDAR scene flow estimation has settled into a monoculture: nearly all recent methods share the same feed-forward architecture and the same family of self-supervised losses, inheriting each other's assumptions, and each other's blind spots. When those assumptions fail, as they do for sparse, distant, or fast-moving objects, every method built on them fails together, and adding parameters or simulated training data does not fix what the formulation itself gets wrong. This paper takes the opposite path. We present CorrelationFlow, a training-free geometric framework that reduces scene flow to two textbook operations: connected-component labeling and correlation maximization on bird's-eye-view occupancy images. Objects are isolated as spatio-temporal connected components, their motions recovered as correlation peaks, and the resulting velocities propagated to all member points. However, this dense correlation evaluates every candidate displacement of every cluster and requires a window of past sweeps; therefore, we develop a sparse counterpart that operates on a single sweep pair by matching lightweight occupancy descriptors at boundary key points. Because nothing is trained, nothing is inherited: on the multi-domain test set of the Argoverse 2 2026 Scene Flow Challenge, spanning five datasets with heterogeneous sensors and platforms, CorrelationFlow ranked second among unsupervised methods and degrades most gracefully at long range, where the shared assumptions of learned methods break down. Our results suggest that a substantial share of the scene flow problem is solvable by classical computer vision, and that progress may require questioning the formulation, not scaling it.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。