Fast and Accurate Normal Estimation for Point Cloud via Patch Stitching

• URL: http://arxiv.org/abs/2103.16066v2
• Date: Wed, 31 Mar 2021 05:18:51 GMT
• Title: Fast and Accurate Normal Estimation for Point Cloud via Patch Stitching
• Authors: Jun Zhou, Wei Jin, Mingjie Wang, Xiuping Liu, Zhiyang Li and Zhaobin Liu
• Abstract summary: We present an effective normal estimation method adopting multi-patch stitching for an unstructured point cloud. Our method achieves SOTA results with the advantage of lower computational costs and higher robustness to noise over most of the existing approaches.
• Score: 12.559091712749279
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents an effective normal estimation method adopting multi-patch stitching for an unstructured point cloud. The majority of learning-based approaches encode a local patch around each point of a whole model and estimate the normals in a point-by-point manner. In contrast, we suggest a more efficient pipeline, in which we introduce a patch-level normal estimation architecture to process a series of overlapping patches. Additionally, a multi-normal selection method based on weights, dubbed as multi-patch stitching, integrates the normals from the overlapping patches. To reduce the adverse effects of sharp corners or noise in a patch, we introduce an adaptive local feature aggregation layer to focus on an anisotropic neighborhood. We then utilize a multi-branch planar experts module to break the mutual influence between underlying piecewise surfaces in a patch. At the stitching stage, we use the learned weights of multi-branch planar experts and distance weights between points to select the best normal from the overlapping parts. Furthermore, we put forward constructing a sparse matrix representation to reduce large-scale retrieval overheads for the loop iterations dramatically. Extensive experiments demonstrate that our method achieves SOTA results with the advantage of lower computational costs and higher robustness to noise over most of the existing approaches.

Related papers

• 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)
• Learning Continuous Implicit Field with Local Distance Indicator for Arbitrary-Scale Point Cloud Upsampling [55.05706827963042]
  Point cloud upsampling aims to generate dense and uniformly distributed point sets from a sparse point cloud. Previous methods typically split a sparse point cloud into several local patches, upsample patch points, and merge all upsampled patches. We propose a novel approach that learns an unsigned distance field guided by local priors for point cloud upsampling.
  arXiv  Detail & Related papers  (2023-12-23T01:52:14Z)
• 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)
• Weighted Point Cloud Normal Estimation [16.26518988623745]
  We introduce a weighted normal estimation method for 3D point cloud data. We propose a novel weighted normal regression technique that predicts point-wise weights from local point patches. Our method can robustly handle noisy and complex point clouds, achieving state-of-the-art performance on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2023-05-06T10:46:56Z)
• Patch-aware Batch Normalization for Improving Cross-domain Robustness [60.159546669021346]
  Cross-domain tasks present a challenge in which the model's performance will degrade when the training set and the test set follow different distributions. We propose a novel method called patch-aware batch normalization (PBN) By exploiting the differences between local patches of an image, our proposed PBN can effectively enhance the robustness of the model's parameters.
  arXiv  Detail & Related papers  (2023-04-06T03:25:42Z)
• Contrastive Learning for Joint Normal Estimation and Point Cloud Filtering [12.602645108896636]
  We propose a novel deep learning method to jointly estimate normals and filter point clouds. We first introduce a 3D patch based contrastive learning framework, with noise corruption as an augmentation. Experimental results show that our method well supports the two tasks simultaneously and preserves sharp features and fine details.
  arXiv  Detail & Related papers  (2022-08-14T09:16:25Z)
• 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 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)
• Layer-adaptive sparsity for the Magnitude-based Pruning [88.37510230946478]
  We propose a novel importance score for global pruning, coined layer-adaptive magnitude-based pruning (LAMP) score. LAMP consistently outperforms popular existing schemes for layerwise sparsity selection.
  arXiv  Detail & Related papers  (2020-10-15T09:14:02Z)
• Neural Subdivision [58.97214948753937]
  This paper introduces Neural Subdivision, a novel framework for data-driven coarseto-fine geometry modeling. We optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. We demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.
  arXiv  Detail & Related papers  (2020-05-04T20:03:21Z)

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.