CMG-Net: Robust Normal Estimation for Point Clouds via Chamfer Normal Distance and Multi-scale Geometry

• URL: http://arxiv.org/abs/2312.09154v1
• Date: Thu, 14 Dec 2023 17:23:16 GMT
• Title: CMG-Net: Robust Normal Estimation for Point Clouds via Chamfer Normal Distance and Multi-scale Geometry
• Authors: Yingrui Wu, Mingyang Zhao, Keqiang Li, Weize Quan, Tianqi Yu, Jianfeng Yang, Xiaohong Jia, Dong-Ming Yan
• Abstract summary: 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.
• Score: 23.86650228464599
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work presents an accurate and robust method for estimating normals from point clouds. In contrast to predecessor approaches that minimize the deviations between the annotated and the predicted normals directly, leading to direction inconsistency, we first propose a new metric termed Chamfer Normal Distance to address this issue. This not only mitigates the challenge but also facilitates network training and substantially enhances the network robustness against noise. Subsequently, we devise an innovative architecture that encompasses Multi-scale Local Feature Aggregation and Hierarchical Geometric Information Fusion. This design empowers the network to capture intricate geometric details more effectively and alleviate the ambiguity in scale selection. Extensive experiments demonstrate that our method achieves the state-of-the-art performance on both synthetic and real-world datasets, particularly in scenarios contaminated by noise. Our implementation is available at https://github.com/YingruiWoo/CMG-Net_Pytorch.

Related papers

• Segmenting objects with Bayesian fusion of active contour models and convnet priors [0.729597981661727]
  We propose a novel instance segmentation method geared towards Natural Resource Monitoring (NRM) imagery. We formulate the problem as Bayesian maximum a posteriori inference which, in learning the individual object contours, incorporates shape, location, and position priors. In experiments, we tackle the challenging, real-world problem of segmenting individual dead tree crowns and precise contours.
  arXiv  Detail & Related papers  (2024-10-09T20:36:43Z)
• OCMG-Net: Neural Oriented Normal Refinement for Unstructured Point Clouds [18.234146052486054]
  We present a robust refinement method for estimating oriented normals from unstructured point clouds. Our framework incorporates sign orientation and data augmentation in the feature space to refine the initial oriented normals. To address the issue of noise-caused direction inconsistency existing in previous approaches, we introduce a new metric called the Chamfer Normal Distance.
  arXiv  Detail & Related papers  (2024-09-02T09:30:02Z)
• Fast Point Cloud Geometry Compression with Context-based Residual Coding and INR-based Refinement [19.575833741231953]
  We use the KNN method to determine the neighborhoods of raw surface points. A conditional probability model is adaptive to local geometry, leading to significant rate reduction. We incorporate an implicit neural representation into the refinement layer, allowing the decoder to sample points on the underlying surface at arbitrary densities.
  arXiv  Detail & Related papers  (2024-08-06T05:24:06Z)
• Asymmetrical Siamese Network for Point Clouds Normal Estimation [13.826173253686726]
  In this paper, we explore the consistency of intrinsic features learned from clean and noisy point clouds using an Asymmetric Siamese Network architecture. By applying reasonable constraints between features extracted from different branches, we enhance the quality of normal estimation. We introduce a novel multi-view normal estimation dataset that includes a larger variety of shapes with different noise levels.
  arXiv  Detail & Related papers  (2024-06-14T03:07:23Z)
• Arbitrary-Scale Point Cloud Upsampling by Voxel-Based Network with Latent Geometric-Consistent Learning [52.825441454264585]
  We propose an arbitrary-scale Point cloud Upsampling framework using Voxel-based Network (textbfPU-VoxelNet) Thanks to the completeness and regularity inherited from the voxel representation, voxel-based networks are capable of providing predefined grid space to approximate 3D surface. A density-guided grid resampling method is developed to generate high-fidelity points while effectively avoiding sampling outliers.
  arXiv  Detail & Related papers  (2024-03-08T07:31:14Z)
• 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)
• Learning Signed Hyper Surfaces for Oriented Point Cloud Normal Estimation [53.19926259132379]
  We propose a novel method called SHS-Net for oriented normal estimation of point clouds by learning signed hyper surfaces. The signed hyper surfaces are implicitly learned in a high-dimensional feature space where the local and global information is aggregated. 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.
  arXiv  Detail & Related papers  (2023-05-10T03:40:25Z)
• Iterative Soft Shrinkage Learning for Efficient Image Super-Resolution [91.3781512926942]
  Image super-resolution (SR) has witnessed extensive neural network designs from CNN to transformer architectures. This work investigates the potential of network pruning for super-resolution iteration to take advantage of off-the-shelf network designs and reduce the underlying computational overhead. We propose a novel Iterative Soft Shrinkage-Percentage (ISS-P) method by optimizing the sparse structure of a randomly network at each and tweaking unimportant weights with a small amount proportional to the magnitude scale on-the-fly.
  arXiv  Detail & Related papers  (2023-03-16T21:06:13Z)
• Scaling Forward Gradient With Local Losses [117.22685584919756]
  Forward learning is a biologically plausible alternative to backprop for learning deep neural networks. We show that it is possible to substantially reduce the variance of the forward gradient by applying perturbations to activations rather than weights. Our approach matches backprop on MNIST and CIFAR-10 and significantly outperforms previously proposed backprop-free algorithms on ImageNet.
  arXiv  Detail & Related papers  (2022-10-07T03:52:27Z)
• AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds [31.641383879577894]
  This paper presents a neural network for robust normal estimation on point clouds, named AdaFit, that can deal with point clouds with noise and density variations. Existing works use a network to learn point-wise weights for weighted least surface fitting to estimate the normals. We propose a simple yet effective solution that adds an additional offset prediction to improve the quality of normal estimation.
  arXiv  Detail & Related papers  (2021-08-12T16:37:24Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)

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.