atlas

Research map / Point clouds / Point cloud classification

DHGCN: Dynamic Hop Graph Convolution Network for Self-Supervised Point Cloud Learning

AAAI 2024 · Point clouds › Point cloud classification · approach: Local feature aggregation networks · 15 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes DHGCN, a plug-and-play graph module that self-supervises part-level hop-distance prediction over a complete graph of voxel parts and uses the predicted distances to weight edge features via Hop Graph Attention for self-supervised point cloud learning.

Problem

Existing GCN-based point cloud learners aggregate features within locally grouped point sets and ignore the contextual relationships between point sets; unsupervised point cloud representation learning needs better pretext tasks capturing this.

Approach

Voxelize the point cloud into parts, build a ground-truth graph whose edges connect intersecting scaled bounding boxes, and train the network to predict pairwise hop distances (a self-supervised task with a per-layer cross-entropy loss); the predicted distances then gate attention weights (via a Gaussian kernel) over edge features in a global complete part graph.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add DHGCN to the DGCNN backboneDGCNN · ModelNet40 (ShapeNet pretraining)accuracy: exceeding SSC by 0.8%Helped
Add DHGCN to the AdaptConv backboneAdaptConv · ModelNet40 (ModelNet40 pretraining)accuracy: surpassing GraphTER by 1.3%Helped
Use DHGCN rather than the strongest listed baselineDGCNN · ModelNet40 with limited training dataaccuracy: 1% data: 62.7% ... exceeding that of MAE3D by 1%Helped
Use DHGCN rather than the strongest listed unsupervised baselineDGCNN · ScanObjectNN OBJ_BGaccuracy: exceeding all compared SOTA unsupervised methods by at least 4.2%Helped
Use DHGCN rather than the strongest listed unsupervised baselinePAConv · ShapeNet Partclass mIoUHelped
Use Hop Graph Attention instead of SA with λ=0 and no hop distance loss (ablation)AdaptConv · ModelNet40accuracy: +0.5%Helped
Calculate hop distance loss in every layer rather than only the last layer (ablation)HGA with AdaptConv · ModelNet40distance accuracy: 93.3% versus 94.6%Helped
Calculate hop distance loss in every layer rather than only the last layer (ablation)HGA with AdaptConv · ModelNet40accuracy: 93.1% versus 93.3%Helped
Set Gaussian kernel σ² to 0.2 rather than 1.0 (ablation)HGA with AdaptConv · ModelNet40accuracy: 93.3% to 92.6%Hurt
Set Gaussian kernel σ² to 0.5 rather than 1.0 (ablation)HGA with AdaptConv · ModelNet40accuracy: 93.3% to 93.2%Hurt
Set Gaussian kernel σ² to 2.0 rather than 1.0 (ablation)HGA with AdaptConv · ModelNet40accuracy: 93.3% to 93.0%Hurt
Set Gaussian kernel σ² to 5.0 rather than 1.0 (ablation)HGA with AdaptConv · ModelNet40accuracy: 93.3% to 92.9%Hurt

Surprising findings

Limitations

Experimental setup

Datasets: ShapeNet ModelNet40 ScanObjectNN ShapeNet Part

Benchmarks: ModelNet40 ScanObjectNN ShapeNet Part

Metrics: accuracy mIoU instance mIoU class mIoU

Baselines: CrossPoint SSC (RSCNN) GraphTER STRL VIPGAN MAE3D Point-MAE Point-BERT PAConv CTNet

Builds on: DGCNN PointNet++ AdaptConv GraphTER

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy