Source-linked AI summary

Relation-Shape Convolutional Neural Network for Point Cloud Analysis

Yongcheng Liu, Bin Fan, Shiming Xiang, Chunhong Pan

arXiv:1904.07601v3cs.CVcs.AIcs.CGcs.GRcs.RO

TL;DR

Irregular point clouds make underlying shape difficult to capture. RS-CNN extends grid CNNs to irregular configurations by learning high-level geometric relations within local neighborhoods, and the paper reports state-of-the-art results across three tasks. The method is presented as providing contextual shape-aware learning with robustness to rigid transformations.

  • Problem

    Point cloud analysis must recover discriminative shape information from irregular points while handling local structure, permutation, and rigid transformations.

  • Method

    RS-CNN replaces conventional local convolution weights with relation-dependent weights learned from predefined geometric priors between a sampled point and its neighbors.

  • Results

    RS-CNN achieves state-of-the-art performance on challenging benchmarks spanning three tasks.

  • Takeaways & Limitations

    Learning geometric relations provides explicit spatial-layout reasoning for contextual, shape-aware point-cloud representations with robustness to rigid transformation.

  • Takeaways & Limitations

    Some accuracy drops are attributed mainly to forcible normalization, indicating sensitivity to that design choice.

Abstract

from arXiv · show

Point cloud analysis is very challenging, as the shape implied in irregular points is difficult to capture. In this paper, we propose RS-CNN, namely, Relation-Shape Convolutional Neural Network, which extends regular grid CNN to irregular configuration for point cloud analysis. The key to RS-CNN is learning from relation, i.e., the geometric topology constraint among points. Specifically, the convolutional weight for local point set is forced to learn a high-level relation expression from predefined geometric priors, between a sampled point from this point set and the others. In this way, an inductive local representation with explicit reasoning about the spatial layout of points can be obtained, which leads to much shape awareness and robustness. With this convolution as a basic operator, RS-CNN, a hierarchical architecture can be developed to achieve contextual shape-aware learning for point cloud analysis. Extensive experiments on challenging benchmarks across three tasks verify RS-CNN achieves the state of the arts.

1. Introduction

Point cloud analysis must recover shape from irregular, unordered 3D points while handling geometric transformations and preserving local structure. RS-CNN addresses this with relation-based convolution and a hierarchical architecture for contextual, shape-aware learning.

  • Motivation: 3D point cloud analysis is challenging because irregular points make their underlying shape difficult to infer.The task has applications including autonomous driving and robot manipulation.
  • Challenges: Existing local-to-global hierarchies depend on effective inductive learning from irregular point subsets, which remains difficult.PointNet independently processes points and can neglect local structures important for high-level visual concepts.
  • Challenges: Point-cloud learning must address permutation invariance, rigid-transformation robustness, and discriminative shape awareness.Permutation invariance is comparatively well resolved, while transformation robustness and shape awareness remain open challenges.
  • Method: RS-CNN learns geometric relations among points to encode spatial layout and obtain shape-aware, robust local representations.Each neighborhood uses a sampled centroid and surrounding neighbors; geometric priors support permutation invariance and robustness to translation and rotation.
  • Method: Relation-shape convolution extends regular-grid CNNs to irregular point configurations, while RS-CNN builds a hierarchical architecture for contextual shape-aware learning.The convolution operator is the basic building block of the proposed hierarchy.
  • Results: Extensive experiments across three challenging tasks, together with empirical and theoretical analyses, show that RS-CNN achieves state-of-the-art performance.The supplied passages do not report numerical results.

2. Related Work

