Points2Surf: Learning Implicit Surfaces from Point Cloud Patches
- URL: http://arxiv.org/abs/2007.10453v2
- Date: Tue, 13 Feb 2024 11:48:29 GMT
- Title: Points2Surf: Learning Implicit Surfaces from Point Cloud Patches
- Authors: Philipp Erler, Paul Guerrero, Stefan Ohrhallinger, Michael Wimmer,
Niloy J. Mitra
- Abstract summary: A key step in any scanning-based computation is to convert unordered point clouds to a surface.
We present Points2Surf, a novel patch-based learning framework that produces accurate surfaces directly from raw scans without normals.
- Score: 35.2104818061992
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A key step in any scanning-based asset creation workflow is to convert
unordered point clouds to a surface. Classical methods (e.g., Poisson
reconstruction) start to degrade in the presence of noisy and partial scans.
Hence, deep learning based methods have recently been proposed to produce
complete surfaces, even from partial scans. However, such data-driven methods
struggle to generalize to new shapes with large geometric and topological
variations. We present Points2Surf, a novel patch-based learning framework that
produces accurate surfaces directly from raw scans without normals. Learning a
prior over a combination of detailed local patches and coarse global
information improves generalization performance and reconstruction accuracy.
Our extensive comparison on both synthetic and real data demonstrates a clear
advantage of our method over state-of-the-art alternatives on previously unseen
classes (on average, Points2Surf brings down reconstruction error by 30% over
SPR and by 270%+ over deep learning based SotA methods) at the cost of longer
computation times and a slight increase in small-scale topological noise in
some cases. Our source code, pre-trained model, and dataset are available on:
https://github.com/ErlerPhilipp/points2surf
Related papers
- Inferring Neural Signed Distance Functions by Overfitting on Single Noisy Point Clouds through Finetuning Data-Driven based Priors [53.6277160912059]
We propose a method to promote pros of data-driven based and overfitting-based methods for better generalization, faster inference, and higher accuracy in learning neural SDFs.
We introduce a novel statistical reasoning algorithm in local regions which is able to finetune data-driven based priors without signed distance supervision, clean point cloud, or point normals.
arXiv Detail & Related papers (2024-10-25T16:48:44Z) - PPSURF: Combining Patches and Point Convolutions for Detailed Surface
Reconstruction [15.843730758485917]
PPSurf is a method that combines a global prior based on point convolutions and a local prior based on processing local point cloud patches.
We show that this approach is robust to noise while recovering surface details more accurately than the current state-of-the-art.
arXiv Detail & Related papers (2024-01-16T17:31:43Z) - NeuralGF: Unsupervised Point Normal Estimation by Learning Neural
Gradient Function [55.86697795177619]
Normal estimation for 3D point clouds is a fundamental task in 3D geometry processing.
We introduce a new paradigm for learning neural gradient functions, which encourages the neural network to fit the input point clouds.
Our excellent results on widely used benchmarks demonstrate that our method can learn more accurate normals for both unoriented and oriented normal estimation tasks.
arXiv Detail & Related papers (2023-11-01T09:25:29Z) - Unsupervised Inference of Signed Distance Functions from Single Sparse
Point Clouds without Learning Priors [54.966603013209685]
It is vital to infer signed distance functions (SDFs) from 3D point clouds.
We present a neural network to directly infer SDFs from single sparse point clouds.
arXiv Detail & Related papers (2023-03-25T15:56:50Z) - A Survey and Benchmark of Automatic Surface Reconstruction from Point Clouds [12.58355339505807]
We present both traditional and learning-based methods for surface reconstruction from point clouds.
Traditional approaches often simplify the problem by imposing handcrafted priors on either the input point clouds or the resulting surface.
Deep learning models have the capability directly learn the properties of input point clouds.
arXiv Detail & Related papers (2023-01-31T14:18:19Z) - PatchRD: Detail-Preserving Shape Completion by Learning Patch Retrieval
and Deformation [59.70430570779819]
We introduce a data-driven shape completion approach that focuses on completing geometric details of missing regions of 3D shapes.
Our key insight is to copy and deform patches from the partial input to complete missing regions.
We leverage repeating patterns by retrieving patches from the partial input, and learn global structural priors by using a neural network to guide the retrieval and deformation steps.
arXiv Detail & Related papers (2022-07-24T18:59:09Z) - OMNet: Learning Overlapping Mask for Partial-to-Partial Point Cloud
Registration [31.108056345511976]
OMNet is a global feature based iterative network for partial-to-partial point cloud registration.
We learn masks in a coarse-to-fine manner to reject non-overlapping regions, which converting the partial-to-partial registration to the registration of the same shapes.
arXiv Detail & Related papers (2021-03-01T11:59:59Z) - Deep Shells: Unsupervised Shape Correspondence with Optimal Transport [52.646396621449]
We propose a novel unsupervised learning approach to 3D shape correspondence.
We show that the proposed method significantly improves over the state-of-the-art on multiple datasets.
arXiv Detail & Related papers (2020-10-28T22:24:07Z) - Deep Geometric Functional Maps: Robust Feature Learning for Shape
Correspondence [31.840880075039944]
We present a novel learning-based approach for computing correspondences between non-rigid 3D shapes.
Key to our method is a feature-extraction network that learns directly from raw shape geometry.
arXiv Detail & Related papers (2020-03-31T15:20:17Z) - Learning multiview 3D point cloud registration [74.39499501822682]
We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm.
Our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly.
arXiv Detail & Related papers (2020-01-15T03:42:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.