A general framework for rotation invariant point cloud analysis
- URL: http://arxiv.org/abs/2402.01331v1
- Date: Fri, 2 Feb 2024 11:33:05 GMT
- Title: A general framework for rotation invariant point cloud analysis
- Authors: Shuqing Luo, Wei Gao
- Abstract summary: We present a thorough study on designing rotation invariant algorithms for point cloud analysis.
Our method is beneficial for further research such as 3D pre-training and multi-modal learning.
- Score: 5.617371373379918
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a general method for deep learning based point cloud analysis,
which is invariant to rotation on the inputs. Classical methods are vulnerable
to rotation, as they usually take aligned point clouds as input. Principle
Component Analysis (PCA) is a practical approach to achieve rotation
invariance. However, there are still some gaps between theory and practical
algorithms. In this work, we present a thorough study on designing rotation
invariant algorithms for point cloud analysis. We first formulate it as a
permutation invariant problem, then propose a general framework which can be
combined with any backbones. Our method is beneficial for further research such
as 3D pre-training and multi-modal learning. Experiments show that our method
has considerable or better performance compared to state-of-the-art approaches
on common benchmarks. Code is available at
https://github.com/luoshuqing2001/RI_framework.
Related papers
- Rotation-Invariant Random Features Provide a Strong Baseline for Machine
Learning on 3D Point Clouds [10.166033101890227]
We propose a simple and general-purpose method for learning rotation-invariant functions of three-dimensional point cloud data.
We show through experiments that our method matches or outperforms the performance of general-purpose rotation-invariant neural networks.
arXiv Detail & Related papers (2023-07-27T20:18:11Z) - A Restarted Large-Scale Spectral Clustering with Self-Guiding and Block
Diagonal Representation [1.115905690697198]
We propose a restarted clustering framework with self-guiding and block diagonal representation.
An advantage of the strategy is that some useful clustering information obtained from previous cycles could be preserved.
Theoretical results are established to show the rationality of inexact computations in spectral clustering.
arXiv Detail & Related papers (2023-06-27T01:38:52Z) - General Rotation Invariance Learning for Point Clouds via Weight-Feature
Alignment [40.421478916432676]
We propose Weight-Feature Alignment (WFA) to construct a local Invariant Reference Frame (IRF)
Our WFA algorithm provides a general solution for the point clouds of all scenes.
arXiv Detail & Related papers (2023-02-20T11:08:07Z) - ART-Point: Improving Rotation Robustness of Point Cloud Classifiers via
Adversarial Rotation [89.47574181669903]
In this study, we show that the rotation robustness of point cloud classifiers can also be acquired via adversarial training.
Specifically, our proposed framework named ART-Point regards the rotation of the point cloud as an attack.
We propose a fast one-step optimization to efficiently reach the final robust model.
arXiv Detail & Related papers (2022-03-08T07:20:16Z) - RIConv++: Effective Rotation Invariant Convolutions for 3D Point Clouds
Deep Learning [32.18566879365623]
3D point clouds deep learning is a promising field of research that allows a neural network to learn features of point clouds directly.
We propose a simple yet effective convolution operator that enhances feature distinction by designing powerful rotation invariant features from the local regions.
Our network architecture can capture both local and global context by simply tuning the neighborhood size in each convolution layer.
arXiv Detail & Related papers (2022-02-26T08:32:44Z) - Improving the Sample-Complexity of Deep Classification Networks with
Invariant Integration [77.99182201815763]
Leveraging prior knowledge on intraclass variance due to transformations is a powerful method to improve the sample complexity of deep neural networks.
We propose a novel monomial selection algorithm based on pruning methods to allow an application to more complex problems.
We demonstrate the improved sample complexity on the Rotated-MNIST, SVHN and CIFAR-10 datasets.
arXiv Detail & Related papers (2022-02-08T16:16:11Z) - 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) - 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) - A Rotation-Invariant Framework for Deep Point Cloud Analysis [132.91915346157018]
We introduce a new low-level purely rotation-invariant representation to replace common 3D Cartesian coordinates as the network inputs.
Also, we present a network architecture to embed these representations into features, encoding local relations between points and their neighbors, and the global shape structure.
We evaluate our method on multiple point cloud analysis tasks, including shape classification, part segmentation, and shape retrieval.
arXiv Detail & Related papers (2020-03-16T14:04:45Z) - Learning multiview 3D point cloud registration [74.39499501822682]
We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm.
Our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly.
arXiv Detail & Related papers (2020-01-15T03:42:14Z)
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.