Prior point-cloud methods use views, grids, lattices, graphs, or feature-space relations, but these approaches can lose geometric information or underrepresent local spatial layout. RS-CNN instead directly learns high-level geometric relations among points.

  • View-based and volumetric methods: View-based methods recognize multiple 2D projections, but self-occlusion can lose shape information and decent performance may require many views.These methods often fine-tune pretrained image-based architectures.
  • View-based and volumetric methods: Volumetric methods apply CNNs to regular 3D grids, but low-resolution quantization causes shape-information loss.K-d trees and octrees alleviate some resolution problems while still subdividing a bounding volume rather than modeling local geometric shape.
  • Deep learning on point cloud: PointNet independently learns point features and aggregates them globally, while PointNet++ introduces hierarchical processing over multiple subsets.Local structure exploitation and geometric-element partitioning are also explored in related methods.
  • Deep learning on point cloud: Lattice, continuous-volumetric, and related mappings facilitate CNN processing but can lose geometric information compared with direct point-cloud operation.RS-CNN is described as operating directly on the point cloud without such a transformation.
  • Irregularity and relation learning: Alignment networks and symmetric functions address transformation or permutation issues, but alignment is described as suboptimal and traditional descriptors less effective for high-level shape understanding.Learning geometric relations is presented as naturally robust to rigid transformation.
  • Irregularity and relation learning: Graph and point-cloud relation methods model local or feature-space relationships, but may not explicitly learn local-to-global spatial layout or may use unreliable relations.RS-CNN instead learns a high-level relation expression from geometric relations.

3. Shape-Aware Representation Learning

RS-CNN extends convolution to irregular point neighborhoods by learning geometric relations between a centroid and its neighbors. Aggregated relation-aware features provide shape-aware local representations that are hierarchically combined for classification and segmentation.

  • Relation-shape convolution: A local neighborhood is modeled as a spherical region around sampled centroid x_i, with shared feature transformation and symmetric aggregation producing its representation.Euclidean distance can define the geometric relation, while symmetric aggregation and shared transformations preserve permutation invariance.
  • Limitations of classic CNN: Classic convolution uses position-specific weights, which are permutation-sensitive and learn from isolated points rather than local shape relations.These limitations make it difficult to process irregular neighborhoods with varying point counts.
  • Relation-shape convolution: RS-Conv replaces each weight w_j with w_ij = M(h_ij), mapping predefined geometric relations between points into convolutional weights.The mapping M is implemented with a shared multilayer perceptron.
  • Properties: Relation-aware aggregation explicitly reasons about spatial layout and point interaction, yielding discriminative shape awareness and robustness to suitable rigid transformations.Using geometric priors such as Euclidean distance supports robustness to translation and rotation.
  • Revisiting 2D grid convolution: RS-Conv generalizes 2D grid convolution by learning spatial relations rather than restricting weights to fixed grid positions.In a regular grid, each conventional weight encodes a fixed positional relation; RS-Conv makes relation learning more general.
  • RS-CNN architecture: RS-CNN stacks RS-Conv with sampling into a hierarchy of shape-aware representations for point-cloud classification and segmentation.Classification uses a final global representation, while segmentation upsamples multi-level features for per-point predictions; both are trained end-to-end.

4. Experiment

Experiments evaluate RS-CNN across classification, sparse-input robustness, part segmentation, normal estimation, design ablations, transformations, visualization, and complexity. Across these tests, RS-CNN demonstrates strong accuracy, shape-aware representations, robustness, and reduced computational cost.

  • Shape classification: RS-CNN outperforms all xyz-input methods on ModelNet40 classification and reaches 93.6% accuracy using only xyz features.It reduces PointNet++'s error rate by 31.2% and surpasses SO-Net's 93.4% result despite SO-Net using additional inputs.
  • Sampling-density robustness: RS-CNN remains considerably robust as test inputs become sparser, showing superior performance to PointNet, PointNet++, PCNN, and DGCNN at each density.The model is trained with 1024 points and tested using 1024, 512, 256, 128, and 64 points.
  • Shape part segmentation: RS-CNN achieves 84.0% class mIoU and 86.2% instance mIoU on ShapeNet part segmentation, the best reported results in the comparison.These results exceed the cited second-best xyz-based methods by 1.7 and 1.1 percentage points, respectively.
  • Normal estimation: RS-CNN obtains a normal-estimation error of 0.15, reducing PointNet++'s 0.29 error by 48.3%.The authors also report that some intractable shapes, including spiral stairs and intricate plants, remain less effectively handled.
  • Visualization and complexity analysis: RS-CNN learns progressive shape-aware features, and compared with PointNet reduces parameters by 59.7% and FLOPs by 32.9%.The first layer responds mainly to edges, corners, and arcs, while the second captures semantic parts such as airfoils and heads.

