VDB-GPDF: Online Gaussian Process Distance Field with VDB Structure
Lan Wu, Cedric Le Gentil, and Teresa Vidal-Calleja

TL;DR
This paper introduces an online mapping framework combining Gaussian Process distance fields with a VDB data structure, enabling efficient, probabilistic, and continuous environment representations for robotics.
Contribution
It presents a novel coupling of GP distance fields with VDB structures for real-time, probabilistic environment mapping in robotics.
Findings
Superior efficiency over state-of-the-art methods
Accurate distance and surface property estimation
Effective probabilistic fusion of local and global fields
Abstract
Robots reason about the environment through dedicated representations. Popular choices for dense representations exploit Truncated Signed Distance Functions (TSDF) and Octree data structures. However, TSDF provides a projective or non-projective signed distance obtained directly from depth measurements that overestimate the Euclidean distance. Octrees, despite being memory efficient, require tree traversal and can lead to increased runtime in large scenarios. Other representations based on the Gaussian Process (GP) distance fields are appealing due to their probabilistic and continuous nature, but the computational complexity is a concern. In this paper, we present an online efficient mapping framework that seamlessly couples GP distance fields and the fast-access OpenVDB data structure. The key aspect is a latent Local GP Signed Distance Field (L-GPDF) contained in a local VDB…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Cloud Computing and Resource Management · Data Stream Mining Techniques
