Neural Scene Flow Prior
Xueqian Li, Jhony Kaesemodel Pontes, Simon Lucey

TL;DR
This paper introduces a neural scene flow prior that uses neural network architecture as an implicit regularizer, enabling runtime optimization for scene flow estimation without requiring large labeled datasets, suitable for deployment in new environments.
Contribution
It proposes a novel neural scene flow prior based on MLPs that enables runtime optimization without offline training, improving generalization and applicability in diverse scenarios.
Findings
Achieves competitive results on scene flow benchmarks.
Allows dense long-term correspondence estimation across point cloud sequences.
Operates without offline datasets, suitable for real-time deployment.
Abstract
Before the deep learning revolution, many perception algorithms were based on runtime optimization in conjunction with a strong prior/regularization penalty. A prime example of this in computer vision is optical and scene flow. Supervised learning has largely displaced the need for explicit regularization. Instead, they rely on large amounts of labeled data to capture prior statistics, which are not always readily available for many problems. Although optimization is employed to learn the neural network, the weights of this network are frozen at runtime. As a result, these learning solutions are domain-specific and do not generalize well to other statistically different scenarios. This paper revisits the scene flow problem that relies predominantly on runtime optimization and strong regularization. A central innovation here is the inclusion of a neural scene flow prior, which uses the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Vision and Imaging · 3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques
