Neighborhood-aware Geometric Encoding Network for Point Cloud
Registration
- URL: http://arxiv.org/abs/2201.12094v1
- Date: Fri, 28 Jan 2022 13:04:54 GMT
- Title: Neighborhood-aware Geometric Encoding Network for Point Cloud
Registration
- Authors: Lifa Zhu, Haining Guan, Changwei Lin, Renmin Han
- Abstract summary: Neighborhood-aware Geometric.
Network (NgeNet) for accurate point cloud registration.
NgeNet is model-agnostic, which could be easily migrated to other networks.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The distinguishing geometric features determine the success of point cloud
registration. However, most point clouds are partially overlapping, corrupted
by noise, and comprised of indistinguishable surfaces, which makes it a
challenge to extract discriminative features. Here, we propose the
Neighborhood-aware Geometric Encoding Network (NgeNet) for accurate point cloud
registration. NgeNet utilizes a geometric guided encoding module to take
geometric characteristics into consideration, a multi-scale architecture to
focus on the semantically rich regions in different scales, and a consistent
voting strategy to select features with proper neighborhood size and reject the
specious features. The awareness of adaptive neighborhood points is obtained
through the multi-scale architecture accompanied by voting. Specifically, the
proposed techniques in NgeNet are model-agnostic, which could be easily
migrated to other networks. Comprehensive experiments on indoor, outdoor and
object-centric synthetic datasets demonstrate that NgeNet surpasses all of the
published state-of-the-art methods. The code will be available at
https://github.com/zhulf0804/NgeNet.
Related papers
- SGNet: Salient Geometric Network for Point Cloud Registration [35.49985932039906]
Point Cloud Registration (PCR) is a critical and challenging task in computer vision.
Previous methods have encountered challenges with ambiguous matching due to similarity among patch blocks.
We propose a new framework that includes several novel techniques.
arXiv Detail & Related papers (2023-09-12T13:21:12Z) - Explaining Deep Neural Networks for Point Clouds using Gradient-based
Visualisations [1.2891210250935146]
We propose a novel approach to generate coarse visual explanations of networks designed to classify unstructured 3D data.
Our method uses gradients flowing back to the final feature map layers and maps these values as contributions of the corresponding points in the input point cloud.
The generality of our approach is tested on various point cloud classification networks, including'single object' networks PointNet, PointNet++, DGCNN, and a'scene' network VoteNet.
arXiv Detail & Related papers (2022-07-26T15:42:08Z) - GeoSegNet: Point Cloud Semantic Segmentation via Geometric
Encoder-Decoder Modeling [39.35429984469557]
We present a robust semantic segmentation network dubbed GeoSegNet.
Our GeoSegNet consists of a multi-geometry based encoder and a boundary-guided decoder.
Experiments show obvious improvements of our method over its competitors in terms of the overall segmentation accuracy and object boundary clearness.
arXiv Detail & Related papers (2022-07-14T09:24:05Z) - PointAttN: You Only Need Attention for Point Cloud Completion [89.88766317412052]
Point cloud completion refers to completing 3D shapes from partial 3D point clouds.
We propose a novel neural network for processing point cloud in a per-point manner to eliminate kNNs.
The proposed framework, namely PointAttN, is simple, neat and effective, which can precisely capture the structural information of 3D shapes.
arXiv Detail & Related papers (2022-03-16T09:20:01Z) - Differentiable Convolution Search for Point Cloud Processing [114.66038862207118]
We propose a novel differential convolution search paradigm on point clouds.
It can work in a purely data-driven manner and thus is capable of auto-creating a group of suitable convolutions for geometric shape modeling.
We also propose a joint optimization framework for simultaneous search of internal convolution and external architecture, and introduce epsilon-greedy algorithm to alleviate the effect of discretization error.
arXiv Detail & Related papers (2021-08-29T14:42:03Z) - ABD-Net: Attention Based Decomposition Network for 3D Point Cloud
Decomposition [1.3999481573773074]
We propose Attention Based Decomposition Network (ABD-Net) for point cloud decomposition.
We show improved performance of 3D object classification using attention features based on primitive shapes in point clouds.
arXiv Detail & Related papers (2021-07-09T08:39:30Z) - Learning Geometry-Disentangled Representation for Complementary
Understanding of 3D Object Point Cloud [50.56461318879761]
We propose Geometry-Disentangled Attention Network (GDANet) for 3D image processing.
GDANet disentangles point clouds into contour and flat part of 3D objects, respectively denoted by sharp and gentle variation components.
Experiments on 3D object classification and segmentation benchmarks demonstrate that GDANet achieves the state-of-the-arts with fewer parameters.
arXiv Detail & Related papers (2020-12-20T13:35:00Z) - Multi-scale Receptive Fields Graph Attention Network for Point Cloud
Classification [35.88116404702807]
The proposed MRFGAT architecture is tested on ModelNet10 and ModelNet40 datasets.
Results show it achieves state-of-the-art performance in shape classification tasks.
arXiv Detail & Related papers (2020-09-28T13:01:28Z) - SoftPoolNet: Shape Descriptor for Point Cloud Completion and
Classification [93.54286830844134]
We propose a method for 3D object completion and classification based on point clouds.
For the decoder stage, we propose regional convolutions, a novel operator aimed at maximizing the global activation entropy.
We evaluate our approach on different 3D tasks such as object completion and classification, achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2020-08-17T14:32:35Z) - SSN: Shape Signature Networks for Multi-class Object Detection from
Point Clouds [96.51884187479585]
We propose a novel 3D shape signature to explore the shape information from point clouds.
By incorporating operations of symmetry, convex hull and chebyshev fitting, the proposed shape sig-nature is not only compact and effective but also robust to the noise.
Experiments show that the proposed method performs remarkably better than existing methods on two large-scale datasets.
arXiv Detail & Related papers (2020-04-06T16:01:41Z) - EdgeNets:Edge Varying Graph Neural Networks [179.99395949679547]
This paper puts forth a general framework that unifies state-of-the-art graph neural networks (GNNs) through the concept of EdgeNet.
An EdgeNet is a GNN architecture that allows different nodes to use different parameters to weigh the information of different neighbors.
This is a general linear and local operation that a node can perform and encompasses under one formulation all existing graph convolutional neural networks (GCNNs) as well as graph attention networks (GATs)
arXiv Detail & Related papers (2020-01-21T15:51:17Z)
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.