5. Conclusion

RS-CNN extends regular-grid CNNs to irregular point clouds through a relation-based convolution operator that reasons about geometric topology and spatial layout. The resulting hierarchical network supports contextual, shape-aware learning and achieves state-of-the-art results across three tasks.

  • 5. Conclusion: RS-CNN extends regular grid CNNs to irregular point-cloud configurations through a novel relation-shape convolution operator.The operator learns from geometric topology constraints among points.
  • 5. Conclusion: The operator explicitly reasons about point spatial layout to obtain discriminative shape awareness.It also acquires robustness to rigid transformations from geometric relations.
  • 5. Conclusion: A hierarchical RS-CNN enables contextual shape-aware learning for point-cloud analysis.
  • 5. Conclusion: Extensive experiments across three challenging tasks, together with empirical and theoretical analysis, demonstrate state-of-the-art performance.

A. Outline

The supplementary material investigates local-neighborhood construction and 2D-view relation learning for RS-CNN, with all supplementary experiments conducted on ModelNet40.

  • A. Outline: The supplement examines three issues in constructing local neighborhoods for RS-CNN.These issues concern neighbor selection, relation aggregation, and centroid selection.
  • A. Outline: It provides further details on relation learning from 2D views of 3D point clouds.
  • A. Outline: All supplementary experiments are conducted on the ModelNet40 dataset.

B. Construction of Local Neighborhood

The local neighborhood is modeled around a sampled point and its surrounding neighbors, while supplementary experiments compare neighbor selection, relation aggregation, and centroid strategies. Random ball sampling outperforms k-NN, full relation training performs best, and single-centroid strategies slightly outperform fusion.

  • B. Construction of Local Neighborhood: RS-CNN models each local subset as a spherical neighborhood centered on sampled point x_i, aggregating relations between x_i and its neighbors N(x_i).The resulting representation is intended to reason about the neighborhood’s spatial layout.
  • B. Construction of Local Neighborhood: Random picking in the ball achieves better classification accuracy than k-nearest-neighbor selection.The authors suggest k-NN can select points inhomogeneously and focus aggregated relations on dense regions.
  • B. Construction of Local Neighborhood: Training with all relations performs best, while cutting off 30% of relations is the second-best strategy.The relation-cutting procedure randomly sets learned high-level relation expressions to zero during training.
  • B. Construction of Local Neighborhood: The sampled point and neighborhood-average centroid strategies achieve similar accuracy, whereas random centroid selection performs worse.Random centroids require reasoning over varied topological connections.
  • B. Construction of Local Neighborhood: 93.4% accuracy from fusing centroid relations is lower than the 93.6% achieved by the best single-centroid version.Fusion is performed by element-wise summation of representations centered on the three centroid types.
  • B. Construction of Local Neighborhood: Figure 9 projects the 3D point cloud onto the XY, XZ, and YZ planes.

C. Low-Level Relation h

The supplementary analysis tests whether RS-CNN can acquire shape awareness from low-level relations defined on 2D projections of a 3D point cloud.

  • C. Low-Level Relation h: RS-CNN evaluates low-level relations on 2D views by setting one coordinate dimension of each 3D point to zero.The tested views include projections onto the XY, XZ, and YZ planes.
  • C. Low-Level Relation h: The analysis asks how powerfully RS-CNN can acquire shape awareness using only relations from these 2D views.
Loading 1904.07601v3…