PointShuffleNet: Learning Non-Euclidean Features with Homotopy Equivalence and Mutual Information

• URL: http://arxiv.org/abs/2104.02611v1
• Date: Wed, 31 Mar 2021 03:01:16 GMT
• Title: PointShuffleNet: Learning Non-Euclidean Features with Homotopy Equivalence and Mutual Information
• Authors: Linchao He, Mengting Luo, Dejun Zhang, Xiao Yang, Hu Chen and Yi Zhang
• Abstract summary: We propose a novel point cloud analysis neural network called PointShuffleNet (PSN), which shows great promise in point cloud classification and segmentation. Our PSN achieves state-of-the-art results on ModelNet40, ShapeNet and S3DIS with high efficiency.
• Score: 9.920649045126188
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud analysis is still a challenging task due to the disorder and sparsity of samplings of their geometric structures from 3D sensors. In this paper, we introduce the homotopy equivalence relation (HER) to make the neural networks learn the data distribution from a high-dimension manifold. A shuffle operation is adopted to construct HER for its randomness and zero-parameter. In addition, inspired by prior works, we propose a local mutual information regularizer (LMIR) to cut off the trivial path that leads to a classification error from HER. LMIR utilizes mutual information to measure the distance between the original feature and HER transformed feature and learns common features in a contrastive learning scheme. Thus, we combine HER and LMIR to give our model the ability to learn non-Euclidean features from a high-dimension manifold. This is named the non-Euclidean feature learner. Furthermore, we propose a new heuristics and efficiency point sampling algorithm named ClusterFPS to obtain approximate uniform sampling but at faster speed. ClusterFPS uses a cluster algorithm to divide a point cloud into several clusters and deploy the farthest point sampling algorithm on each cluster in parallel. By combining the above methods, we propose a novel point cloud analysis neural network called PointShuffleNet (PSN), which shows great promise in point cloud classification and segmentation. Extensive experiments show that our PSN achieves state-of-the-art results on ModelNet40, ShapeNet and S3DIS with high efficiency. Theoretically, we provide mathematical analysis toward understanding of what the data distribution HER has developed and why LMIR can drop the trivial path by maximizing mutual information implicitly.

Related papers

• Clustering based Point Cloud Representation Learning for 3D Analysis [80.88995099442374]
  We propose a clustering based supervised learning scheme for point cloud analysis. Unlike current de-facto, scene-wise training paradigm, our algorithm conducts within-class clustering on the point embedding space. Our algorithm shows notable improvements on famous point cloud segmentation datasets.
  arXiv  Detail & Related papers  (2023-07-27T03:42:12Z)
• GPr-Net: Geometric Prototypical Network for Point Cloud Few-Shot Learning [2.4366811507669115]
  GPr-Net is a lightweight and computationally efficient geometric network that captures the prototypical topology of point clouds. We show that GPr-Net outperforms state-of-the-art methods in few-shot learning on point clouds.
  arXiv  Detail & Related papers  (2023-04-12T17:32:18Z)
• Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
  We present two new classes of algorithms for efficient field integration on graphs encoding point clouds. The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
  arXiv  Detail & Related papers  (2023-02-02T08:33:36Z)
• Self-Supervised Arbitrary-Scale Point Clouds Upsampling via Implicit Neural Representation [79.60988242843437]
  We propose a novel approach that achieves self-supervised and magnification-flexible point clouds upsampling simultaneously. Experimental results demonstrate that our self-supervised learning based scheme achieves competitive or even better performance than supervised learning based state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-18T07:18:25Z)
• GenReg: Deep Generative Method for Fast Point Cloud Registration [18.66568286698704]
  We propose a new data-driven registration algorithm by investigating deep generative neural networks to point cloud registration. The experiments on both ModelNet40 and 7Scene datasets demonstrate that the proposed algorithm achieves state-of-the-art accuracy and efficiency.
  arXiv  Detail & Related papers  (2021-11-23T10:52:09Z)
• Learning Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• 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)
• PointManifold: Using Manifold Learning for Point Cloud Classification [5.705680763604835]
  We propose a point cloud classification method based on graph neural network and manifold learning. This paper uses manifold learning algorithms to embed point cloud features for better considering continuity on the surface. Experiments show that the proposed point cloud classification methods obtain the mean class accuracy (mA) of 90.2% and the overall accuracy (oA) of 93.2%.
  arXiv  Detail & Related papers  (2020-10-14T16:28:19Z)
• Permutation Matters: Anisotropic Convolutional Layer for Learning on Point Clouds [145.79324955896845]
  We propose a permutable anisotropic convolutional operation (PAI-Conv) that calculates soft-permutation matrices for each point. Experiments on point clouds demonstrate that PAI-Conv produces competitive results in classification and semantic segmentation tasks.
  arXiv  Detail & Related papers  (2020-05-27T02:42:29Z)

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.