mlsanityData to 7 Oct 2026

Progressive Seed Generation Auto-encoder for Unsupervised Point Cloud Learning

arXiv 2112.05213 ↗First posted 9 Dec 2021cs.CVcited by 12

Not on the map. Why?

Abstract (arXiv)

With the development of 3D scanning technologies, 3D vision tasks have become a popular research area. Owing to the large amount of data acquired by sensors, unsupervised learning is essential for understanding and utilizing point clouds without an expensive annotation process. In this paper, we propose a novel framework and an effective auto-encoder architecture named "PSG-Net" for reconstruction-based learning of point clouds. Unlike existing studies that used fixed or random 2D points, our framework generates input-dependent point-wise features for the latent point set. PSG-Net uses the encoded input to produce point-wise features through the seed generation module and extracts richer features in multiple stages with gradually increasing resolution by applying the seed feature propagation module progressively. We prove the effectiveness of PSG-Net experimentally; PSG-Net shows state-of-the-art performances in point cloud reconstruction and unsupervised classification, and achieves comparable performance to counterpart methods in supervised completion.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 29 of its 36 references that are in the map. First posted on arXiv 9 Dec 2021.

Builds on

29 of 36 references.

References · 29

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
  4. 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
  5. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
  6. 2015SSD: Single Shot MultiBox Detectorcited by 3,125
  7. 2015ShapeNet: An Information-Rich 3D Model Repositorycited by 2,880
  8. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
  9. 2018PointCNN: Convolution On X-Transformed Pointscited by 764
  10. 2018PointConv: Deep Convolutional Networks on 3D Point Cloudscited by 656
  11. 2018AtlasNet: A Papier-Mach'e Approach to Learning 3D Surface Generationcited by 539
  12. 2019PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flowscited by 487
17 more
  1. 2018PCN: Point Completion Networkcited by 382
  2. 2020GRNet: Gridding Residual Network for Dense Point Cloud Completioncited by 174
  3. 2020PF-Net: Point Fractal Network for 3D Point Cloud Completioncited by 146
  4. 2018PPF-FoldNet: Unsupervised Learning of Rotation Invariant 3D Local Descriptorscited by 140
  5. 20183D Point Capsule Networkscited by 106
  6. 2020Point Cloud Completion by Skip-attention Network with Hierarchical Foldingcited by 106
  7. 2018PointGrow: Autoregressively Learned Point Cloud Generation with Self-Attentioncited by 105
  8. 2020PMP-Net: Point Cloud Completion by Learning Multi-step Point Moving Pathscited by 97
  9. 2018Multiresolution Tree Networks for 3D Point Cloud Processingcited by 91
  10. 2020Discrete Point Flow Networks for Efficient Point Cloud Generationcited by 87
  11. 2018Point Cloud GANcited by 79
  12. 2020Global-Local Bidirectional Reasoning for Unsupervised Representation Learning of 3D Point Cloudscited by 75
  13. 2020Detail Preserved Point Cloud Completion via Separated Feature Aggregationcited by 70
  14. 2019RL-GAN-Net: A Reinforcement Learning Agent Controlled GAN Network for Real-Time Point Cloud Shape Completioncited by 58
  15. 2020SoftPoolNet: Shape Descriptor for Point Cloud Completion and Classificationcited by 33
  16. 2019Render4Completion: Synthesizing Multi-View Depth Maps for 3D Shape Completioncited by 22
  17. 2020Point Set Voting for Partial Point Cloud Analysiscited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 6; 2023: 2; 2024: 2; 2025: 1; 2026: 1.

12 papers.