PointNorm: Dual Normalization is All You Need for Point Cloud Analysis
- URL: http://arxiv.org/abs/2207.06324v4
- Date: Mon, 17 Apr 2023 18:03:00 GMT
- Title: PointNorm: Dual Normalization is All You Need for Point Cloud Analysis
- Authors: Shen Zheng, Jinqian Pan, Changjie Lu, Gaurav Gupta
- Abstract summary: We introduce a novel DualNorm module after the sampling-grouping operation to effectively and efficiently address the irregularity issue.
The DualNorm module consists of Point Normalization, which normalizes the grouped points to the sampled points, and Reverse Point Normalization, which normalizes the sampled points to the grouped points.
- Score: 0.7971699294672281
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Point cloud analysis is challenging due to the irregularity of the point
cloud data structure. Existing works typically employ the ad-hoc
sampling-grouping operation of PointNet++, followed by sophisticated local
and/or global feature extractors for leveraging the 3D geometry of the point
cloud. Unfortunately, the sampling-grouping operations do not address the point
cloud's irregularity, whereas the intricate local and/or global feature
extractors led to poor computational efficiency. In this paper, we introduce a
novel DualNorm module after the sampling-grouping operation to effectively and
efficiently address the irregularity issue. The DualNorm module consists of
Point Normalization, which normalizes the grouped points to the sampled points,
and Reverse Point Normalization, which normalizes the sampled points to the
grouped points. The proposed framework, PointNorm, utilizes local mean and
global standard deviation to benefit from both local and global features while
maintaining a faithful inference speed. Experiments show that we achieved
excellent accuracy and efficiency on ModelNet40 classification, ScanObjectNN
classification, ShapeNetPart Part Segmentation, and S3DIS Semantic
Segmentation. Code is available at
https://github.com/ShenZheng2000/PointNorm-for-Point-Cloud-Analysis.
Related papers
- PointCore: Efficient Unsupervised Point Cloud Anomaly Detector Using
Local-Global Features [18.32982981001087]
We propose an unsupervised point cloud anomaly detection framework based on joint local-global features, termed PointCore.
To be specific, PointCore only requires a single memory bank to store local (coordinate) and global (PointMAE) representations.
Experiments on Real3D-AD dataset demonstrate that PointCore achieves competitive inference time and the best performance in both detection and localization.
arXiv Detail & Related papers (2024-03-04T07:51:46Z) - PointGL: A Simple Global-Local Framework for Efficient Point Cloud
Analysis [19.163081544030547]
We introduce a novel, uncomplicated yet potent architecture known as PointGL to facilitate efficient point cloud analysis.
The fusion of one-time point embedding and parameter-free graph pooling contributes to PointGL's defining attributes of minimized model complexity and heightened efficiency.
Our PointGL attains state-of-the-art accuracy on the ScanObjectNN dataset while exhibiting a runtime that is more than 5 times faster and utilizing only approximately 4% of the FLOPs and 30% of the parameters compared to the recent PointMLP model.
arXiv Detail & Related papers (2024-01-22T02:05:33Z) - Point Deformable Network with Enhanced Normal Embedding for Point Cloud
Analysis [59.12922158979068]
Recently-based methods have shown strong performance in point cloud analysis.
Simple architectures are able to learn geometric features in local point groups yet fail to model long-range dependencies directly.
We propose Point Deformable Network (PDNet) to capture long-range relations with strong representation ability.
arXiv Detail & Related papers (2023-12-20T14:52:07Z) - Dynamic Clustering Transformer Network for Point Cloud Segmentation [23.149220817575195]
We propose a novel 3D point cloud representation network, called Dynamic Clustering Transformer Network (DCTNet)
It has an encoder-decoder architecture, allowing for both local and global feature learning.
Our method was evaluated on an object-based dataset (ShapeNet), an urban navigation dataset (Toronto-3D), and a multispectral LiDAR dataset.
arXiv Detail & Related papers (2023-05-30T01:11:05Z) - Unsupervised Deep Probabilistic Approach for Partial Point Cloud
Registration [74.53755415380171]
Deep point cloud registration methods face challenges to partial overlaps and rely on labeled data.
We propose UDPReg, an unsupervised deep probabilistic registration framework for point clouds with partial overlaps.
Our UDPReg achieves competitive performance on the 3DMatch/3DLoMatch and ModelNet/ModelLoNet benchmarks.
arXiv Detail & Related papers (2023-03-23T14:18:06Z) - Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud
Analysis [66.49788145564004]
We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology.
Our methods perform favorably against the current state-of-the-art competitors.
arXiv Detail & Related papers (2022-12-17T15:05:25Z) - MVP-Net: Multiple View Pointwise Semantic Segmentation of Large-Scale
Point Clouds [13.260488842875649]
In this paper, we propose an end-to-end neural architecture, Multiple View Pointwise Net, MVP-Net, to efficiently infer large-scale outdoor point cloud without KNN or complex pre/postprocessing.
Numerical experiments show that the proposed MVP-Net is 11 times faster than the most efficient pointwise semantic segmentation method RandLA-Net.
arXiv Detail & Related papers (2022-01-30T09:43:00Z) - PRIN/SPRIN: On Extracting Point-wise Rotation Invariant Features [91.2054994193218]
We propose a point-set learning framework PRIN, focusing on rotation invariant feature extraction in point clouds analysis.
In addition, we extend PRIN to a sparse version called SPRIN, which directly operates on sparse point clouds.
Results show that, on the dataset with randomly rotated point clouds, SPRIN demonstrates better performance than state-of-the-art methods without any data augmentation.
arXiv Detail & Related papers (2021-02-24T06:44:09Z) - Robust Kernel-based Feature Representation for 3D Point Cloud Analysis
via Circular Graph Convolutional Network [2.42919716430661]
We present a new local feature description method that is robust to rotation, density, and scale variations.
To improve representations of the local descriptors, we propose a global aggregation method.
Our method shows superior performances when compared to the state-of-the-art methods.
arXiv Detail & Related papers (2020-12-22T18:02:57Z) - 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) - PointGroup: Dual-Set Point Grouping for 3D Instance Segmentation [111.7241018610573]
We present PointGroup, a new end-to-end bottom-up architecture for instance segmentation.
We design a two-branch network to extract point features and predict semantic labels and offsets, for shifting each point towards its respective instance centroid.
A clustering component is followed to utilize both the original and offset-shifted point coordinate sets, taking advantage of their complementary strength.
We conduct extensive experiments on two challenging datasets, ScanNet v2 and S3DIS, on which our method achieves the highest performance, 63.6% and 64.0%, compared to 54.9% and 54.4% achieved by former best
arXiv Detail & Related papers (2020-04-03T16:26:37Z)
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.