SHS-Net: Learning Signed Hyper Surfaces for Oriented Normal Estimation
of Point Clouds
- URL: http://arxiv.org/abs/2305.05873v1
- Date: Wed, 10 May 2023 03:40:25 GMT
- Title: SHS-Net: Learning Signed Hyper Surfaces for Oriented Normal Estimation
of Point Clouds
- Authors: Qing Li, Huifang Feng, Kanle Shi, Yue Gao, Yi Fang, Yu-Shen Liu,
Zhizhong Han
- Abstract summary: We propose a novel method called SHS-Net for oriented normal estimation of point clouds by learning signed hyper surfaces.
We show that our SHS-Net outperforms the state-of-the-art methods in both unoriented and oriented normal estimation on the widely used benchmarks.
- Score: 54.89855828917265
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We propose a novel method called SHS-Net for oriented normal estimation of
point clouds by learning signed hyper surfaces, which can accurately predict
normals with global consistent orientation from various point clouds. Almost
all existing methods estimate oriented normals through a two-stage pipeline,
i.e., unoriented normal estimation and normal orientation, and each step is
implemented by a separate algorithm. However, previous methods are sensitive to
parameter settings, resulting in poor results from point clouds with noise,
density variations and complex geometries. In this work, we introduce signed
hyper surfaces (SHS), which are parameterized by multi-layer perceptron (MLP)
layers, to learn to estimate oriented normals from point clouds in an
end-to-end manner. The signed hyper surfaces are implicitly learned in a
high-dimensional feature space where the local and global information is
aggregated. Specifically, we introduce a patch encoding module and a shape
encoding module to encode a 3D point cloud into a local latent code and a
global latent code, respectively. Then, an attention-weighted normal prediction
module is proposed as a decoder, which takes the local and global latent codes
as input to predict oriented normals. Experimental results show that our
SHS-Net outperforms the state-of-the-art methods in both unoriented and
oriented normal estimation on the widely used benchmarks. The code, data and
pretrained models are publicly available.
Related papers
- CMG-Net: Robust Normal Estimation for Point Clouds via Chamfer Normal
Distance and Multi-scale Geometry [23.86650228464599]
This work presents an accurate and robust method for estimating normals from point clouds.
We first propose a new metric termed Chamfer Normal Distance to address this issue.
We devise an innovative architecture that encompasses Multi-scale Local Feature Aggregation and Hierarchical Geometric Information Fusion.
arXiv Detail & Related papers (2023-12-14T17:23:16Z) - 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) - Neural Gradient Learning and Optimization for Oriented Point Normal
Estimation [53.611206368815125]
We propose a deep learning approach to learn gradient vectors with consistent orientation from 3D point clouds for normal estimation.
We learn an angular distance field based on local plane geometry to refine the coarse gradient vectors.
Our method efficiently conducts global gradient approximation while achieving better accuracy and ability generalization of local feature description.
arXiv Detail & Related papers (2023-09-17T08:35:11Z) - 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) - NeAF: Learning Neural Angle Fields for Point Normal Estimation [46.58627482563857]
We propose an implicit function to learn an angle field around the normal of each point in the spherical coordinate system.
Instead of directly predicting the normal of an input point, we predict the angle offset between the ground truth normal and a randomly sampled query normal.
arXiv Detail & Related papers (2022-11-30T10:11:47Z) - GeoUDF: Surface Reconstruction from 3D Point Clouds via Geometry-guided
Distance Representation [73.77505964222632]
We present a learning-based method, namely GeoUDF, to tackle the problem of reconstructing a discrete surface from a sparse point cloud.
To be specific, we propose a geometry-guided learning method for UDF and its gradient estimation.
To extract triangle meshes from the predicted UDF, we propose a customized edge-based marching cube module.
arXiv Detail & Related papers (2022-11-30T06:02:01Z) - HSurf-Net: Normal Estimation for 3D Point Clouds by Learning Hyper
Surfaces [54.77683371400133]
We propose a novel normal estimation method called HSurf-Net, which can accurately predict normals from point clouds with noise and density variations.
Experimental results show that our HSurf-Net achieves the state-of-the-art performance on the synthetic shape dataset.
arXiv Detail & Related papers (2022-10-13T16:39:53Z) - Deep Point Cloud Normal Estimation via Triplet Learning [12.271669779096076]
We propose a novel normal estimation method for point clouds.
It consists of two phases: (a) feature encoding which learns representations of local patches, and (b) normal estimation that takes the learned representation as input and regresses the normal vector.
Our method preserves sharp features and achieves better normal estimation results on CAD-like shapes.
arXiv Detail & Related papers (2021-10-20T11:16:00Z)
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.